Skip to main content

Daily aircraft routing for amphibious ready groups

Annals of Operations Research volume 264, pages 477–498 (2018)Cite this article

Abstract

An Amphibious Ready Group (ARG) consists of ships capable of conducting flight operations that daily require the transport of personnel and cargo (PMC) to remain operationally viable. Planning daily PMC transport for ARG ships and nearby airfields is a unique vehicle routing problem characterized by a heterogeneous capacitated vehicle fleet, two cargo types, multiple depots, time windows, and synchronized routing of two aircraft required between some but not all node pairs. We formulate this problem as an integer linear program (ILP) with an objective function that expresses the cost of flight operations and a penalty for undelivered PMC. We perform extensive computational testing using an ILP solver and a tailored ant colony optimization with local search metaheuristic on test instances constructed to represent those found in practice. We find most instances difficult to solve optimally while our heuristic provides the best known or close to the best known solution in just a few minutes. We have embedded our heuristic in a decision support system complete with graphical user interface and sent this out for use by United States Navy ARG planners.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

£ 29.95

Price includes VAT (United Kingdom)
Tax calculation will be finalised during checkout.

Fig. 1
Fig. 2
Fig. 3

Source: “Southern California.” 32\(^\circ 37'43''\)N and 117\(^\circ 09'46''\)W. Google Earth. Retrieved December 18, 2015

Fig. 4
Fig. 5

