A simheuristic approach for the two-dimensional vehicle routing problem with stochastic travel times |
| |
| Affiliation: | 1. Aviation Academy, Amsterdam University of Applied Sciences, Amsterdam, Netherlands;2. Opein Inc., Gran Canaria, Canary Islands, Spain;3. IN3 – Computer Science, Multimedia and Telecommunication Dept., Universitat Oberta de Catalunya, Barcelona, Spain;1. Departamento de Didácticas Específicas, Universidad de Burgos, Spain;2. Departamento de Economía Aplicada, Universidad de Burgos, Plaza Infanta Elena s/n, Burgos 09001 Spain;1. Departmento de Ingeniería Industrial, Pontificia Universidad Javeriana, Bogotá, Colombia;2. IN3 – Computer Science, Multimedia and Telecommunications Department, Open University of Catalonia, Barcelona, Spain;3. Doctorado en Logística y Gestión de Cadenas de Suministros, Universidad de La Sabana, Chía, Colombia;1. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, Jiangxi, China;2. Department of Industrial Systems Engineering and Management, National University of Singapore, 1 Engineering Drive 2, Singapore 117576, Singapore;3. Department of Computer Science, Xiamen University, Xiamen 361005, China;4. Faculty of Engineering, The University of Hong Kong, Pokfulam, Hong Kong;5. City University of Hong Kong Shenzhen Research Institute (CityUSRI), Shenzhen, China;1. Institute of Intelligent Systems and Numerical Applications in Engineering, University of Las Palmas de Gran Canaria, 35017 Las Palmas de Gran Canaria, Spain;2. Optimisation Research Group, NICTA, Eveleigh, NSW 2015, Australia;3. Aviation Academy, Amsterdam University of Applied Sciences, Amsterdam 1097 DZ, Netherlands;4. Computer Science Department-IN3, Open University of Catalonia, Barcelona 08018, Spain |
| |
| Abstract: | The two-dimensional vehicle routing problem (2L-VRP) is a realistic extension of the classical vehicle routing problem in which customers’ demands are composed by sets of non-stackable items. Examples can be found in real-life applications such as the transportation of furniture or industrial machinery. Often, it is necessary to consider stochastic travel times due to traffic conditions or customers availability. However, there is a lack of works discussing stochastic versions of the 2L-VRP. This paper offers a model of the 2L-VRP with stochastic travel times that also includes penalty costs generated by overtime. To solve this stochastic and non-smooth version of the 2L-VRP, a hybrid simheuristic algorithm is proposed. Our approach combines Monte Carlo simulation, an iterated local search framework, and biased-randomised routing and packing heuristics. Our algorithm is tested on an extensive benchmark, which extends the deterministic one for the 2L-VRP with unrestricted and non-oriented loading. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
