GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM

This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.

[1]  José Pinto Paixão,et al.  Using clustering analysis in a capacitated location-routing problem , 2007, Eur. J. Oper. Res..

[2]  W. C. Benton,et al.  The location-routing problem: Considerations in physical distribution system design , 1990, Comput. Oper. Res..

[3]  Partha Chakroborty.  Optimal Routing and Scheduling in Transportation : Using Genetic Algorithm to Solve Difficult Optimization Problems , 2004 .

[4]  Juan A. Díaz,et al.  A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..

[5]  Philippe Lacomme,et al.  A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..

[6]  Yupo Chan,et al.  A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands , 2001, Comput. Oper. Res..

[7]  Said Salhi,et al.  An Intergrated Heuristic Approach for the Combined Location Vehicle Fleet Mix Problem , 1996 .

[8]  Penousal Machado,et al.  GVR: A New Genetic Representation for the Vehicle Routing Problem , 2002, AICS.

[9]  Jan Dethloff,et al.  Solving a continuous location‐routing problem by use of a self‐organizing map , 2005 .

[10]  Alena Rybickova,et al.  Solution to the location-routing problem using a genetic algorithm , 2016, 2016 Smart Cities Symposium Prague (SCSP).

[11]  Christian Prins,et al.  A survey of recent research on location-routing problems , 2014, Eur. J. Oper. Res..

[12]  Bassem Jarboui,et al.  An Iterated Local Search for Solving A Location-Routing Problem , 2010, Electron. Notes Discret. Math..

[13]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[14]  Nenad Mladenovic,et al.  Variable neighborhood search for location routing , 2013, Comput. Oper. Res..

[15]  Beatriz Sousa Santos,et al.  A simple and effective evolutionary algorithm for the capacitated location-routing problem , 2016, Comput. Oper. Res..

[16]  Christian Prins,et al.  A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs , 2005, J. Heuristics.

[17]  Reza Ghodsi,et al.  A Variable Neighborhood Search Algorithm for Continuous Location Routing Problem with Pickup and Delivery , 2010, 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation.

[18]  Liu Zhang,et al.  BUS ARRIVAL TIME PREDICTION BASED ON PCA-GA-SVM , 2018 .

[19]  Caroline Prodhon,et al.  A hybrid evolutionary algorithm for the periodic location-routing problem , 2011, Eur. J. Oper. Res..

[20]  Seyed Hossein Hashemi Doulabi,et al.  Lower and upper bounds for location-arc routing problems with vehicle capacity constraints , 2013, Eur. J. Oper. Res..

[21]  Ludo Gelders,et al.  A large scale location-allocation problem in the natural rubber industry , 1981 .

[22]  Alena Rybickova,et al.  Application of genetic algorithms to vehicle routing problem , 2014 .

[23]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..