RT Journal Article
T1 Neighborhood Structures To Solve The Double TSP With Multiple Stacks Using Local Search
A1 Felipe Ortega, Ángel
A1 Ortuño, M. T.
A1 Tirado Domínguez, Gregorio
AB 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.
PB World Scientific
YR 2008
FD 2008-09-21
LK https://hdl.handle.net/20.500.14352/49908
UL https://hdl.handle.net/20.500.14352/49908
DS Docta Complutense
RD 2 may 2024