Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

Neighborhood Structures To Solve The Double TSP With Multiple Stacks Using Local Search

dc.contributor.authorFelipe Ortega, Ángel
dc.contributor.authorTirado Domínguez, Gregorio
dc.contributor.authorOrtuño Sánchez, María Teresa
dc.date.accessioned2023-06-20T09:33:42Z
dc.date.available2023-06-20T09:33:42Z
dc.date.issued2008-09-21
dc.description.abstractThe 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.en
dc.description.departmentDepto. de Estadística e Investigación Operativa
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/15164
dc.identifier.officialurlhttps://doi.org/10.1142/9789812799470_0115
dc.identifier.relatedurlhttp://www.worldscinet.com/
dc.identifier.urihttps://hdl.handle.net/20.500.14352/49908
dc.journal.titleComputational Intelligence In Decision And Control
dc.publisherWorld Scientific
dc.rights.accessRightsmetadata only access
dc.subject.cdu004.8
dc.subject.ucmInteligencia artificial (Informática)
dc.subject.unesco1203.04 Inteligencia Artificial
dc.titleNeighborhood Structures To Solve The Double TSP With Multiple Stacks Using Local Search
dc.typejournal article
dc.volume.number1
dspace.entity.typePublication
relation.isAuthorOfPublication72ddce0d-fbc4-4233-800c-cbd2cc36a012
relation.isAuthorOfPublication9a8e32e5-51d7-41cd-9e5f-781d838bce09
relation.isAuthorOfPublication6f9ad449-8cec-4e55-aca2-7dedcde6b101
relation.isAuthorOfPublication.latestForDiscovery72ddce0d-fbc4-4233-800c-cbd2cc36a012

Download

Collections