TY  - JOUR
AU  - Felipe Ortega, Ángel
AU  - Ortuño Sánchez, María Teresa
AU  - Tirado Domínguez, Gregorio
PY  - 2009
DO  - 10.1016/j.cor.2009.01.015
SN  - 0305-0548
UR  - https://hdl.handle.net/20.500.14352/49906
T2  - Computers and Operations Research
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...
LA  - eng
M2  - 2983
PB  - Pergamon-Elsevier Science Ltd
KW  - Traveling Salesman Problem
KW  - Variable Neighborhood Search
KW  - LIFO Loading
KW  - Vehicle-Routing Problem
KW  - 2-Dimensional Loading Constraints
KW  - Delivery
KW  - Pickup
KW  - Algorithms
KW  - Computer Science
KW  - Interdisciplinary Applications
KW  - Engineering
KW  - Industrial
KW  - Operations Research & Management Science
TI  - The Double Traveling Salesman Problem With Multiple Stacks: A Variable Neighborhood Search Approach
TY  - journal article
VL  - 36
ER  -