Add to ORKGtextabstractThis paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on real-life data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the "visual attractiveness" of the plan. Computational results show that, in general, the Savings Based algorithm not only performs better with respect to these non-standard quality measures, but also with respect to the traditional measures
Due to the severe impact of road traffic congestion on both economy and environment, several vehicle...
The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its wel...
This paper shows how idealized models can be used to obtain cost-effective, implementable solutions ...
Forty five years ago, an academic and practitioner from the north of England published a method of t...
In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to...
Forty five years ago, an academic and practitioner from the north of England published a method of t...
This paper describes an algorithm for producing visually attractive and operationally robust solutio...
Vehicle Routing Problems (VRPs) have received a lot of attention in the recent years, both from a th...
A variant of the Clark and Wright’s saving method is presented. Only the first calculated pairs of s...
Vehicle routing through road networks is an important topic of research: time and money can be saved...
Abstract—Due to the severe impact of road traffic congestion on both economy and environment, severa...
Abstract: Research studying effective planning and optimization in the vehicle routing field has inc...
Solving the Vehicle Routing Problem (VRP) is a key to efficiency in transportation and supply chain ...
In this paper, we focus on a typical CPS application, i.e., vehicle route navigation. Two fundamenta...
The aim of this work is to analyse the computational performances of a general-purpose heuristic cap...
Due to the severe impact of road traffic congestion on both economy and environment, several vehicle...
The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its wel...
This paper shows how idealized models can be used to obtain cost-effective, implementable solutions ...
Forty five years ago, an academic and practitioner from the north of England published a method of t...
In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to...
Forty five years ago, an academic and practitioner from the north of England published a method of t...
This paper describes an algorithm for producing visually attractive and operationally robust solutio...
Vehicle Routing Problems (VRPs) have received a lot of attention in the recent years, both from a th...
A variant of the Clark and Wright’s saving method is presented. Only the first calculated pairs of s...
Vehicle routing through road networks is an important topic of research: time and money can be saved...
Abstract—Due to the severe impact of road traffic congestion on both economy and environment, severa...
Abstract: Research studying effective planning and optimization in the vehicle routing field has inc...
Solving the Vehicle Routing Problem (VRP) is a key to efficiency in transportation and supply chain ...
In this paper, we focus on a typical CPS application, i.e., vehicle route navigation. Two fundamenta...
The aim of this work is to analyse the computational performances of a general-purpose heuristic cap...
Due to the severe impact of road traffic congestion on both economy and environment, several vehicle...
The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its wel...
This paper shows how idealized models can be used to obtain cost-effective, implementable solutions ...