Airbus-A330. (2020). Airbus. Retrieved August 30, 2020, from https://www.airbus.com/aircraft/freighter/a330-200f.html#details
Airbus. (2020). Airbus A330 Characteristics. Retrieved February 15, 2021, from https://www.airbus.com/content/dam/corporate-topics/publications/backgrounders/techdata/aircraft_characteristics/Airbus-Commercial-Aircraft-AC-A330.pdf
Airbus Global Market Forecast. (2020). Global Market Forecast. Retrieved August 9, 2020, from https://www.airbus.com/aircraft/market/global-market-forecast.html
Aksoy, Ö., & Kapanoglu, M. (2012). Multi-Commodity , Multi-Depot , Heterogenous Vehicle Pickup and Delivery Problem for Air Transportation in the Turkish Air Force. Journal of Aeronautics and Space Technologies, 5(4), 53–57.
Bae, H., & Moon, I. (2016). Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Applied Mathematical Modelling, 40, 6536–6549. https://doi.org/10.1016/j.apm.2016.01.059
Balakrishnan, N. (1993). Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows. The Journal of the Operational Research Society, 44(3), 279–287.
Baniamerian, A., Bashiri, M., & Tavakkoli-Moghaddam, R. (2019). Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking. Applied Soft Computing Journal, 75, 441–460. https://doi.org/10.1016/j.asoc.2018.11.029
Bezerra, S. N., Souza, S. R. De, & Souza, M. J. F. (2018). A GVNS Algorithm for Solving the Multi-Depot Vehicle Routing Problem. Electronic Notes in Discrete Mathematics, 66, 167–174. https://doi.org/10.1016/j.endm.2018.03.022
Boeing-747. (2020). Boeing. Retrieved August 30, 2020, from http://www.boeing.com/resources/boeingdotcom/company/about_bca/startup/pdf/freighters/747-400f.pdf
Carosi, S., Frangioni, A., Galli, L., Girardi, L., & Vallese, G. (2019). A matheuristic for integrated timetabling and vehicle scheduling. Transportation Research Part B: Methodological, 127, 99–124. https://doi.org/10.1016/j.trb.2019.07.004
Cessna-GrandCaravan. (2020). Cessna. Retrieved August 30, 2020, from https://cessna.txtav.com/en/turboprop/grand-caravan-ex#_model-specs
Clarke, G., & Wright, J. W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12(4), 568–581. https://doi.org/10.1287/opre.12.4.568
Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928–936. https://doi.org/10.1057/palgrave.jors.2601163
Crevier, B., Cordeau, J. F., & Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research, 176(2), 756–773. https://doi.org/10.1016/j.ejor.2005.08.015
Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–92.
Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operations Research, 40(2), 342–354. https://doi.org/10.1287/opre.40.2.342
DHL. (2020). DHL. Retrieved August 30, 2020, from https://aviationcargo.dhl.com/fleet-information
Doganis, R. (1991). Flying Off Course The Economics of International Airlines (2nd ed.). New York, USA: Routledge.
Dong, X., Zhang, H., Xu, M., & Shen, F. (2021). Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem. Future Generation Computer Systems, 114, 229–242. https://doi.org/10.1016/j.future.2020.07.008
Dursun, Ö. O. (2017). Mathematical Model Suggestion For A Vehicle Routing Problem With The Fleet Of Air And Roadway Vehicles. Anadolu University.
EKOL. (2020). Ekol. Retrieved August 30, 2020, from http://www.ekol.com/tr
FedEx. (2020). Fedex. Retrieved August 30, 2020, from http://www.fedex.com/us/charters/airplanes.html
Franceschetti, A., Honhon, D., Laporte, G., Woensel, T. Van, & Fransoo, J. C. (2017). Strategic fleet planning for city logistics. Transportation Research Part B: Methodological, 95, 19–40. https://doi.org/10.1016/j.trb.2016.10.005
Gen, M., Cheng, R., & Lin, L. (2008). Network Models and Optimization: Multiobjective Genetic Algorithm Approach. Springer-Varlag.
Gendreau, M., Laporte, G., Musaraganyi, C., & Taillard, É. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26(12), 1153–1173. https://doi.org/10.1016/S0305-0548(98)00100-2
Gheysens, F., Golden, B., & Assad, A. (1984). A Comparison of Techniques for Solving the Fleet Size and Mix Vehicle Routing Problem. OR Spektrum, 6, 207–216.
Golden, B., Raghavan, S., & Wasil, E. (2008). The Vehicle Routing Problem: Latest Advances and New Challenges. In B. Golden, S. Raghavan, & E. Wasil (Eds.), Information Systems Journal. https://doi.org/10.1007/978-0-387-77778-8
GoogleMaps. (2020). Google Map. Retrieved August 30, 2020, from https://www.google.com/maps/@?dg=dbrw&newdg=1
Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., & Prasath, V. B. S. (2019). Choosing mutation and crossover ratios for genetic algorithms-a review with a new dynamic approach. Information (Switzerland), 10(12). https://doi.org/10.3390/info10120390
Ho, W., Ho, G. T. S., Ji, P., & Lau, H. C. W. (2008). A hybrid genetic algorithm for the multi-depot vehicle routing problem. Engineering Applications of Artificial Intelligence, 21, 548–557. https://doi.org/10.1016/j.engappai.2007.06.001
Hsu, C. I., Hung, S. F., & Li, H. C. (2007). Vehicle routing problem with time-windows for perishable food delivery. Journal of Food Engineering, 80(2), 465–475. https://doi.org/10.1016/j.jfoodeng.2006.05.029
ICAO. (2020). EASA. Retrieved August 30, 2020, from https://www.easa.europa.eu/document-library/icao-aircraft-engine-emissions-databank#1
Karaoglan, I., Altiparmak, F., Kara, I., & Dengiz, B. (2012). The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega, 40(4), 465–477. https://doi.org/10.1016/j.omega.2011.09.002
Karimi Dastjerd, N., & Ertogral, K. (2019). A fix-and-optimize heuristic for the integrated fleet sizing and replenishment planning problem with predetermined delivery frequencies. Computers and Industrial Engineering, 127(September 2018), 778–787. https://doi.org/10.1016/j.cie.2018.11.014
Kirby, D. (1959). Is Your Fleet the Right Size? Operational Research Society, 10(4), 252. https://doi.org/10.1055/s-0035-1549902
Knight, K. W., & Hofer, J. P. (1968). Vehicle Scheduling with Timed and Connected Calls : A Case Study. Operational Research Society, 19(3), 299–310.
Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(1), 1–21. https://doi.org/10.1016/j.ejor.2015.07.020
Kritikos, M. N., & Ioannou, G. (2010). The balanced cargo vehicle routing problem with time windows. International Journal of Production Economics, 123(1), 42–51. https://doi.org/10.1016/j.ijpe.2009.07.006
Labbé, M., Rodríguez-Martin, I., & Salazar-González, J. J. (2004). A branch-and-cut algorithm for the plant-cycle location problem. Journal of the Operational Research Society, 55(5), 513–520. https://doi.org/10.1057/palgrave.jors.2601692
Laporte, G. (2009). Fifty Years of Vehicle Routing. Transportation Science, 43(4), 408–416. https://doi.org/10.1287/trsc.1090.0301
Laporte, G., Nobert, Y., & Taillefer, S. (1988). Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems. Transportation Science, 22(3), 161–172.
Li, J., Wang, R., Li, T., Lu, Z., & Pardalos, P. M. (2018). Bene fi t analysis of shared depot resources for multi-depot vehicle routing problem with fuel consumption. Transportation Research Part D, 59(February), 417–432. https://doi.org/10.1016/j.trd.2018.01.026
Lufthansa. (2020). Lufthansa. Retrieved August 30, 2020, from https://lufthansa-cargo.com/fleet-ulds/fleet
Mancini, S. (2016). A real-life Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet: Formulation and Adaptive Large Neighborhood Search based Matheuristic. Transportation Research Part C: Emerging Technologies, 70, 100–112. https://doi.org/10.1016/j.trc.2015.06.016
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM, 7(4), 326–329.
Molina, J. C., Salmeron, J. L., Eguia, I., & Racero, J. (2020). The heterogeneous vehicle routing problem with time windows and a limited number of resources. Engineering Applications of Artificial Intelligence, 94(February), 103745. https://doi.org/10.1016/j.engappai.2020.103745
Montoya-Torres, J. R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers and Industrial Engineering, 79, 115–129. https://doi.org/10.1016/j.cie.2014.10.029
Naji-Azimi, Z., & Salari, M. (2013). A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem. Applied Mathematical Modelling, 37(6), 4316–4324. https://doi.org/10.1016/j.apm.2012.09.027
Nuic, A. (2004). Aircraft Performance Summary Tables for The Base of Aircraft Data (BADA) Revision 3.6. Cedex, France:Eurocontrol Experimental Centre.
Oktal, H., & Ozger, A. (2013). Hub location in air cargo transportation: A case study. Journal of Air Transport Management, 27, 1–4. https://doi.org/10.1016/j.jairtraman.2012.10.009
Pečený, L., Meško, P., Kampf, R., & Gašparík, J. (2020). Optimisation in Transport and Logistic Processes. Transportation Research Procedia, 44(2019), 15–22. https://doi.org/10.1016/j.trpro.2020.02.003
Qureshi, A. G., Taniguchi, E., & Yamada, T. (2010). Exact solution for the vehicle routing problem with semi soft time windows and its application. Procedia - Social and Behavioral Sciences, 2(3), 5931–5943. https://doi.org/10.1016/j.sbspro.2010.04.008
Renaud, J., & Boctor, F. F. (2002). A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 140, 618–628. https://doi.org/10.1016/S0377-2217(01)00237-5
Renaud, J., Laporte, G., & Boctor, F. F. (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research, 23(3), 229–235. https://doi.org/10.1016/0305-0548(95)O0026-P
Repoussis, P. P., & Tarantilis, C. D. (2010). Solving the Fleet Size and Mix Vehicle Routing Problem with Time Windows via Adaptive Memory Programming. Transportation Research Part C: Emerging Technologies, 18(5), 695–712. https://doi.org/10.1016/j.trc.2009.08.004
RocketRoute. (2020). Rocket Route. Retrieved August 30, 2020, from http://www.rocketroute.com/
Salhi, S., Imran, A., & Wassan, N. A. (2014). The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Computers & Operations Research, 52, 315–325. https://doi.org/10.1016/j.cor.2013.05.011
Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4(1), 285–305. https://doi.org/10.1007/BF02022044
Solomon, M. M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, 35(2), 254–265. https://doi.org/10.1287/opre.35.2.254
Solomon, M. M., & Desrosiers, J. (1988). The Window Constrained Routing and Scheduling Problems. Transportation Science, 22(1), 1–13.
Taillard, É., Badeau, P., Gendreau, M., Guertin, F., & Potvin, J.-Y. (1997). A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science, 31(2), 170–186. https://doi.org/10.1287/trsc.31.2.170
Taillard, E. D. (1999). A Heuristic Column Generation Method for the Heterogeneous Fleet Vrp. RAIRO Rech. Opér, 33(1), 1–14.
Takan, A. M., & Kasimbeyli, R. (2021). Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems. Journal of Industrial & Management Optimization, 17(4), 2073-2095. https://doi.org/10.3934/jimo.2020059
Tang, J., Pan, Z., Fung, R. Y. K., & Lau, H. (2009). Vehicle routing problem with fuzzy time windows. Fuzzy Sets and Systems, 160(5), 683–695. https://doi.org/10.1016/j.fss.2008.09.016
Taniguchi, E., & Shimamoto, H. (2004). Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transportation Research Part C: Emerging Technologies, 12(3–4), 235–250. https://doi.org/10.1016/j.trc.2004.07.007
Taş, D., Jabali, O., & Van Woensel, T. (2014). A Vehicle Routing Problem with Flexible Time Windows. Computers & Operations Research, 52(PART A), 39–54. https://doi.org/10.1016/j.cor.2014.07.005
Tasan, A. S., & Gen, M. (2012). A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers and Industrial Engineering, 62(3), 755–761. https://doi.org/10.1016/j.cie.2011.11.025
THY. (2020). Turkish Cargo. Retrieved August 20, 2020, from http://www.turkishcargo.com.tr/tr/hizmet-agi-ve-filo/filo
Toth, P., & Vigo, D. (2014). Vehicle Routing, Problems, Methods, and Applications (Second). Society for Industrial and Applied Mathematics.
UPS. (2020). UPS. Retrieved August 30, 2020, from https://aircargo.ups.com/en-US/aircraft
Wang, Y., Zhang, S., Guan, X., Peng, S., & Wang, H. (2020). Collaborative multi-depot logistics network design with time window assignment. Expert Systems With Applications, 140. https://doi.org/10.1016/j.eswa.2019.112910
Xu, Y., Wang, L., & Yang, Y. (2012). A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows. Electronic Notes in Discrete Mathematics, 39, 289–296. https://doi.org/10.1016/j.endm.2012.10.038
Yan, S., Chu, J. C., Hsiao, F.-Y., & Huang, H.-J. (2015). A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Computers & Industrial Engineering, 87, 383–393. https://doi.org/10.1016/j.cie.2015.05.034
Yıldırım, Ü., & Kuvvetli, Y. (2021). Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms. International Journal of Industrial Engineering Computations, 12(4), 441–456. https://doi.org/10.5267/j.ijiec.2021.4.002
Zare-Reisabadi, E., & Hamid Mirmohammadi, S. (2015). Site dependent vehicle routing problem with soft time window: Modeling and solution approach. Computers & Industrial Engineering, 90, 177–185. https://doi.org/10.1016/j.cie.2015.09.002
Zhang, H., Zhang, Q., Ma, L., Zhang, Z., & Liu, Y. (2019). A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Information Sciences, 490, 166–190. https://doi.org/10.1016/j.ins.2019.03.070
Zhen, L., Ma, C., Wang, K., Xiao, L., & Zhang, W. (2020). Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transportation Research Part E, 135(January 2019), 101866. https://doi.org/10.1016/j.tre.2020.101866