Please use this identifier to cite or link to this item:
|Title:||A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem|
|Author:||Guimarans Serrano, Daniel|
Juan Pérez, Ángel Alejandro
Martinez Masip, Enoc
Monte Carlo methods
|Publisher:||Winter Simulation Conference (WSC). Proceedings|
|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|
|Published in:||Winter Simulation Conference, Washington D.C., EUA, 11-14, desembre de 2016|
|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.|
|Appears in Collections:||Articles|
Files in This Item:
There are no files associated with this item.
Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.