RT Journal Article
T1 New Neighborhood Structures For The Double Traveling Salesman Problem With Multiple Stacks
A1 Felipe Ortega, Ángel
A1 Ortuño Sánchez, María Teresa
A1 Tirado Domínguez, Gregorio
AB Abstract The changing requirements in transportation and logistics have recently induced the appearance of new vehicle routing problems that include complex constraints as precedence or loading constraints. One of these problems that have appeared during the last few years is the Double Traveling Salesman Problem with.Multiple Stacks (DTSPMS), a vehicle routing problem in which some pickups and deliveries must be performed in two independent networks, verifying some precedence and loading constraints imposed on the vehicle.In this paper, four new neighborhood structures for the DTSPMS based on reinsertion and permutation of orders to modify both the routes and the loading planning of the solutions are introduced and described in detail.They can be used in combination with any metaheuristic using local search as a subprocedure, guiding the search to unexplored zones of the solution space. Some computational results obtained using all proposed neighborhood structures are presented, providing good quality solutions for real sized instances.
PB Springer
SN 1134-5764
YR 2009
FD 2009
LK https://hdl.handle.net/20.500.14352/49890
UL https://hdl.handle.net/20.500.14352/49890
LA eng
NO Felipe, A., M. T. Ortuño, y G. Tirado. «New Neighborhood Structures for the Double Traveling Salesman Problem with Multiple Stacks». TOP 17, n.o 1 (julio de 2009): 190-213. https://doi.org/10.1007/s11750-009-0080-9.
NO International Workshop On Operational Research Conference Held In Honor Of Laureano F Escudero,Jun 05-07, 2008,Madrid
DS Docta Complutense
RD 11 abr 2025