Abstract
Due to the constant development of society, increasing quantities of commodities have to be transported in large urban centers. Therefore, network planning problems arise as tools to support decision-making, aiming to meet the need of finding efficient ways to perform such transportations. This paper reviews a bi-level formulation, a one level formulation obtained by applying the complementary slackness theorem, Bellman’s optimality conditions, Big-M Linearization and also presents a heuristic procedure, through combining a randomized constructive algorithm with an improved Relax-and-Fix heuristic, so high quality solutions could be found.
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
References
Magnanti, T.L., Wong, R.T.: Network Design and Transportation Planning: Models and Algorithms. Transp. Sci. 18, 1–55 (1984)
Boesch, F.T.: Large-scale Networks: Theory and Design. 1 edn. IEEE Press selected reprint series (1976)
Boyce, D., Janson, B.: A discrete transportation network design problem with combined trip distribution and assignment. Transp. Res. Part B: Methodol. 14, 147–154 (1980)
Mandl, C.E.: A survey of mathematical optimization models and algorithms for designing and extending irrigation and wastewater networks. Water Resour. Res. 17, 769–775 (1981)
Kimemia, J., Gershwin, S.: Network flow optimization in flexible manufacturing systems. In: 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes, pp. 633–639. IEEE (1978)
Graves, S.C., Lamar, B.W.: An integer programming procedure for assembly system design problems. Oper. Res. 31, 522–545 (1983)
Simpson, R.W.: Scheduling and Routing Models for Airline Systems. Massachusetts Institute of Technology, Flight Transportation Laboratory, Cambridge (1969)
Magnanti, T.L.: Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks 11, 179–213 (1981)
Johnson, D.S., Lenstra, J.K., Kan, A.H.G.R.: The complexity of the network design problem. Networks 8, 279–285 (1978)
Wong, R.T.: Accelerating Benders decomposition for network design. Ph.D. Thesis, Massachusetts Institute of Technology (1978)
Wong, R.T.: Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Methods 1, 51–63 (1980)
Billheimer, J.W., Gray, P.: Network design with fixed and variable cost elements. Transp. Sci. 7, 49–74 (1973)
Kara, B.Y., Verter, V.: Designing a road network for hazardous materials transportation. Transp. Sci. 38, 188–196 (2004)
Erkut, E., Tjandra, S.A., Verter, V.: Hazardous materials transportation. Handb. Oper. Res. Manage. Sci. 14, 539–621 (2007)
Mauttone, A., Labbé, M., Figueiredo, R.M.V.: A Tabu Search approach to solve a network design problem with user-optimal flows. In: V ALIO/EURO Conference on Combinatorial Optimization, pp. 1–6. Buenos Aires (2008)
Erkut, E., Gzara, F.: Solving the hazmat transport network design problem. Comput. Oper. Res. 35, 2234–2247 (2008)
Amaldi, E., Bruglieri, M., Fortz, B.: On the hazmat transport network design problem. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 327–338. Springer, Heidelberg (2011)
González, P.H., Martinhon, C.A.D.J., Simonetti, L.G., Santos, E., Michelon, P.Y.P.: Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário. In: XLV Simpósio Brasileiro de Pesquisa Operacional, Natal (2013)
Holmberg, K., Yuan, D.: Optimization of internet protocol network design and routing. Networks 43, 39–53 (2004)
Colson, B., Marcotte, P., Savard, G.: Bilevel programming: a survey. 4OR 3, 87–107 (2005)
Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. Wiley-Interscience, New York (2004)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice-Hall Inc, Upper Saddle River, NJ, USA (1993)
De Giovanni, L.: The internet protocol network design problem with reliability and routing constraints. Ph.D. Thesis, Politecnico di Torino (2004)
Hettmansperger, T.P., McKean, J.W.: Robust Nonparametric Statistical Methods. CRC Press, Boca Raton (1998)
Bektas, T., Crainic, T. G., Gendron, B.: Lagrangean decomposition for the multicommodity capacitated network design problem (2007)
Costa, A.M., Cordeau, J.F., Gendron, B.: Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42, 371–392 (2007)
Acknowledgements
This work was supported by CAPES (Process Number: BEX 9877/13-4) and by Laboratoire d’Informatique d’Avignon, Université d’Avignon et des Pays de Vaucluse, Avignon, France. Luidi Simonetti is partially funded by CNPq grants 304793/2011-6.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
González, P.H., Simonetti, L.G., de Jesus Martinhon, C.A., Santos, E., Michelon, P.Y.P. (2015). A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow. In: Pinson, E., Valente, F., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2014. Communications in Computer and Information Science, vol 509. Springer, Cham. https://doi.org/10.1007/978-3-319-17509-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-17509-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17508-9
Online ISBN: 978-3-319-17509-6
eBook Packages: Computer ScienceComputer Science (R0)