On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
type: Item
instance of: scholarly article
title: On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
zbMATH Open document ID: 1461.90008
author: Quim Arnau
author: Angel A. Juan
author: Isabel Serra
published in: Algorithms
publication date: 2019-01-21T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7003859
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: dynamic traveling times
zbMATH Keywords: learnheuristics
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a11120208
OpenAlex ID: W2903789837
cites work: A review of recent research on green road freight transportation
cites work: A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
cites work: The elements of statistical learning. Data mining, inference, and prediction
cites work: Handbook of metaheuristics
cites work: Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
cites work: Vehicle dispatching with time-dependent travel times
cites work: Vehicle routing under time-dependent travel times: the impact of congestion avoidance
cites work: Vehicle routing with dynamic travel times: a queueing approach
cites work: Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
cites work: Combining metaheuristics with mathematical programming, constraint programming and machine learning
cites work: Synergies between operations research and data mining: the emerging use of multi-objective approaches
cites work: The ALGACEA‐1 method for the capacitated vehicle routing problem
cites work: A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
cites work: Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
cites work: Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
cites work: A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
cites work: Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
cites work: A multi-agent based cooperative approach to scheduling and routing
DOI: 10.3390/A11120208
description: scientific article; zbMATH DE number 7003859