Publication: Neighborhood Structures To Solve The Double TSP With Multiple Stacks Using Local Search
No Thumbnail Available
Full text at PDC
Publication Date
2008-09-21
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
World Scientific
Citations
Exportar
Abstract
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.