Abstract—We present a non standard Euclidean vehicle routing problem adding a level of clustering, and we revisit the use of self-organizing maps as a tool which naturally handles such problems. We present how they can be used as a main operator into an evolutionary algorithm to address two conflicting objectives of route length and distance from customers to bus stops minimization and to deal with capacity constraints. We apply the approach to a real-life case of combined clustering and vehicle routing for the transportation of the 780 employees of an enterprise. Basing upon a geographic information system we discuss the influence of road infrastructures on the solutions generated. Keyworks—Evolutionary algorithm, self-organizing map, clus...
The vehicle routing problem (VRP) deals with the allocation of vehicles to the customers that have r...
A Vehicle Routing Problem solver which aims to solve real-life problems from transportation planning...
The Vehicle Routing Problem (VRP), which has many sub-branches, is a difficult problem that cannot b...
Dimensioning Routes to the Demand Abstract—We present a non standard Euclidean vehicle routing probl...
We present a non standard Euclidean vehicle routing problem adding a level of clustering, and we rev...
The article presents the memetic SOM, an evolutionary algorithm embedding self-organizing maps as op...
The paper deals with a hybrid clustering-genetic algorithm that is applied to a rolling-horizon proc...
This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time...
[[abstract]]The present study investigates the cost concerns of distribution centers and formulates ...
Abstract—Cooperative vehicular networks have always been considered as the perfect way to bring more...
The methodology proposed in this article enables a systematic design of routing algorithms based on ...
The Vehicle Routing Problem (VRP) is an NP-hard, combinatorial optimization problem. For NP-hard pro...
Urban transportation is a complex phenomenon. Since many agents are constantly interacting in parall...
Dissertação para obtenção do Grau de Mestre em Logica ComputicionalThe Vehicle Routing Problem (VRP...
A generalized clustering method based on a Genetic Algorithm is proposed. The Genetic Clustering (Ge...
The vehicle routing problem (VRP) deals with the allocation of vehicles to the customers that have r...
A Vehicle Routing Problem solver which aims to solve real-life problems from transportation planning...
The Vehicle Routing Problem (VRP), which has many sub-branches, is a difficult problem that cannot b...
Dimensioning Routes to the Demand Abstract—We present a non standard Euclidean vehicle routing probl...
We present a non standard Euclidean vehicle routing problem adding a level of clustering, and we rev...
The article presents the memetic SOM, an evolutionary algorithm embedding self-organizing maps as op...
The paper deals with a hybrid clustering-genetic algorithm that is applied to a rolling-horizon proc...
This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time...
[[abstract]]The present study investigates the cost concerns of distribution centers and formulates ...
Abstract—Cooperative vehicular networks have always been considered as the perfect way to bring more...
The methodology proposed in this article enables a systematic design of routing algorithms based on ...
The Vehicle Routing Problem (VRP) is an NP-hard, combinatorial optimization problem. For NP-hard pro...
Urban transportation is a complex phenomenon. Since many agents are constantly interacting in parall...
Dissertação para obtenção do Grau de Mestre em Logica ComputicionalThe Vehicle Routing Problem (VRP...
A generalized clustering method based on a Genetic Algorithm is proposed. The Genetic Clustering (Ge...
The vehicle routing problem (VRP) deals with the allocation of vehicles to the customers that have r...
A Vehicle Routing Problem solver which aims to solve real-life problems from transportation planning...
The Vehicle Routing Problem (VRP), which has many sub-branches, is a difficult problem that cannot b...