Universidad Complutense de Madrid
E-Prints Complutense

Neighborhood structures to solve the Double TSP with Multiple Stacks using local search



Downloads per month over past year

Ortuño, M. T. and Felipe Ortega, Ángel and Tirado Domínguez, Gregorio (2008) Neighborhood structures to solve the Double TSP with Multiple Stacks using local search. In Computational Intelligence In Decision And Control. World Scientific Proceedings Series on Computer Engineering and Information Science, 1 . WORLD SCIENTIFIC PUBL CO PTE LTD, Singapore, 701-706 . ISBN 978-981-279-946-3

Official URL: http://www.worldscientific.com/doi/abs/10.1142/9789812799470_0115


The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. One item is required to be sent from each location in the first network to a location in the second network. Collected items can be stored in several LIFO stacks, but repacking is not allowed. In this paper we present four new neighborhood structures for the DTSPMS, and they are embedded, together with other two existing ones, into a Variable Neighborhood Search heuristic that is used to solve the problem.

Item Type:Book Section
Additional Information:

8th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science. Madrid, SPAIN. SEP 21-24, 2008.

Uncontrolled Keywords:Vehicle routing; Variable Neighborhood Search
Subjects:Sciences > Mathematics > Operations research
ID Code:17455
Deposited On:17 Dec 2012 09:25
Last Modified:21 Jan 2021 10:31

Origin of downloads

Repository Staff Only: item control page