A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
Year of publication: |
2022
|
---|---|
Authors: | Hernández-Pérez, Hipólito ; Salazar-González, Juan-José |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 297.2022, 2 (1.3.), p. 467-483
|
Subject: | Travelling salesman | Vehicle routing problem | Split demand | Pickup-and-delivery | Bike shared system | Tourenplanung | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm |
-
Hernández-Pérez, Hipólito, (2018)
-
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times
Cacchiani, Valentina, (2020)
-
Silva, Bruno C. H., (2020)
- More ...
-
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
-
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2016)
-
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
- More ...