Title:
|
Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem
|
Author:
|
Juan Pérez, Angel Alejandro; Barrios, Barry; González Martín, Sergio; Coccola, Mariana; Faulín, Javier; Bektas, Tolga
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I |
Abstract:
|
This paper proposes a hybrid algorithm, combining Biased-Randomized (BR) processes with an Iterated
Local Search (ILS) meta-heuristic, to solve the Multi-Depot Vehicle Routing Problem (MDVRP).
Our approach assumes a scenario in which each depot has unlimited service capacity and in which all vehicles
are identical (homogeneous fleet). During the routing process, however, each vehicle is assumed to
have a limited capacity. Two BR processes are employed at different stages of the ILS procedure in order
to: (a) define the perturbation operator, which generates new ‘assignment maps’ by associating customers
to depots in a biased-random way –according to a distance-based criterion; and (b) generate ‘good’ routing
solutions for each customers-depots assignment map. These biased-randomization processes rely on
the use of a pseudo-geometric probability distribution. Our approach does not need from fine-tuning processes
which usually are complex and time consuming. Some preliminary tests have been carried out already
with encouraging results. |
Subject(s):
|
-Àrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat -Probabilities -Machine theory -Probabilitats -Màquines, Teoria de |
Rights:
|
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Document type:
|
Article - Published version Conference Object |
Share:
|
|