6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows

      , , ,
      Transportation Research Part B: Methodological
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references8

          • Record: found
          • Abstract: not found
          • Article: not found

          Routing and scheduling of vehicles and crews

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows

                Bookmark

                Author and article information

                Journal
                Transportation Research Part B: Methodological
                Transportation Research Part B: Methodological
                Elsevier BV
                01912615
                June 1986
                June 1986
                : 20
                : 3
                : 243-257
                Article
                10.1016/0191-2615(86)90020-2
                73853033-9a4b-4bd7-a981-54ee5de61ea5
                © 1986

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article