Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices

The paper addresses the synergies from combining a heuristic method with a predictive technique to solve the Dynamic Traveling Salesman Problem (DTSP). Particularly, we build a genetic algorithm that feeds on Newton?s motion equation to show how route optimization can be improved when targets are constantly moving. Our empirical evidence stems from the recovery of fish aggregating devices (FADs) by tuna vessels. Based on historical real data provided by GPS buoys attached to the FADs, we first estimate their trajectories to feed a genetic algorithm that searches for the best route considering their future locations. Our solution, which we name Genetic Algorithm based on Trajectory Prediction (GATP), shows that the distance traveled is significantly shorter than implementing other commonly used methods.

[1]  G. Reinelt,et al.  Optimal control of plotting and drilling machines: A case study , 1991, ZOR Methods Model. Oper. Res..

[2]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[3]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[4]  J. Monnot,et al.  The Traveling Salesman Problem and its Variations , 2014 .

[5]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[6]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[7]  Annalisa Griffa,et al.  On the Predictability of Lagrangian Trajectories in the Ocean , 2000 .

[8]  Philippe C. Besse,et al.  Autoregressive Forecasting of Some Functional Climatic Variations , 2000 .

[9]  Jacques Periaux,et al.  Genetic Algorithms in Engineering and Computer Science , 1996 .

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

[11]  Pascal Bach,et al.  Experimental research and fish aggregating devices (FADs) in French Polynesia , 1998 .

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

[13]  Xiaolin Hu,et al.  Dynamic traveling salesman problem based on evolutionary computation , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[14]  Leena Jain,et al.  Traveling Salesman Problem: A Case Study , 2012, BIOINFORMATICS 2012.

[15]  Shengxiang Yang,et al.  An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems , 2009, EvoWorkshops.

[16]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[17]  Sun Hur,et al.  Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain , 2002 .

[18]  Guoqiang Peter Zhang,et al.  Neural network forecasting for seasonal and trend time series , 2005, Eur. J. Oper. Res..

[19]  Jane Yung-jen Hsu,et al.  A Family Competition Genetic Algorithm for the Pickup and Delivery Problems with Time Window , 2006 .

[20]  R. Bland,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .

[21]  G BlandRobert,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography , 1989 .

[22]  C. J. Eyckelhof,et al.  Ant Systems for a Dynamic TSP , 2002, Ant Algorithms.

[23]  Martin Casdagli,et al.  Nonlinear prediction of chaotic time series , 1989 .

[24]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[25]  Hans Lehrach,et al.  A radiation hybrid transcript map of the mouse genome , 2001, Nature Genetics.

[26]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[27]  David W. Coit,et al.  Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..

[28]  Hartmut Schmeck,et al.  An Ant Colony Optimization approach to dynamic TSP , 2001 .

[29]  J. Castro,et al.  A general theory on fish aggregation to floating objects: An alternative to the meeting point hypothesis , 2002, Reviews in Fish Biology and Fisheries.

[30]  Abder Koukam,et al.  From the TSP to the Dynamic VRP: An Application of Neural Networks in Population Based Metaheuristic , 2013, Metaheuristics for Dynamic Optimization.

[31]  Juan José Pantrigo,et al.  Low-Level Hybridization of Scatter Search and Particle Filter for Dynamic TSP Solving , 2013, Metaheuristics for Dynamic Optimization.

[32]  Kaveh Amouzgar,et al.  Multi-objective optimization using Genetic Algorithms , 2012 .

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

[34]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[35]  Abel García-Nájera,et al.  An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows , 2011, Comput. Oper. Res..

[36]  Chang-Sung Jeong,et al.  Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections , 1991, Parallel Comput..

[37]  Shana Smith,et al.  An enhanced genetic algorithm for automated assembly planning , 2002 .

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

[39]  Christos D. Tarantilis,et al.  Dynamic Vehicle Routing Problems , 2014, Vehicle Routing.

[40]  Anabela Simões,et al.  CHC-Based Algorithms for the Dynamic Traveling Salesman Problem , 2011, EvoApplications.

[41]  J. Stock,et al.  A Comparison of Direct and Iterated Multistep Ar Methods for Forecasting Macroeconomic Time Series , 2005 .

[42]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[43]  Martin Grötschel,et al.  Optimal Control of Plotting and Drilling Machines , 1991 .

[44]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[45]  David Itano,et al.  Fish behaviour from fishers' knowledge: the case study of tropical tuna around drifting fish aggregating devices (DFADs) , 2007 .

[46]  Rong Yang,et al.  Solving large travelling salesman problems with small populations , 1997 .

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

[48]  Jia Yan,et al.  A Fast Evolutionary Algorithm for Traveling Salesman Problem , 2007, Third International Conference on Natural Computation (ICNC 2007).

[49]  Juliane Jung,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[50]  Gilbert Laporte,et al.  The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms , 2007, Oper. Res..

[51]  Donald Davendra,et al.  Traveling Salesman Problem, Theory and Applications , 2010 .

[52]  Patricia Rodriguez-Tomé,et al.  Erratum: A radiation hybrid transcript map of the mouse genome (Nature Genetics (2001) 29 (194-200)) , 2001 .

[53]  Jesús Fabián López Pérez.  A hybrid approach for a constrained routing problem , 2004, Fourth International Conference on Hybrid Intelligent Systems (HIS'04).

[54]  Matthew G. Karlaftis,et al.  Containership routing with time deadlines and simultaneous deliveries and pick-ups , 2009 .

[55]  C. J. Eyckelhof,et al.  Ant Systems for a Dynamic TSP - Ants Caught in a Traffic Jam , 2002 .

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

[57]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

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

[59]  Lixin Miao,et al.  A hybrid approach for the vehicle routing problem with three-dimensional loading constraints , 2013, Comput. Oper. Res..

[60]  Áslaug Sóley Bjarnadóttir.  Solving the Vehicle Routing Problem with Genetic Algorithms , 2004 .

[61]  María Cristina Riff,et al.  DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic , 2010, J. Heuristics.