Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size

2013 ◽  
Vol 21 (1) ◽  
pp. 153-175 ◽  
Author(s):  
H. Murat Afsar ◽  
Christian Prins ◽  
Andréa Cynthia Santos
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Routing Problem ◽  
Fleet Size ◽  
Generalized Vehicle Routing Problem

scholarly journals Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem

2011 ◽  
Vol 6 (1) ◽  
pp. 158 ◽  
Author(s):  
Petrică Claudiu Pop ◽  
Ioana Zelina ◽  
Vasile Lupşe ◽  
Corina Pop Sitar ◽  
Camelia Chira
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Routing Problem ◽  
Practical Applications ◽  
Combinatorial Optimization Problems ◽  
The Many ◽  
The Given ◽  
Generalized Vehicle Routing Problem

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and has been intensively studied due to the many practical applications in the field of distribution, collection, logistics, etc. We study a generalization of the VRP called the generalized vehicle routing problem (GVRP) where given a partition of the nodes of the graph into node sets we want to find the optimal routes from the given depot to the number of predefined clusters which include exactly one node from each cluster. The purpose of this paper is to present heuristic algorithms to solve this problem approximately. We present constructive algorithms and local search algorithms for solving the generalized vehicle routing problem.

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 82-92 ◽  
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

Sign in / Sign up

Export Citation Format

Share Document