Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/90878
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Guimarans, Daniel | - |
dc.contributor.author | Dominguez, Oscar | - |
dc.contributor.author | Juan, Angel A. | - |
dc.contributor.author | Martinez Masip, Enoc | - |
dc.date.accessioned | 2019-01-30T12:16:39Z | - |
dc.date.available | 2019-01-30T12:16:39Z | - |
dc.date.issued | 2016-12 | - |
dc.identifier.citation | Guimarans, D., Dominguez, O., Juan, A.A. & Martinez, E. (2016). A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem. Winter Simulation Conference (WSC). Proceedings, 2016(), 2326-2334. doi: 10.1109/WSC.2016.7822273 | - |
dc.identifier.isbn | 9781509044863 | - |
dc.identifier.issn | 1558-4305MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/90878 | - |
dc.description.abstract | The two-dimensional vehicle routing problem (2L-VRP) is a realistic extension of the classical vehicle routing problem where customers' demands are composed by sets of non-stackable items. Examples of such problems can be found in many real-life applications, e.g. furniture or industrial machinery transportation. Often, these real-life instances have to deal with uncertainty in many aspects of the problem, such as variable traveling times due to traffic conditions or customers availability. We present a hybrid simheuristic algorithm that combines biased-randomized routing and packing heuristics within a multi-start framework. Monte Carlo simulation is used to deal with uncertainty at different stages of the search process. With the goal of minimizing total expected cost, we use this methodology to solve a set of stochastic instances of the 2L-VRP with unrestricted oriented loading. Our results show that accounting for systems variability during the algorithm search yields more robust solutions with lower expected costs. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Winter Simulation Conference (WSC). Proceedings | - |
dc.relation.ispartof | Winter Simulation Conference (WSC). Proceedings, 2016 | - |
dc.relation.ispartofseries | Winter Simulation Conference, Washington D.C., EUA, 11-14, desembre de 2016 | - |
dc.relation.uri | https://ieeexplore.ieee.org/document/7822273 | - |
dc.relation.uri | https://www.informs-sim.org/wsc16papers/203.pdf | - |
dc.rights | (c) Author/s & (c) Journal | - |
dc.subject | routing | en |
dc.subject | vehicles | en |
dc.subject | vehicle routing | en |
dc.subject | computational modeling | en |
dc.subject | heuristic algorithms | en |
dc.subject | cost reduction | en |
dc.subject | Monte Carlo methods | en |
dc.subject | enrutament | ca |
dc.subject | vehicles | ca |
dc.subject | enrutament de vehicles | ca |
dc.subject | model computacional | ca |
dc.subject | algorismes heurístics | ca |
dc.subject | reducció de cost | ca |
dc.subject | mètodes Monte Carlo | ca |
dc.subject | enrutamiento | es |
dc.subject | vehículos | es |
dc.subject | modelo computacional | es |
dc.subject | algoritmos heurísticos | es |
dc.subject | reducción de coste | es |
dc.subject | métodos Monte Carlo | es |
dc.subject | enrutamiento de vehículos | es |
dc.subject.lcsh | Algorithms | en |
dc.title | A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem | - |
dc.type | info:eu-repo/semantics/conferenceObject | - |
dc.audience.mediator | Theme areas | en |
dc.subject.lemac | Algorismes | ca |
dc.subject.lcshes | Algoritmos | es |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | - |
dc.identifier.doi | 10.1109/WSC.2016.7822273 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TRA2013-48180-C3-P | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TRA2015-71883-REDT | - |
dc.relation.projectID | info:eu-repo/grantAgreement/2014-CTP-00001 | - |
Aparece en las colecciones: | Articles |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.
Comparte:
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.