Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem
Year of publication: |
September 2018
|
---|---|
Authors: | Hernández-Pérez, Hipólito ; Salazar-González, Juan José ; Santos-Hernández, Beatriz |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 97.2018, p. 1-17
|
Subject: | Travelling salesman | Vehicle routing problem | Split demand | Heuristics | Tourenplanung | Heuristik | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Hernández-Pérez, Hipólito, (2022)
-
Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
Silva, Bruno C. H., (2020)
- More ...
-
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
-
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
-
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
- More ...