Generalized Periodic Vehicle Routing and Maritime Surveillance

Published Online:https://doi.org/10.1287/trsc.2019.0899

References

  • Alvras D, Padberg M (2001) Linear Optimization and Extensions: Problems and Solutions (Springer-Verlag, Berlin).CrossrefGoogle Scholar
  • Avella P, Boccia M, Mannino C, Vasilyev I (2017) Time-indexed formulations for the runway scheduling problem. Transportation Sci. 51(4):1196–1209.LinkGoogle Scholar
  • Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.LinkGoogle Scholar
  • Bertsimas D, Tsitsiklis J (1997) Introduction to Linear Optimization, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
  • Cacchiani V, Hemmelmayr V, Tricoire F (2014) A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Appl. Math. 163(1):53–64.CrossrefGoogle Scholar
  • Caprara A, Fischetti M, Toth P (2002) Modeling and solving the train timetabling problem. Oper. Res. 50(5):851–861.LinkGoogle Scholar
  • Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming 20(1):255–282.CrossrefGoogle Scholar
  • Dash S, Günlük O, Lodi A, Tramontani A (2012) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1):132–147.LinkGoogle Scholar
  • Desaulniers G, Desrosiers J, Solomon M, eds. (2006) Column Generation, vol. 5 (Springer Science & Business Media, New York).Google Scholar
  • Drexl M, Irnich S (2014) Solving elementary shortest-path problems as mixed-integer programs. OR Spectrum 36(2):281–296.CrossrefGoogle Scholar
  • Dridi O, Krichen S, Guitouni A (2012) A multi-objective optimization approach for resource assignment and task scheduling problem: Application to maritime domain awareness. Proc. 2012 IEEE Congress Evolutionary Comput. (IEEE, Piscataway, NJ), 1–8.Google Scholar
  • Dyer ME, Wolsey LA (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26(2–3):255–270.CrossrefGoogle Scholar
  • Fukasawa R, Longo H, Lysgaard J, Aragão MPd, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3):491–511.CrossrefGoogle Scholar
  • Grob MJHB (2006) Routing of platforms in a maritime surface surveillance operation. Eur. J. Oper. Res. 170(2):613–628.CrossrefGoogle Scholar
  • Harrod S (2011) Modeling network transition constraints with hypergraphs. Transportation Sci. 45(1):81–97.LinkGoogle Scholar
  • Hochbaum DS, ed. (1997) Approximation Algorithms for NP-Hard Problems (PWS Publishing Co., Boston).Google Scholar
  • Ilavarasi K, Joseph KS (2014) Variants of travelling salesman problem: A survey. Proc. 2014 Internat. Conf. Inform. Comm. Embedded Systems (ICICES) (IEEE, Piscataway, NJ), 1–7.Google Scholar
  • Kjenstad D, Mannino C, Schittekat P, Smedsrud M (2013) Integrated surface and departure management at airports by optimization. Proc. 5th Internat. Conf. Modeling, Simulation and Appl. Optim. (ICMSAO) (IEEE, Piscataway, NJ), 1–5.Google Scholar
  • Marlow D, Kilby P, Mercer G (2007) The travelling salesman problem in maritime surveillance-techniques, algorithms and analysis. Proc. Internat. Congress Modelling Simulation, 684–690.Google Scholar
  • Martinelli R, Pecin D, Poggi M (2014) Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. 239(1):102–111.CrossrefGoogle Scholar
  • Mingozzi A (2005) The Multi-depot Periodic Vehicle Routing Problem, Lecture Notes in Computer Science, vol. 3607 (Springer, Berlin, Heidelberg), 347–350.Google Scholar
  • Pinedo ML (2016) Scheduling: Theory, Algorithms, and Systems (Springer, Cham, Switzerland).CrossrefGoogle Scholar
  • Pirkwieser S, Raidl G (2012) A column generation approach for the periodic vehicle routing problem with time windows. Working paper, Vienna University of Technology, Vienna, Austria.Google Scholar
  • Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. Technical report 480/1994, Technische Universitat, Berlin.Google Scholar
  • Quttineh N, Larsson T, Van den Bergh J, Beliën J (2015) A time-indexed generalized vehicle routing model and stabilized column generation for military aircraft mission planning. Migdalas A, Karakitsiou A, eds. Optimization, Control, and Applications in the Information Age, Springer Proceedings in Mathematics & Statistics (Springer International Publishing, Switzerland), 299–314.CrossrefGoogle Scholar
  • Schrijver L (2003) Combinatorial Optimization (Springer-Verlag, Berlin).Google Scholar
  • Stumpt E, Michael N (2011) Multi-robot persistent surveillance planning as a vehicle routing problem. Proc. IEEE Internat. Conf. Automation Sci. Engrg., Trieste, Italy.Google Scholar
  • Vatne D, Gisnås H (2014) MOBY—a simulation tool for evaluating maritime surveillance. Unpublished manuscript, Norwegian Defence Research Establishment, Kjeller, Norway.Google Scholar
  • Wolsey LA (1998) Integer Programming, Wiley Series in Discrete Mathematics and Optimization (John Wiley & Sons, New York).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.