An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon

2014

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 review a bi-level formulation, an one level formulation obtained by applying the complementary slackness theorem, Bellman's optimality conditions and presents an improved Relax-and-Fix heuristic, through combining a randomized constructive algorithm with a Relax-and-Fix heuristic, so high quality solutions could be found. Besides that, our computational results are compared with the results found by an one-level formulation and other heuristics found in the literature, showing the efficiency of the proposed method.

References

  1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
  2. Amaldi, E., Bruglieri, M., and Fortz, B. (2011). On the hazmat transport network design problem. In Proceedings of the 5th international conference on Network optimization, INOC'11, pages 327-338, Berlin, Heidelberg. Springer-Verlag.
  3. Bazaraa, M. S., Jarvis, J. J., and Sherali, H. D. (2004). Linear Programming and Network Flows. WileyInterscience.
  4. Bektas, T., Crainic, T. G., and Gendron, B. (2007). Lagrangean decomposition for the multicommodity capacitated network design problem.
  5. Billheimer, J. W. and Gray, P. (1973). Network Design with Fixed and Variable Cost Elements. Transportation Science, 7(1):49-74.
  6. Boesch, F. T. (1976). Large-scale Networks: Theory and Design. IEEE Press selected reprint series, 1 edition.
  7. Boyce, D. and Janson, B. (1980). A discrete transportation network design problem with combined trip distribution and assignment. Transportation Research Part B: Methodological, 14(1-2):147-154.
  8. Colson, B., Marcotte, P., and Savard, G. (2005). Bilevel programming: A survey. 4OR, 3(2):87-107.
  9. Costa, A. M., Cordeau, J.-F., and Gendron, B. (2007). Benders, metric and cutset inequalities for multicommodity capacitated network design. Computational Optimization and Applications, 42(3):371-392.
  10. Erkut, E. and Gzara, F. (2008). Solving the hazmat transport network design problem. Computers & Operations Research, 35(7):2234-2247.
  11. Erkut, E., Tjandra, S. A., and Verter, V. (2007). Hazardous Materials Transportation. In Handbooks in Operations Research and Management Science, volume 14, chapter 9, pages 539-621.
  12. González, P. H., Martinhon, C. A. d. J., Simonetti, L. G., Santos, E., and Michelon, P. Y. P. (2013). Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas O timas para o Usuário. In XLV Simpósio Brasileiro de Pesquisa Operacional, Natal.
  13. Graves, S. C. and Lamar, B. W. (1983). An Integer Programming Procedure for Assembly System Design Problems. Operations Research, 31(3):522-545.
  14. Holmberg, K. and Yuan, D. (2004). Optimization of Internet Protocol network design and routing. Networks, 43(1):39-53.
  15. Johnson, D. S., Lenstra, J. K., and Kan, A. H. G. R. (1978). The complexity of the network design problem. Networks, 8(4):279-285.
  16. Kara, B. Y. and Verter, V. (2004). Designing a Road Network for Hazardous Materials Transportation. Transportation Science, 38(2):188-196.
  17. Kimemia, J. and Gershwin, S. (1978). Network flow optimization in flexible manufacturing systems. In 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes, pages 633-639. IEEE.
  18. Luigi De Giovanni (2004). The Internet Protocol Network Design Problem with Reliability and Routing Constraints. PhD thesis, Politecnico di Torino.
  19. Magnanti, T. L. (1981). Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks, 11(2):179-213.
  20. Magnanti, T. L. and Wong, R. T. (1984). Network Design and Transportation Planning: Models and Algorithms. Transportation Science, 18(1):1-55.
  21. Mandl, C. E. (1981). A survey of mathematical optimization models and algorithms for designing and extending irrigation and wastewater networks. Water Resources Research, 17(4):769-775.
  22. Mauttone, A., Labbé, M., and Figueiredo, R. M. V. (2008). A Tabu Search approach to solve a network design problem with user-optimal flows. In V ALIO/EURO Conference on Combinatorial Optimization, pages 1- 6, Buenos Aires.
  23. Simpson, R. W. (1969). Scheduling and routing models for airline systems. Massachusetts Institute of Technology, Flight Transportation Laboratory.
  24. Wong, R. T. (1978). Accelerating Benders decomposition for network design. PhD thesis, Massachusetts Institute of Technology.
  25. Wong, R. T. (1980). Worst-Case Analysis of Network Design Problem Heuristics. SIAM Journal on Algebraic Discrete Methods, 1(1):51-63.
Download


Paper Citation


in Harvard Style

González P., Simonetti L., de Jesus Martinhon C., Santos E. and Paul Michelon P. (2014). An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 100-107. DOI: 10.5220/0004832601000107


in Bibtex Style

@conference{icores14,
author={Pedro Henrique González and Luidi Gelabert Simonetti and Carlos Alberto de Jesus Martinhon and Edcarllos Santos and Philippe Yves Paul Michelon},
title={An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={100-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004832601000107},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow
SN - 978-989-758-017-8
AU - González P.
AU - Simonetti L.
AU - de Jesus Martinhon C.
AU - Santos E.
AU - Paul Michelon P.
PY - 2014
SP - 100
EP - 107
DO - 10.5220/0004832601000107