Abstract
We study a multi-criteria variant of the problem of routing hazardous material on a geographical area subdivided in regions. The two objective functions are given by a generally defined routing cost and a risk equity equal to the maximum, over each region, of the risk perceived within a region. This is a multicommodity flow problem where integer variables are used to define the number of trucks used for the routing. This problem admits a straightforward path formulation, for which a branch-and-price problem where, for each node of the branch-and-bound tree, column generation is used to obtain a lower bound.
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
Preview
Unable to display preview. Download preview PDF.
References
Akgun, V., Erkut, E., Batta, R.: On finding dissimilar paths. European Journal of Operational Research 121(2), 232–246 (2000)
Barnhart, C., Hane, C.A., Vance, P.H.: Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems. Oper. Res. 48(2), 318–326 (2000)
Caramia, M., Dell’Olmo, P.: Multiobjective management in freight logistics: increasing capacity, service level and safety with optimization algorithms. In: Hazardous Material Transportation Problems, ch. 4, pp. 65–101. Springer-Verlag London Ltd, Heidelberg (2008)
Desrosiers, J., Lübbecke, M.E.: A Primer in Column Generation, Column Generation, pp. 1–32. Springer, US (2006)
Erkut, E., Tjandra, S., Verter, V.: Transportation. In: Barnhart, C., Laporte, G. (eds.) Hazardous Materials Transportation. Handbooks in Operations Research and Management Science, vol. 14, ch. 9, pp. 539–621. Elsevier, Amsterdam (2007)
Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL A modelling Language for Mathematical Programming, 2nd edn. Duxbury Press Brooks Cole Publishing Co. (2003)
Bertsekas, D.P., Gendron, B., Tsai, W.K.: Implementation of an Optimal Multicommodity Network Flow Algorithm Based on Gradient Projection and a Path Flow Formulation, Massachusetts Institute of Technology, LIDS-P-1364, pp. 1-66 (1984)
Gopalan, R., Batta, R., Karwan, M.H.: The equity constrained shortest path problem. Computers and Operations Research 17, 297–307 (1990)
Gopalan, R., Kolluri, K.S., Batta, R., Karwan, M.H.: Modeling equity of risk in the transportation of hazardous materials. Operations Research 38(6), 961–973 (1990)
Johnson, P.E., Joy, D.S., Clarke, D.B., Jacobi, J.M.: HIGWAY 3.01, An enhanced highway routing model: Program, description, methodology and revised user’s manual, Oak Ridge National Laboratory, ORLN/TM-12124, Oak Ridge, TN (1992)
Jünger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software: Practice and Experience 30(11), 1325–1352 (2000)
Kuby, M., Zhongyi, X., Xiaodong, X.: A minimax method for finding the k best differentiated paths. Geographical Analysis 29(4), 298–313 (1997)
Lombard, K., Church, R.L.: The gateway shortest path problem: Generating alternative routes for a corridor location problem. Geographical Systems 1, 25–45 (1993)
Orlowski, S., Raack, C., Koster, A.M.C.A., Baier, G., Engel, T., Belotti, P.: Branch-and-cut techniques for solving realistic two-layer network design problems. In: Graphs and Algorithms in Communication Networks, ch. 3, pp. 95–117. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Touati-Moungla, N., Belotti, P., Jost, V., Liberti, L. (2011). A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)