EnglishThe double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any delivery. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-rst-out policy. The problem consists in nding the shortest Hamiltonian cycles covering all pickup and delivery locations while ensuring the feasibility of the loading plan. We formulate the problem as two traveling salesman problems linked by infeasible path constraints. We also introduce several strengthenings of these constraints which are used within a branch-and-cut algorithm. Computational results performed on instances from the literature show that the algorithm outperforms existing exact algorithms. Instances with up to 28 requests (58 nodes) have been solved to optimality.
| Data di pubblicazione: | 2013 |
| Titolo: | A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks |
| Autore/i: | M.A. Alba Martinez; J.-F. Cordeau; M. Dell’Amico; M. Iori |
| Autore/i UNIMORE: | |
| Digital Object Identifier (DOI): | 10.1287/ijoc.1110.0489 |
| Rivista: | |
| Volume: | 25 |
| Pagina iniziale: | 41 |
| Pagina finale: | 55 |
| Codice identificativo ISI: | WOS:000315322400005 |
| Codice identificativo Scopus: | 2-s2.0-84877954040 |
| Citazione: | A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks / M.A. Alba Martinez; J.-F. Cordeau; M. Dell’Amico; M. Iori. - In: INFORMS JOURNAL ON COMPUTING. - ISSN 1091-9856. - STAMPA. - 25(2013), pp. 41-55. |
| Tipologia | Articolo su rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | |
|---|---|---|---|
| DTSPMS-InformsJOC-Appeared-2013.pdf | Versione editoriale | Administrator Richiedi una copia |
http://hdl.handle.net/11380/684360
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
Copyright © 2019