Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft

Optimization Methods and Software

Volumn 33, Issue 2, 2018, Pages 221-248

  Kozanidis, George ^a  

^a UNIVERSITY OF THESSALY   (Greece)

Author keywords

aircraft routing; branch and price; column generation; distribution network; integer programming; logistic shipments

Indexed keywords

AIRCRAFT; COST EFFECTIVENESS; COSTS; ELECTRIC POWER DISTRIBUTION; LINEAR PROGRAMMING; SHIPS;

AIRCRAFT ROUTING; BRANCH AND PRICE; COLUMN GENERATION; COMPUTATIONAL PERFORMANCE; INTEGER PROGRAMMING MODELS; KEY DESIGN PARAMETERS; LOGISTIC DISTRIBUTION NETWORK; MINIMIZING THE NUMBER OF;

INTEGER PROGRAMMING;

EID: 85011301822     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2017.1281923     Document Type: Article

References (37)

1. AIMS, Airline Solutions Package and Aviation Software, Athens, Greece, 2016. Available at http://www.aims.aero.
2. C., Archetti, L., Bertazzi, G., Laporte, and M.G., Speranza, A branch-and-cut algorithm for a vendor-managed inventory-routing problem, Transp. Sci. 41 (2007), pp. 382–391. doi: 10.1287/trsc.1060.0188
3. J.F., Bard and N., Nananukul, A branch and price algorithm for an integrated production and inventory routing problem, Comput. Oper. Res. 37 (2010), pp. 2202–2217. doi: 10.1016/j.cor.2010.03.010
4. C., Barnhart, N.L., Boland, L.W., Clarke, E.L., Johnson, G.L., Nemhauser, and R.G., Shenoi, Flight string models for aircraft fleeting and routing, Transp. Sci. 32 (1998), pp. 208–220. doi: 10.1287/trsc.32.3.208
5. C., Barnhart, E.L., Johnson, G.L., Nemhauser, M.W.P., Savelsbergh, and P.H., Vance, Branch and price: Column generation for solving huge integer programs, Oper. Res. 46 (1998), pp. 316–329. doi: 10.1287/opre.46.3.316
6. C., Barnhart, A.M., Cohn, E.L., Johnson, D., Klabjan, G.L., Nemhauser, and P.H., Vance, Airline crew scheduling, in Handbook of Transportation Science, Randolph W., Hall, ed., Springer, Dordrecht, 2003, pp. 517–560.
7. M., Bielli, A., Bielli, and R., Rossi, Trends in models and algorithms for fleet management, Proc. Soc. Behav. Sci. 20 (2011), pp. 4–18. doi: 10.1016/j.sbspro.2011.08.004
8. R., Borndörfer, I., Dovica, I., Nowak, and T., Schickinger, Robust tail assignment, Proceedings of the 50th Annual Symposium of AGIFORS, Nice, France, 2010.
9. G., Brønmo, B., Nygreen, and J., Lysgaard, Column generation approaches to ship scheduling with flexible cargo sizes, European J. Oper. Res. 200 (2010), pp. 139–150. doi: 10.1016/j.ejor.2008.12.028
10. Y.-C., Chang, K.-H., Chang, and T.-K., Chang, Applied column generation-based approach to solve supply chain scheduling problems, Int. J. Prod. Res. 51 (2013), pp. 4070–4086. doi: 10.1080/00207543.2013.774476
11. M., Christiansen and B., Nygreen, A method for solving ship routing problems with inventory constraints, Ann. Oper. Res. 81 (1998), pp. 357–378. doi: 10.1023/A:1018921527269
12. M., Desrochers and F., Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR 26 (1988), pp. 191–212.
13. J., Desrosiers, M., Sauvé, and F., Soumis, Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows, Manage. Sci. 34 (1988), pp. 1005–1022. doi: 10.1287/mnsc.34.8.1005
14. J., Desrosiers and M.E., Lübbecke, A primer in column generation, in Column Generation, G., Desaulniers, J., Desrosiers, and M.M., Solomon, eds., Springer, Berlin, 2005, pp. 1–32.
15. I., Dumitrescu and N., Boland, Improved preprocessing, labeling and scaling algorithms for the weight constrained shortest path problem, Networks 42 (2003), pp. 135–153. doi: 10.1002/net.10090
16. R., Freling, A.P.M., Wagelmans, and J.M.P., Paixão, Models and algorithms for single-depot vehicle scheduling, Transp. Sci. 35 (2001), pp. 165–180. doi: 10.1287/trsc.35.2.165.10135
17. S., Gabteni and M., Grönkvist, Combining column generation and constraint programming to solve the tail assignment problem, Ann. Oper. Res. 171 (2009), pp. 61–76. doi: 10.1007/s10479-008-0379-1
18. M., Grönkvist, A constraint programming model for tail assignment, Proceedings of CPAIOR’04, Lecture Notes in Computer Science 3011, Springer, Berlin, 2004, pp. 142–156.
19. M., Grönkvist, The tail assignment problem, Ph.D. diss., Göteborg University, Department of Computer Science and Engineering, 2005.
20. M., Grönkvist, Accelerating column generation for aircraft scheduling using constraint propagation, Comput. Oper. Res. 33 (2006), pp. 2918–2934. doi: 10.1016/j.cor.2005.01.017
21. M., Grönkvist, A hybrid column generation and constraint programming optimizer for the tail assignment problem, Proceedings of CPAIOR’06, Lecture Notes in Computer Science 3990, Springer, Berlin, 2006, pp. 89–103.
22. P.C., Guedes and D., Borenstein, Column generation based heuristic framework for the multiple-depot vehicle type scheduling problem, Comput. Ind. Eng. 90 (2015), pp. 361–370. doi: 10.1016/j.cie.2015.10.004
23. IBM ILOG CPLEX V12.5.1, User’s Manual for CPLEX, 2013. Available at http://www-01.ibm.com/support/knowledgecenter/SSSA5P_12.5.1/maps/ic-homepage.html.
24. H., Karimi and A., Seifi, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Optim. Methods Softw. 30 (2015), pp. 1109–1125. doi: 10.1080/10556788.2015.1025134
25. J., Lysgaard, A.N., Letchford, and R.W., Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Math. Program. 100 (2004), pp. 423–445. doi: 10.1007/s10107-003-0481-8
26. E.Q.V., Martins, An algorithm for ranking paths that may contain cycles, European J. Oper. Res. 18 (1984), pp. 123–130. doi: 10.1016/0377-2217(84)90269-8
27. Q., Meng, S., Wang, and C.Y., Lee, A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem, Transp. Res. B, Methodol. 72 (2015), pp. 1–19. doi: 10.1016/j.trb.2014.11.008
28. O., du Merle, D., Villeneuve, J., Desrosiers, and P., Hansen, Stabilized column generation, Discrete Math. 194 (1999), pp. 229–237. doi: 10.1016/S0012-365X(98)00213-1
29. J., Morávek, A note upon minimal path problem, J. Math. Anal. Appl. 30 (1970), pp. 702–717. doi: 10.1016/0022-247X(70)90154-X
30. M., Mourgaya and F., Vanderbeck, Column generation based heuristic for tactical planning in multi-period vehicle routing, European J. Oper. Res. 183 (2007), pp. 1028–1041. doi: 10.1016/j.ejor.2006.02.030
31. L.M., Rousseau, M., Gendreau, G., Pesant, and F., Focacci, Solving VRPTWs with constraint programming based column generation, Ann. Oper. Res. 130 (2004), pp. 199–216. doi: 10.1023/B:ANOR.0000032576.73681.29
32. D.M., Ryan and B.A., Foster, An integer programming approach to scheduling, in Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, A., Wren, ed., Amsterdam, North-Holland, 1981, pp. 269–280.
33. M., Saddoune, G., Desaulniers, I., Elhallaoui, and F., Soumis, Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods, European J. Oper. Res. 212 (2011), pp. 445–454. doi: 10.1016/j.ejor.2011.02.009
34. A., Sarac, R., Batta, and C.M., Rump, A branch-and-price approach for operational aircraft maintenance routing, European J. Oper. Res. 175 (2006), pp. 1850–1869. doi: 10.1016/j.ejor.2004.10.033
35. V., Schmid, K.F., Doerner, and G., Laporte, Rich routing problems arising in supply chain management, European J. Oper. Res. 224 (2013), pp. 435–448. doi: 10.1016/j.ejor.2012.08.014
36. É.D., Taillard, A heuristic column generation method for the heterogeneous fleet VRP, RAIRO—Oper. Res. 33 (1999), pp. 1–14. doi: 10.1051/ro:1999101
37. X., Xinlian, W., Tengfei, and C., Daisong, A dynamic model and algorithm for fleet planning, Marit. Policy Manag. 27 (2000), pp. 53–63. doi: 10.1080/030888300286680