Next Article in Journal
Hadoop vs. Spark: Impact on Performance of the Hammer Query Engine for Open Data Corpora
Next Article in Special Issue
Multi-Objective Bi-Level Programming for the Energy-Aware Integration of Flexible Job Shop Scheduling and Multi-Row Layout
Previous Article in Journal
Trajectory Clustering and k-NN for Robust Privacy Preserving Spatiotemporal Databases
Previous Article in Special Issue
MapReduce Algorithm for Location Recommendation by Using Area Skyline Query
Open AccessArticle

On the Use of Learnheuristics in Vehicle Routing Optimization Problems with Dynamic Inputs

by Quim Arnau 1, Angel A. Juan 1,2,* and Isabel Serra 3,4
1
IN3—Computer Science Department, Open University of Catalonia, 08018 Barcelona, Spain
2
Euncet Business School, 08225 Terrassa, Spain
3
Centre de Recerca Matemàtica, 08193 Bellaterra, Spain
4
Barcelona Supercomputing Center, 08034 Barcelona, Spain
*
Author to whom correspondence should be addressed.
Algorithms 2018, 11(12), 208; https://doi.org/10.3390/a11120208
Received: 21 November 2018 / Revised: 10 December 2018 / Accepted: 13 December 2018 / Published: 15 December 2018
(This article belongs to the Special Issue Algorithms for Decision Making)
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. View Full-Text
Keywords: vehicle routing problem; dynamic traveling times; learnheuristics vehicle routing problem; dynamic traveling times; learnheuristics
Show Figures

Figure 1

MDPI and ACS Style

Arnau, Q.; Juan, A.A.; Serra, I. On the Use of Learnheuristics in Vehicle Routing Optimization Problems with Dynamic Inputs. Algorithms 2018, 11, 208.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop