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

      The dial-a-ride problem: models and algorithms

      ,
      Annals of Operations Research
      Springer Nature

      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 references31

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

          A Tabu Search Heuristic for the Vehicle Routing Problem

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

            A unified tabu search heuristic for vehicle routing problems with time windows

              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

                Author and article information

                Journal
                Annals of Operations Research
                Ann Oper Res
                Springer Nature
                0254-5330
                1572-9338
                June 6 2007
                May 5 2007
                : 153
                : 1
                : 29-46
                Article
                10.1007/s10479-007-0170-8
                12bedae4-1380-4e81-a06d-e7ea1fc2736a
                © 2007
                History

                Comments

                Comment on this article