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

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.

[1]  Pei-Chann Chang,et al.  Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems , 2010, Expert Syst. Appl..

[2]  Guangzhou Zeng,et al.  Study of genetic algorithm with reinforcement learning to solve the TSP , 2009, Expert Syst. Appl..

[3]  Tufan Demirel,et al.  Time Dependent Vehicle Routing Problem with Fuzzy Traveling Times Under Different Traffic Conditions , 2008, J. Multiple Valued Log. Soft Comput..

[4]  T. Liao,et al.  An adaptive genetic clustering method for exploratory mining of feature vector and time series data , 2006 .

[5]  Zvi Drezner,et al.  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem , 2008, Comput. Oper. Res..

[6]  Chitta Baral,et al.  Fuzzy C-means Clustering with Prior Biological Knowledge , 2022 .

[7]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[8]  Hwei-Jen Lin,et al.  An Efficient GA-based Clustering Technique , 2005 .

[9]  Michael J. Laszlo,et al.  A genetic algorithm that exchanges neighboring centers for k-means clustering , 2007, Pattern Recognit. Lett..

[10]  Hong Zhou,et al.  Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm , 2009, Eur. J. Oper. Res..

[11]  Michel Gendreau,et al.  Interior point stabilization for column generation , 2007, Oper. Res. Lett..

[12]  Emmanouil E. Zachariadis,et al.  A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints , 2009, Eur. J. Oper. Res..

[13]  Qing Ling,et al.  Crowding clustering genetic algorithm for multimodal function optimization , 2008, Appl. Soft Comput..

[14]  Ted K. Ralphs,et al.  Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..

[15]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .

[16]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[17]  Shahram Shadrokh,et al.  A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty , 2007, Eur. J. Oper. Res..

[18]  Alfonsas Misevicius,et al.  An improved hybrid genetic algorithm: new results for the quadratic assignment problem , 2004, Knowl. Based Syst..

[19]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[20]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[21]  José Brandão,et al.  A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem , 2009, Eur. J. Oper. Res..

[22]  R. Tavakkoli-Moghaddam,et al.  A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length , 2006, Appl. Math. Comput..

[23]  Funda Samanlioglu,et al.  A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem , 2008, Comput. Ind. Eng..

[24]  Mauricio G. C. Resende,et al.  A genetic algorithm for the resource constrained multi-project scheduling problem , 2008, Eur. J. Oper. Res..

[25]  Gilbert Laporte,et al.  A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars , 2010, Eur. J. Oper. Res..

[26]  Maria Grazia Speranza,et al.  A column generation approach for the split delivery vehicle routing problem , 2011, Networks.

[27]  Lin-Yu Tseng,et al.  A genetic approach to the automatic clustering problem , 2001, Pattern Recognit..

[28]  Taizo Hanai,et al.  Modified fuzzy gap statistic for estimating preferable number of clusters in fuzzy k-means clustering. , 2008, Journal of bioscience and bioengineering.

[29]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[30]  Guenther Fuellerer,et al.  Ant colony optimization for the two-dimensional loading vehicle routing problem , 2009, Comput. Oper. Res..

[31]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..

[32]  Chunguo Wu,et al.  Solving traveling salesman problems using generalized chromosome genetic algorithm , 2008 .

[33]  Chi-Bin Cheng,et al.  Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm , 2009, Expert Syst. Appl..

[34]  Chung-Ho Wang,et al.  A hybrid genetic algorithm that optimizes capacitated vehicle routing problems , 2009, Expert Syst. Appl..

[35]  Lawrence W. Lan,et al.  Genetic clustering algorithms , 2001, Eur. J. Oper. Res..

[36]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[37]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[38]  Henry C. W. Lau,et al.  A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..

[39]  A. Burak Göktepe,et al.  Soil clustering by fuzzy c-means algorithm , 2005, Adv. Eng. Softw..

[40]  Herman R. Leep,et al.  A vehicle routing problem solved by using a hybrid genetic algorithm , 2007, Comput. Ind. Eng..

[41]  Jun-Lin Lin,et al.  Genetic algorithm-based clustering approach for k-anonymization , 2009, Expert Syst. Appl..

[42]  Michael Nikolaou,et al.  A hybrid approach to global optimization using a clustering algorithm in a genetic search framework , 1998 .

[43]  Saïd Salhi,et al.  Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem , 2001 .

[44]  Jinwei Gu,et al.  A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem , 2010, Comput. Oper. Res..