Felipe Ortega, ÁngelTirado Domínguez, GregorioOrtuño Sánchez, María Teresa2023-06-202023-06-202008-09-21https://hdl.handle.net/20.500.14352/49908The 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.journal articlehttps://doi.org/10.1142/9789812799470_0115http://www.worldscinet.com/metadata only access004.8Inteligencia artificial (Informática)1203.04 Inteligencia Artificial