A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Authors:
G. Nilay Yücenur;Nihan Çetin Demirel
Affiliations:
Yıldız Technical University, Mechanical Faculty, Industrial Engineering Department, Beşiktaş, Istanbul, Turkey;Yıldız Technical University, Mechanical Faculty, Industrial Engineering Department, Beşiktaş, Istanbul, Turkey
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 22
Cited 1

A tabu search heuristic for the multi-depot vehicle routing problem

Computers and Operations Research
A genetic algorithm for the vehicle routing problem

Computers and Operations Research
Parallel branch and cut for capacitated vehicle routing

Parallel Computing - Special issue: Parallel computing in logistics
Soil clustering by fuzzy c-means algorithm

Advances in Engineering Software
Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

Computers and Operations Research
Crowding clustering genetic algorithm for multimodal function optimization

Applied Soft Computing
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Computers and Operations Research
A genetic algorithm that exchanges neighboring centers for k-means clustering

Pattern Recognition Letters
A vehicle routing problem solved by using a hybrid genetic algorithm

Computers and Industrial Engineering
A hybrid genetic algorithm for the multi-depot vehicle routing problem

Engineering Applications of Artificial Intelligence
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem

Computers and Industrial Engineering
Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery

Computers and Operations Research
A hybrid genetic algorithm that optimizes capacitated vehicle routing problems

Expert Systems with Applications: An International Journal
Study of genetic algorithm with reinforcement learning to solve the TSP

Expert Systems with Applications: An International Journal
Fuzzy c-means clustering with prior biological knowledge

Journal of Biomedical Informatics
Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm

Expert Systems with Applications: An International Journal
Genetic algorithm-based clustering approach for k-anonymization

Expert Systems with Applications: An International Journal
A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem

Computers and Operations Research
Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems

Expert Systems with Applications: An International Journal
A column generation approach for the split delivery vehicle routing problem

Operations Research Letters
Interior point stabilization for column generation

Operations Research Letters

High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, a new type of geometric shape based genetic clustering algorithm is proposed. A genetic algorithm based on this clustering technique is developed for the solution process of the multi-depot vehicle routing problem. A set of problems obtained from the literature is used to compare the efficiency of the proposed algorithm with the nearest neighbor algorithm so as to solve the multi-depot vehicle routing problem. The experimental results show that the proposed algorithm provides a better clustering performance in terms of the distance of each customer to each depot in clusters. This result in a considerably less computation time required, when compared with the nearest neighbor algorithm.