Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/86525
Title: On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
Author: Arnau Ortega, Quim
Juan Pérez, Ángel Alejandro
Serra Mochales, Isabel
Others: Centre de Recerca Matemàtica
Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3)
Keywords: vehicle routing problem
dynamic traveling times
learnheuristics
Issue Date: 15-Dec-2018
Publisher: Algorithms
Citation: Arnau,Q., Juan, A., & Serra, I. (2018). On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs. Algorithms 11(12), doi: 10.3390/a11120208
Project identifier: info:eu-repo/grantAgreement/2017-1-ES01-KA103-036672
Also see: https://www.mdpi.com/1999-4893/11/12/208/htm
Abstract: Freight transportation is becoming an increasingly critical activity for enterprises in a global world. Moreover, the distribution activities have a non-negligible impact on the environment, as well as on the citizens' welfare. The classical vehicle routing problem (VRP) aims at designing routes that minimize the cost of serving customers using a given set of capacitated vehicles. Some VRP variants consider traveling times, either in the objective function (e.g., including the goal of minimizing total traveling time or designing balanced routes) or as constraints (e.g., the setting of time windows or a maximum time per route). Typically, the traveling time between two customers or between one customer and the depot is assumed to be both known in advance and static. However, in real life, there are plenty of factors (predictable or not) that may affect these traveling times, e.g., traffic jams, accidents, road works, or even the weather. In this work, we analyze the VRP with dynamic traveling times. Our work assumes not only that these inputs are dynamic in nature, but also that they are a function of the structure of the emerging routing plan. In other words, these traveling times need to be dynamically re-evaluated as the solution is being constructed. In order to solve this dynamic optimization problem, a learnheuristic-based approach is proposed. Our approach integrates statistical learning techniques within a metaheuristic framework. A number of computational experiments are carried out in order to illustrate our approach and discuss its effectiveness.
Language: English
URI: http://hdl.handle.net/10609/86525
ISSN: 1999-4893MIAR
Appears in Collections:Articles
Articles

Share:
Export:
Files in This Item:
File Description SizeFormat 
algorithms-11-00208.pdf403.82 kBAdobe PDFView/Open Request a copy

This item is licensed under a Creative Commons License Creative Commons