References

  • Barbarosoğlu, G., Özdamar, L., & Cevik, A. (2002). An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations. European Journal of Operational Research, 140(1), 118–133.

    Article  Google Scholar 

  • Belanger, N., Desaulniers, G., Soumis, F., & Desrosiers, J. (2006). Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues. European Journal of Operational Research, 175(3), 1754–1766.

    Article  Google Scholar 

  • Bent, R., & Van Hentenryck, P. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4), 875–893.

    Article  Google Scholar 

  • Braekers, K., Caris, A., & Janssens, G. K. (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological, 67, 166–186.

    Article  Google Scholar 

  • Bredström, D., & Rönnqvist, M. (2008). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research, 191(1), 19–31.

    Article  Google Scholar 

  • Brown, G. G., Carlyle, W. M., & Dell, R. F. (2013). Optimizing intratheater military airlift in iraq and afghanistan. Military Operations Research, 18(3), 35–52.

    Article  Google Scholar 

  • Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2016). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. European Journal of Operational Research, 250(3), 782–793.

    Article  Google Scholar 

  • Cheung, R. K., Shi, N., Powell, W. B., & Simao, H. P. (2008). An attribute-decision model for cross-border drayage problem. Transportation Research Part E: Logistics and Transportation Review, 44(2), 217–234.

    Article  Google Scholar 

  • Cordeau, J.-F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3), 573–586.

    Article  Google Scholar 

  • Cordeau, J.-F., & Laporte, G. (2003a). The dial-a-ride problem (darp): Variants, modeling issues and algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(2), 89–101.

    Google Scholar 

  • Cordeau, J.-F., & Laporte, G. (2003b). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579–594.

    Article  Google Scholar 

  • Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29–46.

    Article  Google Scholar 

  • Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91.

    Article  Google Scholar 

  • De Rosa, B., Improta, G., Ghiani, G., & Musmanno, R. (2002). The arc routing and scheduling problem with transshipment. Transportation Science, 36(3), 301–313.

    Article  Google Scholar 

  • Del Pia, A., & Filippi, C. (2006). A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. International Transactions in Operational Research, 13(2), 125–141.

    Article  Google Scholar 

  • Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M. M., & Soumis, F. (2002). Vrp with pickup and delivery. In SIAM monographs on discrete mathematics and applications, pp. 225–242.

  • Desrosiers, J., Dumas, Y., & Soumis, F. (1986). A dynamic programming solution of the large-scale single-vehicle dial—a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 6(3–4), 301–325.

    Article  Google Scholar 

  • Detti, P., Papalini, F., & de Lara, G. Z. M. (2017). A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. Omega, 70, 1–14.

    Article  Google Scholar 

  • Dorigo, M., & Stützle, T. (2010). Ant colony optimization: overview and recent advances. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of metaheuristics (pp. 227–263). Springer.

  • Drexl, M. (2012). Synchronization in vehicle routing-a survey of vrps with multiple synchronization constraints. Transportation Science, 46(3), 297–316.

    Article  Google Scholar 

  • Drexl, M. (2014). Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks, 63(1), 119–133.

    Article  Google Scholar 

  • Drexl, M., Rieck, J., Sigl, T., & Press, B. (2013). Simultaneous vehicle and crew routing and scheduling for partial- and full-load long-distance road transport. BuR Business Research, 6(2), 242–264.

    Article  Google Scholar 

  • Dumas, Y., Desrosiers, J., & Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1), 7–22.

    Article  Google Scholar 

  • Gribkovskaia, I., Halskau, O., & Kovalyov, M. Y. (2015). Minimizing takeoff and landing risk in helicopter pickup and delivery operations. Omega, 55, 73–80.

    Article  Google Scholar 

  • Grimault, A., Bostel, N., & Lehuédé, F. (2017). An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. Computers & Operations Research, 88, 1–14.

    Article  Google Scholar 

  • Gschwind, T. (2015). A comparison of column-generation approaches to the synchronized pickup and delivery problem. European Journal of Operational Research, 247(1), 60–71.

    Article  Google Scholar 

  • Halskau, Ø. (2014). Offshore helicopter routing in a hub and spoke fashion: Minimizing expected number of fatalities. Procedia Computer Science, 31, 1124–1132.

    Article  Google Scholar 

  • Ioachim, I., Desrosiers, J., Soumis, F., & Bélanger, N. (1999). Fleet assignment and routing with schedule synchronization constraints. European Journal of Operational Research, 119(1), 75–90.

    Article  Google Scholar 

  • Li, Y., Lim, A., & Rodrigues, B. (2005). Manpower allocation with time windows and job-teaming constraints. Naval Research Logistics (NRL), 52(4), 302–311.

    Article  Google Scholar 

  • Lim, A., Rodrigues, B., & Song, L. (2004). Manpower allocation with time windows. Journal of the Operational Research Society, 55(11), 1178–1186.

    Article  Google Scholar 

  • Madsen, O. B., Ravn, H. F., & Rygaard, J. M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of operations Research, 60(1), 193–208.

    Article  Google Scholar 

  • Masmoudi, M. A., Braekers, K., Masmoudi, M., & Dammak, A. (2017). A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Computers & Operations Research, 81, 1–13.

    Article  Google Scholar 

  • Masmoudi, M. A., Hosny, M., Braekers, K., & Dammak, A. (2016). Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem. Transportation Research Part E: Logistics and Transportation Review, 96, 60–80.

    Article  Google Scholar 

  • Masson, R., Lehuédé, F., & Péton, O. (2013). An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science, 47(3), 344–355.

    Article  Google Scholar 

  • Moreno, L., de Aragao, M. P., & Uchoa, E. (2006). Column generation based heuristic for a helicopter routing problem. In Experimental algorithms, pp. 219–230. Springer.

  • Nanry, W. P., & Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2), 107–121.

    Article  Google Scholar 

  • Nguyen, P. K., Crainic, T. G., & Toulouse, M. (2017). Multi-trip pickup and delivery problem with time windows and synchronization. Annals of Operations Research, 253(2), 899–934.

    Article  Google Scholar 

  • Ozdamar, L. (2011). Planning helicopter logistics in disaster relief. OR Spectrum, 33(3), 655–672.

    Article  Google Scholar 

  • Paquette, J., Cordeau, J.-F., Laporte, G., & Pascoal, M. M. (2013). Combining multicriteria analysis and tabu search for dial-a-ride problems. Transportation Research Part B: Methodological, 52, 1–16.

    Article  Google Scholar 

  • Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Journal für Betriebswirtschaft, 58(1), 21–51.

    Article  Google Scholar 

  • Pimenta, V., Quilliot, A., Toussaint, H., & Vigo, D. (2017). Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles. European Journal of Operational Research, 257(2), 601–613.

    Article  Google Scholar 

  • Rekiek, B., Delchambre, A., & Saleh, H. A. (2006). Handicapped person transportation: An application of the grouping genetic algorithm. Engineering Applications of Artificial Intelligence, 19(5), 511–520.

    Article  Google Scholar 

  • Ritzinger, U., Puchinger, J., & Hartl, R. F. (2016). Dynamic programming based metaheuristics for the dial-a-ride problem. Annals of Operations Research, 236(2), 341–358.

  • Røpke, S., Cordeau, J.-F., & Laporte, G. (2007). Models and a branch-and-cut algorithm for pickup and delivery problems with time windows. Networks, 49(4), 258–272.

    Article  Google Scholar 

  • Røpke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472.

    Article  Google Scholar 

  • Rousseau, L.-M., Gendreau, M., & Pesant, G. (2003). The synchronized vehicle dispatching problem. New York: Citeseer.

    Google Scholar 

  • Savelsbergh, M., & Sol, M. (1998). Drive: Dynamic routing of independent vehicles. Operations Research, 46(4), 474–490.

    Article  Google Scholar 

  • Schmid, V., Doerner, K. F., Hartl, R. F., & Salazar-González, J.-J. (2010). Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Computers & Operations Research, 37(3), 559–574.

    Article  Google Scholar 

  • Stentoft Arlbjørn, J., Qian, F., Gribkovskaia, I., & Halskau, Ø, Sr. (2011). Helicopter routing in the norwegian oil industry: Including safety concerns for passenger transport. International Journal of Physical Distribution & Logistics Management, 41(4), 401–415.

    Article  Google Scholar 

  • Stützle, T., & Hoos, H. (1997). Max-min ant system and local search for the traveling salesman problem. In 1997, IEEE international conference on evolutionary computation, pp. 309–314. IEEE.

  • Stützle, T., & Hoos, H. H. (1996). Improving the ant system: A detailed report on the max–min ant system. FG Intellektik, FB Informatik, TU Darmstadt, Germany, Tech. Rep. AIDA–96–12.

  • Stützle, T., & Hoos, H. H. (2000). Max–min ant system. Future Generation Computer Systems, 16(8), 889–914.

    Article  Google Scholar 

  • Timlin, M. T. F., & Pulleyblank, W. R. (1992). Precedence constrained routing and helicopter scheduling: Heuristic design. Interfaces, 22(3), 100–111.

    Article  Google Scholar 

  • Toth, P., & Vigo, D. (1996). Fast local search algorithms for the handicapped persons transportation problem. In Meta-Heuristics, pp. 677–690. Springer.

  • Velasco, N., Castagliola, P., Dejax, P., Guéret, C., & Prins, C. (2009). A memetic algorithm for a pick-up and delivery problem by helicopter. In Bio-inspired algorithms for the vehicle routing problem, pp. 173–190. Springer.

  • Wray, J. D. (2009). Optimizing helicopter assault support in a high demand environment. Master’s thesis, Monterey, California. Naval Postgraduate School.

Download references

Author information

Affiliations

  1. Industrial Engineering Department, Turkish Naval Academy, National Defense University, Istanbul, Turkey

    Ertan Yakıcı

  2. Operations Research Department, Naval Postgraduate School, Monterey, CA, USA

    Robert F. Dell & Connor McLemore

  3. Navy Assessments, Pentagon, Arlington, VA, USA

    Travis Hartman

Authors
  1. Ertan Yakıcı
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert F. Dell
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Travis Hartman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Connor McLemore
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ertan Yakıcı.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Yakıcı, E., Dell, R.F., Hartman, T. et al. Daily aircraft routing for amphibious ready groups. Ann Oper Res 264, 477–498 (2018). https://doi.org/10.1007/s10479-017-2740-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2740-8

Keywords

  • Vehicle routing
  • Integer linear programming
  • Ant colony optimization
  • Local search
  • Military