{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:25:56Z","timestamp":1759847156997,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10479-017-2740-8","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T23:17:58Z","timestamp":1513898278000},"page":"477-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Daily aircraft routing for amphibious ready groups"],"prefix":"10.1007","volume":"264","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8148-1031","authenticated-orcid":false,"given":"Ertan","family":"Yak\u0131c\u0131","sequence":"first","affiliation":[]},{"given":"Robert F.","family":"Dell","sequence":"additional","affiliation":[]},{"given":"Travis","family":"Hartman","sequence":"additional","affiliation":[]},{"given":"Connor","family":"McLemore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"issue":"1","key":"2740_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0377-2217(01)00222-3","volume":"140","author":"G Barbaroso\u011flu","year":"2002","unstructured":"Barbaroso\u011flu, G., \u00d6zdamar, 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\u2013133.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2740_CR2","doi-asserted-by":"crossref","first-page":"1754","DOI":"10.1016\/j.ejor.2004.04.051","volume":"175","author":"N Belanger","year":"2006","unstructured":"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\u20131766.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2740_CR3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"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\u2013893.","journal-title":"Computers & Operations Research"},{"key":"2740_CR4","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.trb.2014.05.007","volume":"67","author":"K Braekers","year":"2014","unstructured":"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\u2013186.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"2740_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstr\u00f6m","year":"2008","unstructured":"Bredstr\u00f6m, D., & R\u00f6nnqvist, M. (2008). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research, 191(1), 19\u201331.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2740_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.5711\/1082598318335","volume":"18","author":"GG Brown","year":"2013","unstructured":"Brown, G. G., Carlyle, W. M., & Dell, R. F. (2013). Optimizing intratheater military airlift in iraq and afghanistan. Military Operations Research, 18(3), 35\u201352.","journal-title":"Military Operations Research"},{"issue":"3","key":"2740_CR7","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1016\/j.ejor.2015.10.046","volume":"250","author":"M Cherkesly","year":"2016","unstructured":"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\u2013793.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2740_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tre.2007.07.009","volume":"44","author":"RK Cheung","year":"2008","unstructured":"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\u2013234.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"2740_CR9","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J-F Cordeau","year":"2006","unstructured":"Cordeau, J.-F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3), 573\u2013586.","journal-title":"Operations Research"},{"issue":"2","key":"2740_CR10","first-page":"89","volume":"1","author":"J-F Cordeau","year":"2003","unstructured":"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\u2013101.","journal-title":"Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"issue":"6","key":"2740_CR11","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003","unstructured":"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\u2013594.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"2740_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29\u201346.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2740_CR13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80\u201391.","journal-title":"Management Science"},{"issue":"3","key":"2740_CR14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/trsc.36.3.301.7832","volume":"36","author":"B Rosa De","year":"2002","unstructured":"De Rosa, B., Improta, G., Ghiani, G., & Musmanno, R. (2002). The arc routing and scheduling problem with transshipment. Transportation Science, 36(3), 301\u2013313.","journal-title":"Transportation Science"},{"issue":"2","key":"2740_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/j.1475-3995.2006.00539.x","volume":"13","author":"A Pia Del","year":"2006","unstructured":"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\u2013141.","journal-title":"International Transactions in Operational Research"},{"key":"2740_CR16","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.\u00a0M., & Soumis, F. (2002). Vrp with pickup and delivery. In SIAM monographs on discrete mathematics and applications, pp. 225\u2013242.","DOI":"10.1137\/1.9780898718515.ch9"},{"issue":"3\u20134","key":"2740_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/01966324.1986.10737198","volume":"6","author":"J Desrosiers","year":"1986","unstructured":"Desrosiers, J., Dumas, Y., & Soumis, F. (1986). A dynamic programming solution of the large-scale single-vehicle dial\u2014a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 6(3\u20134), 301\u2013325.","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"2740_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2016.08.008","volume":"70","author":"P Detti","year":"2017","unstructured":"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\u201314.","journal-title":"Omega"},{"key":"2740_CR19","doi-asserted-by":"crossref","unstructured":"Dorigo, M., & St\u00fctzle, T. (2010). Ant colony optimization: overview and recent advances. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of metaheuristics (pp. 227\u2013263). Springer.","DOI":"10.1007\/978-1-4419-1665-5_8"},{"issue":"3","key":"2740_CR20","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl, M. (2012). Synchronization in vehicle routing-a survey of vrps with multiple synchronization constraints. Transportation Science, 46(3), 297\u2013316.","journal-title":"Transportation Science"},{"issue":"1","key":"2740_CR21","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/net.21526","volume":"63","author":"M Drexl","year":"2014","unstructured":"Drexl, M. (2014). Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks, 63(1), 119\u2013133.","journal-title":"Networks"},{"issue":"2","key":"2740_CR22","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BF03342751","volume":"6","author":"M Drexl","year":"2013","unstructured":"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\u2013264.","journal-title":"BuR Business Research"},{"issue":"1","key":"2740_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., & Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1), 7\u201322.","journal-title":"European Journal of Operational Research"},{"key":"2740_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.omega.2015.02.010","volume":"55","author":"I Gribkovskaia","year":"2015","unstructured":"Gribkovskaia, I., Halskau, O., & Kovalyov, M. Y. (2015). Minimizing takeoff and landing risk in helicopter pickup and delivery operations. Omega, 55, 73\u201380.","journal-title":"Omega"},{"key":"2740_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2017.06.012","volume":"88","author":"A Grimault","year":"2017","unstructured":"Grimault, A., Bostel, N., & Lehu\u00e9d\u00e9, F. (2017). An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. Computers & Operations Research, 88, 1\u201314.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2740_CR26","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ejor.2015.06.017","volume":"247","author":"T Gschwind","year":"2015","unstructured":"Gschwind, T. (2015). A comparison of column-generation approaches to the synchronized pickup and delivery problem. European Journal of Operational Research, 247(1), 60\u201371.","journal-title":"European Journal of Operational Research"},{"key":"2740_CR27","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1016\/j.procs.2014.05.368","volume":"31","author":"\u00d8 Halskau","year":"2014","unstructured":"Halskau, \u00d8. (2014). Offshore helicopter routing in a hub and spoke fashion: Minimizing expected number of fatalities. Procedia Computer Science, 31, 1124\u20131132.","journal-title":"Procedia Computer Science"},{"issue":"1","key":"2740_CR28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","volume":"119","author":"I Ioachim","year":"1999","unstructured":"Ioachim, I., Desrosiers, J., Soumis, F., & B\u00e9langer, N. (1999). Fleet assignment and routing with schedule synchronization constraints. European Journal of Operational Research, 119(1), 75\u201390.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2740_CR29","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/nav.20075","volume":"52","author":"Y Li","year":"2005","unstructured":"Li, Y., Lim, A., & Rodrigues, B. (2005). Manpower allocation with time windows and job-teaming constraints. Naval Research Logistics (NRL), 52(4), 302\u2013311.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"11","key":"2740_CR30","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1057\/palgrave.jors.2601782","volume":"55","author":"A Lim","year":"2004","unstructured":"Lim, A., Rodrigues, B., & Song, L. (2004). Manpower allocation with time windows. Journal of the Operational Research Society, 55(11), 1178\u20131186.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"2740_CR31","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OB Madsen","year":"1995","unstructured":"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\u2013208.","journal-title":"Annals of operations Research"},{"key":"2740_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.12.008","volume":"81","author":"MA Masmoudi","year":"2017","unstructured":"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\u201313.","journal-title":"Computers & Operations Research"},{"key":"2740_CR33","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tre.2016.10.002","volume":"96","author":"MA Masmoudi","year":"2016","unstructured":"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\u201380.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"2740_CR34","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/trsc.1120.0432","volume":"47","author":"R Masson","year":"2013","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., & P\u00e9ton, O. (2013). An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science, 47(3), 344\u2013355.","journal-title":"Transportation Science"},{"key":"2740_CR35","doi-asserted-by":"crossref","unstructured":"Moreno, L., de\u00a0Aragao, M.\u00a0P., & Uchoa, E. (2006). Column generation based heuristic for a helicopter routing problem. In Experimental algorithms, pp. 219\u2013230. Springer.","DOI":"10.1007\/11764298_20"},{"issue":"2","key":"2740_CR36","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"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\u2013121.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"2740_CR37","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1007\/s10479-015-2001-7","volume":"253","author":"PK Nguyen","year":"2017","unstructured":"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\u2013934.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2740_CR38","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s00291-011-0259-y","volume":"33","author":"L Ozdamar","year":"2011","unstructured":"Ozdamar, L. (2011). Planning helicopter logistics in disaster relief. OR Spectrum, 33(3), 655\u2013672.","journal-title":"OR Spectrum"},{"key":"2740_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2013.02.007","volume":"52","author":"J Paquette","year":"2013","unstructured":"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\u201316.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"2740_CR40","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Journal f\u00fcr Betriebswirtschaft, 58(1), 21\u201351.","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"2740_CR41","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.ejor.2016.07.037","volume":"257","author":"V Pimenta","year":"2017","unstructured":"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\u2013613.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"2740_CR42","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.engappai.2005.12.013","volume":"19","author":"B Rekiek","year":"2006","unstructured":"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\u2013520.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2740_CR43","doi-asserted-by":"crossref","unstructured":"Ritzinger, U., Puchinger, J., & Hartl, R.\u00a0F. (2016). Dynamic programming based metaheuristics for the dial-a-ride problem. Annals of Operations Research, 236(2), 341\u2013358.","DOI":"10.1007\/s10479-014-1605-7"},{"issue":"4","key":"2740_CR44","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S R\u00f8pke","year":"2007","unstructured":"R\u00f8pke, 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\u2013272.","journal-title":"Networks"},{"issue":"4","key":"2740_CR45","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455\u2013472.","journal-title":"Transportation Science"},{"key":"2740_CR46","volume-title":"The synchronized vehicle dispatching problem","author":"L-M Rousseau","year":"2003","unstructured":"Rousseau, L.-M., Gendreau, M., & Pesant, G. (2003). The synchronized vehicle dispatching problem. New York: Citeseer."},{"issue":"4","key":"2740_CR47","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M Savelsbergh","year":"1998","unstructured":"Savelsbergh, M., & Sol, M. (1998). Drive: Dynamic routing of independent vehicles. Operations Research, 46(4), 474\u2013490.","journal-title":"Operations Research"},{"issue":"3","key":"2740_CR48","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.cor.2008.07.010","volume":"37","author":"V Schmid","year":"2010","unstructured":"Schmid, V., Doerner, K. F., Hartl, R. F., & Salazar-Gonz\u00e1lez, J.-J. (2010). Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Computers & Operations Research, 37(3), 559\u2013574.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"2740_CR49","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1108\/ijpdlm.2011.00541daa.001","volume":"41","author":"J Stentoft Arlbj\u00f8rn","year":"2011","unstructured":"Stentoft Arlbj\u00f8rn, J., Qian, F., Gribkovskaia, I., & Halskau, \u00d8, 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\u2013415.","journal-title":"International Journal of Physical Distribution & Logistics Management"},{"key":"2740_CR50","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, 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\u2013314. IEEE.","DOI":"10.1109\/ICEC.1997.592327"},{"key":"2740_CR51","unstructured":"St\u00fctzle, T., & Hoos, H.\u00a0H. (1996). Improving the ant system: A detailed report on the max\u2013min ant system. FG Intellektik, FB Informatik, TU Darmstadt, Germany, Tech. Rep. AIDA\u201396\u201312."},{"issue":"8","key":"2740_CR52","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., & Hoos, H. H. (2000). Max\u2013min ant system. Future Generation Computer Systems, 16(8), 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"2740_CR53","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/inte.22.3.100","volume":"22","author":"MTF Timlin","year":"1992","unstructured":"Timlin, M. T. F., & Pulleyblank, W. R. (1992). Precedence constrained routing and helicopter scheduling: Heuristic design. Interfaces, 22(3), 100\u2013111.","journal-title":"Interfaces"},{"key":"2740_CR54","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (1996). Fast local search algorithms for the handicapped persons transportation problem. In Meta-Heuristics, pp. 677\u2013690. Springer.","DOI":"10.1007\/978-1-4613-1361-8_41"},{"key":"2740_CR55","doi-asserted-by":"crossref","unstructured":"Velasco, N., Castagliola, P., Dejax, P., Gu\u00e9ret, 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\u2013190. Springer.","DOI":"10.1007\/978-3-540-85152-3_8"},{"key":"2740_CR56","unstructured":"Wray, J.\u00a0D. (2009). Optimizing helicopter assault support in a high demand environment. Master\u2019s thesis, Monterey, California. Naval Postgraduate School."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2740-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2740-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2740-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T06:05:55Z","timestamp":1522821955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2740-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"references-count":56,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2740"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2740-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}