A customized genetic algorithm for bi-objective routing in a dynamic network

Abstract The article presents a proposed customized genetic algorithm (CGA) to find the Pareto frontier for a bi-objective integer linear programming (ILP) model of routing in a dynamic network, where the number of nodes and edge weights vary over time. Utilizing a hybrid method, the CGA combines a genetic algorithm with dynamic programming (DP); it is a fast alternative to an ILP solver for finding efficient solutions, particularly for large dimensions. A non-dominated sorting genetic algorithm (NSGA-II) is used as a base multi-objective evolutionary algorithm. Real data are used for target trajectories, from a case study of application of a surveillance boat to measure greenhouse-gas emissions of ships on the Baltic sea. The CGA’s performance is evaluated in comparison to ILP solutions in terms of accuracy and computation efficiency. Results over multiple runs indicate convergence to the efficient frontier, with a considerable computation speed-up relative to the ILP solver. The study stays as a model for hybridizing evolutionary optimization and DP methods together in solving complex real-world problems.

[1]  Ming Yang,et al.  A New Approach to Solving Dynamic Traveling Salesman Problems , 2006, SEAL.

[2]  Emilio Frazzoli,et al.  Dynamic vehicle routing with stochastic time constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

[3]  Antonio Sartal,et al.  Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices , 2015, Comput. Oper. Res..

[4]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[5]  Dimitris Bertsimas,et al.  Vehicle Routing Problem with Stochastic Demand , 2017 .

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Jairo R. Montoya-Torres,et al.  A literature review on the vehicle routing problem with multiple , 2014 .

[8]  Antonio Sartal,et al.  Integrating forecasting in metaheuristic methods to solve dynamic routing problems: Evidence from the logistic processes of tuna vessels , 2018, Eng. Appl. Artif. Intell..

[9]  J. van Leeuwen,et al.  Evolutionary Multi-Criterion Optimization , 2003, Lecture Notes in Computer Science.

[10]  Alejandro Toriello,et al.  The One-Dimensional Dynamic Dispatch Waves Problem , 2016, Transp. Sci..

[11]  Edison Pignaton de Freitas,et al.  Experimental analysis of heuristic solutions for the moving target traveling salesman problem applied to a moving targets monitoring system , 2019, Expert Syst. Appl..

[12]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

[13]  D. O. Marlow,et al.  The Travelling Salesman Problem in Maritime Surveillance - Techniques, Algorithms and Analysis , 2007 .

[14]  Maria Grazia Speranza,et al.  Dynamic traveling salesman problem with stochastic release dates , 2020, Eur. J. Oper. Res..

[15]  Nicola Beume,et al.  On the Complexity of Computing the Hypervolume Indicator , 2009, IEEE Transactions on Evolutionary Computation.

[16]  Ming Xu,et al.  Research on Influential Factors of PM2.5 within the Beijing-Tianjin-Hebei Region in China , 2018 .

[17]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[18]  Jiujun Cheng,et al.  Ant colony optimization with clustering for solving the dynamic location routing problem , 2016, Appl. Math. Comput..

[19]  Emilio Frazzoli,et al.  Dynamic Vehicle Routing for Robotic Systems , 2011, Proceedings of the IEEE.

[20]  Mohammad Marufuzzaman,et al.  A modified Ant Colony Optimization algorithm to solve a dynamic traveling salesman problem: A case study with drones for wildlife surveillance , 2018, J. Comput. Des. Eng..

[21]  Jean-Marie Bourjolly,et al.  On-orbit servicing: a time-dependent, moving-target traveling salesman problem , 2006, Int. Trans. Oper. Res..

[22]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[23]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[24]  Jukka Heikkonen,et al.  Ship Movement Prediction Using k-NN Method , 2018, 2018 Baltic Geodetic Congress (BGC Geomatics).

[25]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[26]  Joe Naoum-Sawaya,et al.  The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches , 2018, INFORMS J. Comput..

[27]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[28]  Kalyanmoy Deb,et al.  A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables , 2017, Eur. J. Oper. Res..

[29]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[30]  Aimin Zhou,et al.  Solving dynamic TSP with evolutionary approach in real time , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[31]  Wan Jian,et al.  Genetic algorithm‐based multiple moving target reaching using a fleet of sailboats , 2019, IET Cyber-Systems and Robotics.

[32]  Alejandro Toriello,et al.  A Dynamic Traveling Salesman Problem with Stochastic Arc Costs , 2014, Oper. Res..

[33]  Atle Riise,et al.  Dynamic And Stochastic Vehicle Routing In Practice , 2007 .

[34]  Martin W. P. Savelsbergh,et al.  Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows , 2020, Transp. Sci..

[35]  Shengxiang Yang,et al.  Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems , 2017, IEEE Transactions on Cybernetics.

[36]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[37]  Hussein A. Abbass,et al.  Tracking moving targets and the non- stationary traveling salesman problem , 2005 .

[38]  Shraga Shoval,et al.  The single line moving target traveling salesman problem with release times , 2020, Ann. Oper. Res..

[39]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[40]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[41]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[42]  Marcel J. H. B. Grob.  Routing of platforms in a maritime surface surveillance operation , 2006, Eur. J. Oper. Res..

[44]  Bengt J. Nilsson,et al.  Approximation Results for Kinetic Variants of TSP , 2002, Discret. Comput. Geom..

[45]  Nitin S. Choubey,et al.  Moving Target Travelling Salesman Problem using Genetic Algorithm , 2013 .

[46]  A. Kryazhimskiy,et al.  The travelling-Salesman problem with moving objects , 1995 .

[47]  Alex Zelikovsky,et al.  The moving-target traveling salesman problem , 2003, J. Algorithms.

[48]  Emilio Frazzoli,et al.  Dynamic Vehicle Routing with Priority Classes of Stochastic Demands , 2009, SIAM J. Control. Optim..

[49]  R. Bellman.  Dynamic programming. , 1957, Science.

[50]  Markku Kallio,et al.  Assessing the prediction uncertainty in a route optimization model for autonomous maritime logistics , 2020, Int. Trans. Oper. Res..

[51]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[52]  Nicola Secomandi,et al.  Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications , 2003, J. Heuristics.