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
 

The Double Traveling Salesman Problem With Multiple Stacks: A Variable Neighborhood Search Approach

Simple item page
dc.contributor.authorFelipe Ortega, Ángel
dc.contributor.authorOrtuño Sánchez, María Teresa
dc.contributor.authorTirado Domínguez, Gregorio
dc.date.accessioned2023-06-20T09:33:40Z
dc.date.available2023-06-20T09:33:40Z
dc.date.issued2009
dc.description.abstractThe double traveling salesman problem with multiple stacks (DTSPMS) is a vehicle routing problem that consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. A set of orders is given, each one consisting of a pickup location and a delivery location, and it is required to send an item from the former location to the latter one. Repacking is not allowed, but collected items can be packed in several rows in such a way that each row must obey the LIFO principle. In this paper, a variable neighborhood search approach using four new neighborhood structures is presented 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.sponsorshipUniversidad Complutense de Madrid
dc.description.sponsorshipDGI
dc.description.sponsorshipMadrid Ciencia y Tecnología
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/15150
dc.identifier.doi10.1016/j.cor.2009.01.015
dc.identifier.issn0305-0548
dc.identifier.officialurlhttps//doi.org/10.1016/j.cor.2009.01.015
dc.identifier.relatedurlhttp://www.sciencedirect.com/science/article/pii/S0305054809000288
dc.identifier.urihttps://hdl.handle.net/20.500.14352/49906
dc.issue.number11
dc.journal.titleComputers and Operations Research
dc.language.isoeng
dc.page.final2993
dc.page.initial2983
dc.publisherPergamon-Elsevier Science Ltd
dc.relation.projectIDUCM2006-910707
dc.relation.projectIDTIN2006-06190
dc.relation.projectIDMTM2006-14961-C05-05
dc.rights.accessRightsrestricted access
dc.subject.cdu519.22
dc.subject.keywordTraveling Salesman Problem
dc.subject.keywordVariable Neighborhood Search
dc.subject.keywordLIFO Loading
dc.subject.keywordVehicle-Routing Problem
dc.subject.keyword2-Dimensional Loading Constraints
dc.subject.keywordDelivery
dc.subject.keywordPickup
dc.subject.keywordAlgorithms
dc.subject.keywordComputer Science
dc.subject.keywordInterdisciplinary Applications
dc.subject.keywordEngineering
dc.subject.keywordIndustrial
dc.subject.keywordOperations Research & Management Science
dc.subject.ucmEcuaciones diferenciales
dc.subject.unesco1202.07 Ecuaciones en Diferencias
dc.titleThe Double Traveling Salesman Problem With Multiple Stacks: A Variable Neighborhood Search Approachen
dc.typejournal article
dc.volume.number36
dspace.entity.typePublication
relation.isAuthorOfPublication72ddce0d-fbc4-4233-800c-cbd2cc36a012
relation.isAuthorOfPublication6f9ad449-8cec-4e55-aca2-7dedcde6b101
relation.isAuthorOfPublication9a8e32e5-51d7-41cd-9e5f-781d838bce09
relation.isAuthorOfPublication.latestForDiscovery72ddce0d-fbc4-4233-800c-cbd2cc36a012

Download

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Tirado201.pdf
Size:
389.59 KB
Format:
Adobe Portable Document Format
Download

Collections

Artículos