A generalized clustering method based on a Genetic Algorithm is proposed. The Genetic Clustering (GenClust) method is used for solving the multidepot vehicle routing problem. The solution obtained by the genetic clustering method is improved using an efficient postoptimizer. A set of problems obtained from the literature are used to compare the efficiency of the genetic clustering method for solving the multidepot vehicle routing problem. The genetic clustering method found 11 new best known solutions from the 23 problems in the literature set
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which pass...
One of the well-known and highly used extensions of vehicle routing problem (VRP) is Vehicle Routing...
Summarization: The Vehicle Routing Problem (VRP) is one of the most well studied problems in operati...
A clustering method based on a genetic algorithm for solving the multi-depot routing problem is prop...
Graduation date: 2008In the thesis, an application of a genetic algorithm (GA) is considered to solv...
Distribution is an important aspect of industrial activity to serve customers on time with minimal o...
In recent years, many service suppliers and distributors have recognized the importance of designing...
[[abstract]]The present study investigates the cost concerns of distribution centers and formulates ...
Abstract.Multi-depot vehicle routing problem is a NP-hard combinatorial optimization problem. In thi...
This paper deals with the optimization of vehicle routing problem in which multiple depots, multiple...
Abstract:- We develop a new heuristic based on the genetic algorithm (GA) that is used to find high ...
The distribution of finished products from depots to customers is a practical and challenging proble...
The paper deals with a hybrid clustering-genetic algorithm that is applied to a rolling-horizon proc...
This thesis identifies some problems, the genetic algorithm (GA) is facing in the area of vehicle ro...
Focusing on the multi-depot vehicle routing problem (MDVRP) for hazardous materials transportation, ...
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which pass...
One of the well-known and highly used extensions of vehicle routing problem (VRP) is Vehicle Routing...
Summarization: The Vehicle Routing Problem (VRP) is one of the most well studied problems in operati...
A clustering method based on a genetic algorithm for solving the multi-depot routing problem is prop...
Graduation date: 2008In the thesis, an application of a genetic algorithm (GA) is considered to solv...
Distribution is an important aspect of industrial activity to serve customers on time with minimal o...
In recent years, many service suppliers and distributors have recognized the importance of designing...
[[abstract]]The present study investigates the cost concerns of distribution centers and formulates ...
Abstract.Multi-depot vehicle routing problem is a NP-hard combinatorial optimization problem. In thi...
This paper deals with the optimization of vehicle routing problem in which multiple depots, multiple...
Abstract:- We develop a new heuristic based on the genetic algorithm (GA) that is used to find high ...
The distribution of finished products from depots to customers is a practical and challenging proble...
The paper deals with a hybrid clustering-genetic algorithm that is applied to a rolling-horizon proc...
This thesis identifies some problems, the genetic algorithm (GA) is facing in the area of vehicle ro...
Focusing on the multi-depot vehicle routing problem (MDVRP) for hazardous materials transportation, ...
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which pass...
One of the well-known and highly used extensions of vehicle routing problem (VRP) is Vehicle Routing...
Summarization: The Vehicle Routing Problem (VRP) is one of the most well studied problems in operati...