New Neighborhood Structures For The Double Traveling Salesman Problem With Multiple Stacks



Downloads per month over past year

Felipe Ortega, Ángel and Ortuño, M. T. and Tirado Domínguez, Gregorio (2009) New Neighborhood Structures For The Double Traveling Salesman Problem With Multiple Stacks. Top, 17 (1). pp. 190-213. ISSN 1134-5764

[thumbnail of 03.pdf] PDF
Restringido a Repository staff only


Official URL:


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.

Item Type:Article
Additional Information:

International Workshop On Operational Research Conference Held In Honor Of Laureano F Escudero,Jun 05-07, 2008,Madrid

Uncontrolled Keywords:Traveling Salesman Problem; Metaheuristics; Neighborhood Structures; Precedence Constraints; Lifo Loading
Subjects:Sciences > Mathematics > Differential equations
ID Code:15083
Deposited On:04 May 2012 11:36
Last Modified:21 Jan 2021 10:31

Origin of downloads

Repository Staff Only: item control page