RT Journal Article
T1 The Double Traveling Salesman Problem With Multiple Stacks: A Variable Neighborhood Search Approach
A1 Felipe Ortega, Ángel
A1 Ortuño Sánchez, María Teresa
A1 Tirado Domínguez, Gregorio
AB The double traveling salesman problem with multiple stacks (DTSPMS) is a vehicle routing problem that consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. A set of orders is given, each one consisting of a pickup location and a delivery location, and it is required to send an item from the former location to the latter one. Repacking is not allowed, but collected items can be packed in several rows in such a way that each row must obey the LIFO principle.In this paper, a variable neighborhood search approach using four new neighborhood structures is presented to solve the problem.
PB Pergamon-Elsevier Science Ltd
SN 0305-0548
YR 2009
FD 2009
LK https://hdl.handle.net/20.500.14352/49906
UL https://hdl.handle.net/20.500.14352/49906
LA eng
NO Universidad Complutense de Madrid
NO DGI
NO Madrid Ciencia y Tecnología
DS Docta Complutense
RD 4 abr 2025