Abstract
We consider a logistic distribution decision-making problem, in which a vehicle fleet must carry out a set of deliveries between pairs of nodes of the underlying transportation network. The goal is to maximize the number of deliveries that will be carried out, while also minimizing the number of vehicles utilized to this end. The optimization is lexicographic in the sense that the former objective exhibits higher priority than the latter one. For this problem, we develop an integer programming model formulation and an associated column generation-based solution methodology. The proposed methodology utilizes a master problem which tries to fulfill the maximum possible number of deliveries given a specific set of vehicle routes and a column generation subproblem which is used to generate cost-effective vehicle routes1, for improving the master problem solution. We describe the steps of the proposed methodology, illustrating how it can be modified to accommodate interesting problem variations that often arise in practice. We also present extensive computational results demonstrating the computational performance of the proposed solution algorithm and illustrating how its behavior is influenced by key design parameters.
1We use the term vehicle route to denote a feasible sequence of deliveries assigned to a specific vehicle.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bard, J.F., Nananukul, N.: A branch and price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 37(12), 2202–2217 (2010)
Bianco, L., Mingozzi, A., Ricciardelli, S.: A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods Softw. 3, 163–194 (1994)
Borndörfer, R., Dovica, I., Nowak, I., Schickinger, T.: Robust tail assignment. Proceedings of the 50th annual symposium of AGIFORS, 21 pages, Nice, France (2010)
Bunte, S., Kliewer, N.: An overview on vehicle scheduling models. Public Transp. 1, 299–317 (2009)
Chang, Y.-C., Chang, K.-H., Chang, T.-K.: Applied column generation-based approach to solve supply chain scheduling problems. Int. J. Prod. Res. 51(13), 4070–4086 (2013)
Desrochers, M., Soumis, F.: A generalized permanent labelling algorithm for the shortest path problem with time windows. Infor. 26, 191–212 (1988)
Desrosiers, J., Dumas, Y., Soumis, F.: A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Am. J. Math. Manag. Sci. 6, 301–325 (1986)
Desrosiers, J., Lübbecke, M.E.: A primer in column generation. In: Desaulniers, G., et al. (eds.) Column Generation, Chapter 1, pp. 1–32. Springer, New York (2005)
Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight constrained shortest path problem. Networks. 42(3), 135–153 (2003)
Gabteni, S., Grönkvist, M.: Combining column generation and constraint programming to solve the tail assignment problem. Ann. Oper. Res. 171, 61–76 (2009)
Grönkvist, M.: A constraint programming model for tail assignment. Lecture notes in computer science. Proceedings of CPAIOR’04, 3011, pp. 142–156. Springer, Berlin (2004)
Grönkvist, M.: The tail assignment problem. PhD Dissertation, Göteborg University, Department of Computer Science and Engineering (2005a)
Grönkvist, M.: Accelerating column generation for aircraft scheduling using constraint propagation. Comput. Oper. Res. 33, 2918–2934 (2005b)
Grönkvist, M.: A hybrid column generation and constraint programming optimizer for the tail assignment problem. Lecture notes in computer science, Proceedings of CPAIOR’06, 3990, pp. 89–103. Springer, Berlin (2006)
IBM ILOG CPLEX V12.5.1: User’s Manual for CPLEX, http://www-01.ibm.com/support/knowledgecenter/SSSA5P_12.5.1/maps/ic-homepage.html (2013). Last accessed on 10 June 2017
Kozanidis, G.: Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft. Optimization Methods & Software. (2017). https://doi.org/10.1080/10556788.2017.1281923
Kohl, N., Madsen, O.B.: An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Oper. Res. 45, 395–406 (1997)
Kudva, G., Morin, T.L., Pekny, J.F.: A branch-and-cut algorithm for vehicle routing problems. Ann. Oper. Res. 50, 37–59 (1994)
Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7(4–5), 285–300 (2000)
Martins, E.Q.V.: An algorithm for ranking paths that may contain cycles. Eur. J. Oper. Res. 18, 123–130 (1984)
Mesquita, M., Paias, A.: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput. Oper. Res. 35, 1562–1575 (2008)
Morávek, J.: A note upon minimal path problem. J. Math. Anal. Appl. 30(3), 702–717 (1970)
Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269–280. Amsterdam, North-Holland (1981)
Sarac, A., Batta, R., Rump, C.M.: A branch and price approach for operational aircraft maintenance routing. Eur. J. Oper. Res. 175, 1850–1869 (2006)
Wilhelm, W.E.: A technical review of column generation in integer programming. Optim. Eng. 2, 159–200 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Kozanidis, G. (2017). Column Generation for Optimal Shipment Delivery in a Logistic Distribution Network. In: Cinar, D., Gakis, K., Pardalos, P. (eds) Sustainable Logistics and Transportation. Springer Optimization and Its Applications, vol 129. Springer, Cham. https://doi.org/10.1007/978-3-319-69215-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-69215-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69214-2
Online ISBN: 978-3-319-69215-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)