Abstract
In logistic problems, an Integral Multi-Commodity Network Design Problem on a time-space network is often used to model the problem of routing transportation means and assigning freight units to those means. In Physical Internet and Synchromodal networks, an interactive planning approach is preferable, meaning that calculation times of a single planning step should be short. In this chapter, we provide ways to reduce the size of the problem formulation based on cutting planes, which are effective in reducing the computation time for Integer Linear Programming problem-based solution methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aardal, K., Weismantel, R., & Wolsey, L. A. (2002). Non-standard approaches to integer programming. Discrete Applied Mathematics, 123(1–3), 5–74.
Chouman, M., & Crainic, T. (2012). MIP-based matheuristic for service network design with design-balanced requirements. CIRRELT.
Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., & Schrijver, A. (1998). Combinatorial optimization. Wiley Interscience.
IBM. (2017). Cplex optimizer. https://www.ibm.com/analytics/data-science/prescriptive-analytics/cplex-optimizer
IBM. (2017). Zero-half cuts. www.ibm.com
Letchford, A. N., & Lodi, A. (2002). Strengthening Chvátal–Gomory cuts and Gomory fractional cuts. Operations Research Letters, 30(2), 74–82.
Magnanti, T. L., Mirchandani, P., & Vachani, R. (1995). Modeling and solving the two-facility capacitated network loading problem. Operations Research, 43(1), 142–157.
Marchand, H., Martin, A., Weismantel, R., & Wolsey, L. (2002). Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics, 123(1–3), 397–446.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 Netherlands Organisation for Applied Scientific Research
About this chapter
Cite this chapter
Kalicharan, K. (2023). Cutting Planes for Solving Logistic Flow Problems. In: Phillipson, F. (eds) Optimisation in Synchromodal Logistics. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-15655-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-15655-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15654-0
Online ISBN: 978-3-031-15655-7
eBook Packages: Business and ManagementBusiness and Management (R0)