Multi-depot vessel routing problem in a direction dependent wavefield

Considerable research has been done on the vehicle routing problem and its variants; however only limited amount of existing work deals with possible environmental conditions and their effects on the vehicle routes. This paper presents the multiple-depot vehicle routing problem for surface vessels, where the vehicles must traverse a time-invariant direction-dependent medium. Our model captures environmental effects and vessel dynamics on the considered paths. Three heuristic solution methods are developed and tested on simulated scenarios. The first approach exactly solves an approximate formulation of the problem, the second approximately solves an approximate problem formulation, while the third approximately solves the exact problem. Performance of the algorithms are compared to assess the tradeoff between computational cost and quality of the found solutions.

[1]  Boi Faltings,et al.  Ensuring Privacy through Distributed Computation in Multiple-Depot Vehicle Routing Problems , 2010 .

[2]  Emilio Frazzoli,et al.  The curvature-constrained traveling salesman problem for high point densities , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[4]  Panos M. Pardalos,et al.  Speeding up continuous GRASP , 2010, Eur. J. Oper. Res..

[5]  Jürgen Branke,et al.  A Fast Look-ahead Heuristic for the Multi-depot Vehicle Routing Problem , 2007, Wirtschaftsinformatik.

[6]  Andrew Lim,et al.  Multi-depot vehicle routing problem: a one-stage approach , 2005, IEEE Transactions on Automation Science and Engineering.

[7]  Optimal Short-Range Routing of Vessels in a Seaway , 2009 .

[8]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1994, J. Intell. Robotic Syst..

[9]  Morley O Stone.  DoD Priorities for Autonomy Research and Development , 2011 .

[10]  Jean-Daniel Boissonnat,et al.  Shortest path synthesis for Dubins non-holonomic robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[11]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[12]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[13]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

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

[15]  Emilio Frazzoli,et al.  Traveling Salesperson Problems for the Dubins Vehicle , 2008, IEEE Transactions on Automatic Control.

[16]  Emilio Frazzoli,et al.  Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles , 2009 .

[17]  J. Sussmann,et al.  SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL. 1 , 1991 .

[18]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[19]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[20]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[21]  S. Sumathi,et al.  Solution To Multi-Depot Vehicle Routing Problem Using Genetic Algorithms - TI Journals , 2012 .

[22]  Michael J. Hirsch,et al.  Cooperative Tracking of Multiple Targets by a Team of Autonomous UAVs , 2012, Int. J. Oper. Res. Inf. Syst..

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

[24]  Richard J. Kenefic.  Finding Good Dubins Tours for UAVs Using Particle Swarm Optimization , 2008, J. Aerosp. Comput. Inf. Commun..

[25]  Irina S. Dolinskaya,et al.  Construction of fastest curvature-constrained paths in direction-dependent media , 2014 .

[26]  João Pedro Hespanha,et al.  Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach , 2013, Algorithms.

[27]  Nonholonomic Dynamics , 2004 .

[28]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[29]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[30]  Emilio Frazzoli,et al.  On the Dubins Traveling Salesman Problem , 2012, IEEE Transactions on Automatic Control.

[31]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[32]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[33]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[34]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[35]  Irina S. Dolinskaya,et al.  Time-optimal trajectories with bounded curvature in anisotropic media , 2012, Int. J. Robotics Res..

[36]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[37]  Robert Winkler,et al.  Human Response Data Collection for the Defense Advanced Research Projects Agency's (DARPA) Mind's Eye Program , 2013 .

[38]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[39]  Flávio Keidi Miyazawa,et al.  Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem , 2013, GECCO '13.

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

[41]  Michael J. Hirsch,et al.  Dynamic Decentralized Cooperative Control of Multiple Autonomous Vehicles with Multiple Tasks for Urban Operations , 2012 .

[42]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..