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

      An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

      ,
      Transportation Science
      Institute for Operations Research and the Management Sciences (INFORMS)

      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 references14

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

          Variable neighborhood search

            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 survey of very large-scale neighborhood search techniques

                Bookmark

                Author and article information

                Journal
                Transportation Science
                Transportation Science
                Institute for Operations Research and the Management Sciences (INFORMS)
                0041-1655
                1526-5447
                November 2006
                November 2006
                : 40
                : 4
                : 455-472
                Article
                10.1287/trsc.1050.0135
                e9d1ae5b-7daa-4777-9079-7842cb00ce23
                © 2006
                History

                Comments

                Comment on this article