Periodic re-optimization based dynamic branch and price algorithm for dynamic multi-UAV path planning

In this paper, a dynamic branch and price algorithm with a periodic re-optimization framework is proposed to solve the dynamic Multi-UAV path planning problem. By partitioning the planning horizon into a series of time slices, the dynamic problem is transformed into a series of static problems. We then use the adjusted branch and price algorithm to solve each static problem. The prominent characteristic of this algorithm is to improve the solving efficiency at each time slice by succeeding and adjusting the columns from the last time slice. According to the experimental results, the proposed dynamic branch and price algorithm with a periodic re-optimization framework can solve the test instances effectively.

[1]  Ángel Corberán,et al.  The Team Orienteering Arc Routing Problem , 2014, Transp. Sci..

[2]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[3]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[4]  Zhi-Long Chen,et al.  Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows , 2006, Transp. Sci..

[5]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[6]  Mehdi Alighanbari,et al.  Task assignment algorithms for teams of UAVs in dynamic environments , 2004 .

[7]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

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

[9]  J. Karl Hedrick,et al.  Autonomous UAV path planning and estimation , 2009, IEEE Robotics & Automation Magazine.

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  Han-Lim Choi,et al.  Real-Time Multi-UAV Task Assignment in Dynamic and Uncertain Environments , 2009 .

[12]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[13]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[14]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[15]  Feng Zu-ren.  On the Model and Optimization Algorithm for Dynamic Team Orienteering Problem , 2011 .