A combined fast greedy heuristic for the capacitated multicommodity network design problem

References

• Alvarez, A. M., González-Velarde, J. L., & De-Alba, K. (2005). Scatter search for network design problem. Annals of Operations Research, 138(1), 159–178.
   Web of Science ®Google Scholar
• Balakrishnan, A., Magnanti, T. L., & Mirchandani, P. (1997). Network design. In M. Dell'Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 311–334). New York, NY: John Wiley & Sons.
   Google Scholar
• Chouman, M., & Crainic, T. G. (2010). A MIP-tabu search hybrid framework for multicommodity capacitated fixed-charge network design (Tech. Rep. CIRRELT-2010-31). Montreal, QC: Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, Université de Montréal.
   Google Scholar
• Costa, A. M. (2005). A survey on benders decomposition applied to fixed-charge network design problems. Computers and Operations Research, 32(6), 1429–1450.
   Web of Science ®Google Scholar
• Crainic, T. G. (2003). Long-haul freight transportation. In R. W. Hall (Ed.), Handbook of transportation science (pp. 451–516). Norwell, MA: Kluwer Academic Publishers.
   Google Scholar
• Crainic, T. G., Frangioni, A., & Gendron, B. (2001). Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Applied Mathematics, 112(1–3), 73–99.
   Web of Science ®Google Scholar
• Crainic, T. G., & Gendreau, M. (2007). A scatter search heuristic for the fixed-charge capacitated network design problem. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R. F. Hartl, & M. Reimann (eds.), Metaheuristics (pp. 25–40). Boston, MA: Springer.
   Google Scholar
• Crainic, T. G., Gendreau, M., & Farvolden, J. M. (2000). A simplex-based tabu search for capacitated network design. INFORMS Journal on Computing, 12(3), 223–236.
   Web of Science ®Google Scholar
• Crainic, T. G., Gendron, B., & Hernu, G. (2004). A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. Journal of Heuristics, 10(5), 525–545.
   Web of Science ®Google Scholar
• Crainic, T. G., Li, Y., & Toulouse, M. (2006). A first multilevel cooperative algorithm for capacitated multicommodity network design. Computers & Operations Research, 33(9), 2602–2622.
   Web of Science ®Google Scholar
• Gabrel, V., Knippel, A., & Minoux, M. (2003). A comparison of heuristics for the discrete cost multicommodity network optimization problem. Journal of Heuristics, 9(5), 429–445.
   Web of Science ®Google Scholar
• Ghamlouche, I., Crainic, T. G., & Gendreau, M. (2003). Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations Research, 51(4), 655–667.
   Web of Science ®Google Scholar
• Ghamlouche, I., Crainic, T. G., & Gendreau, M. (2004). Path relinking, cycle-based neighborhoods and capacitated multicommodity network design. Annals of Operations Research, 131(1–4), 109–134.
   Web of Science ®Google Scholar
• Hewitt, M., Nemhauser, G. L., & Savelsbergh, M. (2010). Combining exact and heuristics approaches for the capacitated fixed charge network flow problem. Journal on Computing, 22(2), 314–325.
   Google Scholar
• Katayama, N. (2010). Mathematical methods for multi-commodity logistics network design problem. (Doctoral thesis). Ryutsu Keizi University, Ryugasaki, Japan.
   Google Scholar
• Katayama, N. (2015). A combined capacity scaling and local branching approach for capacitated multi-commodity network design problem. Far East Journal of Applied Mathematics, 92(1), 1–30.
   Google Scholar
• Katayama, N., Chen, M. Z., & Kubo, M. (2009). A capacity scaling procedure for the multi-commodity capacitated network design problem. Journal of Computational and Applied Mathematics, 232(1), 90–101.
   Web of Science ®Google Scholar
• Magnanti, T. L., & Wong, R. T. (1984). Network design and transportation planning: Models and algorithms. Transportation Science, 18(1), 1–55.
   Web of Science ®Google Scholar
• Minoux, M. (1989). Network synthesis and optimum network design problems: Models, solution methods and applications. Networks, 19(3), 313–360.
   Web of Science ®Google Scholar
• Paraskevopoulos, D., Bektaş, T., Crainic, T., & Potts, C. (2016). A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. European Journal of Operational Research, 253(2), 265–279.
   Web of Science ®Google Scholar
• Rodríguez-Martín, I., & José Salazar-González, J. (2010). A local branching heuristics for the capacitated fixed-charge network design problem. Computers & Operations Research, 37(3), 575–581.
   Web of Science ®Google Scholar
• Scott, A. J. (1969). The optimal network problem: Some computational procedures. Transportation Research, 3(2), 201–210.
   Google Scholar
• Wong, R. T. (1984). Introduction and recent advances in network design: Models and algorithms. In M. Florian (Ed.), Transportation planning models (pp. 187–225). North Holland, Amsterdam: Elsevier Science.
   Google Scholar
• Wong, R. T. (1985). Location and network design. In M. O'he Eigeartaigh, J. Lenstra, & A. Rinnooy Kan (Eds.), Combinatorial optimization annotated bibliographies (pp. 129–147). New York, NY: John Wiley & Sons.
   Google Scholar
• Yaghini, M., & Akhavan, R. (2012). Multicommodity network design problem in rail freight transportation planning. Procedia - Social and Behavioral Sciences, 43, 728–739.
   Google Scholar
• Yaghini, M., Karimi, M., Rahbar, M., & Akhavan, R. (2011). A hybrid simulated annealing and simplex method for fixed-cost capacitated multicommodity network design. International Journal of Applied Metaheuristic Computing, 2(4), 13–28.
   Google Scholar
• Yaghini, M., Rahbar, M., & Karimi, M. (2013). A hybrid simulated annealing and column generation approach for capacitated multicommodity network design. Journal of the Operational Research Society, 64(7), 1010–1020.
   Web of Science ®Google Scholar
• Zaleta, N. C., & Socarrás, A. M. A. (2004). Tabu search-based algorithm for capacitated multicommodity network design problems. In Proceedings of the 14th International Conference on Electronics, Communications and Computers (pp. 144–148), Veracruz, Mexico: IEEE Computer Society.
   Google Scholar