A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem

References

• Adenso-Díaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper. Res. 54:99–114.Link, Google Scholar
• Ahuja RK, Magnanti TL, Oril JB (1993) Theory, Algorithms, and Application (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Alvarez AM, Lez-Velarde JLG, De-alba K (2005) Scatter search for network design problem. Ann. Oper. Res. 138:159–178.Crossref, Google Scholar
• Atamtürk A (2001) Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29:107–114.Crossref, Google Scholar
• Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. Dell’Amico M, Maffioli F, Martello S, eds. Annotated Bibliographies in Combinatorial Optimization (John Wiley & Sons, New York), 311–329.Google Scholar
• Beasley JE (1990) OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41:1069–1072.Crossref, Google Scholar
• Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft. Comput. 11:4135–4151.Crossref, Google Scholar
• Chouman M, Crainic TG (2010) A MIP-tabu search hybrid framework for multicommodity capacitated fixed-charge network design. Technical Report CRT-2010-31, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal.Google Scholar
• Chouman M, Crainic T, Gendron B (2009) A cutting-plane algorithm for multicommodity capacitated fixed charge network design. Technical Report CIRRELT-2009-20, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal.Google Scholar
• Costa A, Cordeau J, Gendron B (2009) Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42:371–392.Crossref, Google Scholar
• Coy S, Golden B, Runger G, Wasil E (2001) Using experimental design to find effective parameter settings for heuristics. J. Heuristics 7:77–97.Crossref, Google Scholar
• Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122:272–288.Crossref, Google Scholar
• Crainic TG, Gendreau M (2002) Cooperative parallel tabu search for capacitated network design. J. Heuristics 8:601–627.Crossref, Google Scholar
• Crainic TG, Gendreau M (2007) A scatter search heuristic for the fixed-charge capacitated network design problem. Doerner KF, Gendreau M, Greistorfer P, Gutjahr W, Hartl RF, Reimann M, eds. Metaheuristics, Part I (Springer, New York), 25–40.Crossref, Google Scholar
• Crainic TG, Dejax P, Delorme L (1989) Models for multimode location problem with interdepot balancing requirement. Ann. Oper. Res. 18:277–302.Crossref, Google Scholar
• Crainic TG, Frangioni A, Gendron B (1999) Multicommodity capacitated network design. Soriano P, Sanso B, eds. Telecommunications Network Planning (Kluwer Academics Publisher, Boston), 1–19.Google Scholar
• Crainic TG, Frangioni A, Gendron B (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112:73–99.Crossref, Google Scholar
• Crainic TG, Gendreau M, Farvolden JM (2000) A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12:223–236.Link, Google Scholar
• Crainic TG, Gendron B, Hernu G (2004) A slope scaling/lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10:525–545.Crossref, Google Scholar
• Crainic TG, Li Y, Toulouse M (2006) A first multilevel cooperative algorithm for capacitated multicommodity network design. Comput. Oper. Res. 33:2602–2622.Crossref, Google Scholar
• Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighbourhoods to improve MIP solutions. Math. Program. 102:71–90.Crossref, Google Scholar
• Fığlalı N, Özkale C, Engin O, Fığlalı A (2009) Investigation of ant system parameter interactions by using design of experiments for job shop scheduling problems. Comput. Indust. Engrg. 56:538–559.Crossref, Google Scholar
• Fischetti M, Lodi A (2003) Local branching. Math. Program. 98:23–47.Crossref, Google Scholar
• Frangioni A, Gendron B (2008) 0-1 reformulation of the multicommodity capacitated network design problem. Discrete Appl. Math. 157:1229–1241.Crossref, Google Scholar
• Freund JE (1992) Mathematical Statistics, 5th ed. (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Gendron B, Crainic TG (1994) Relaxations for multicommodity capacitated network design problems. Technical Report CRT-945, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal.Google Scholar
• Gendron B, Crainic TG (1996) Bounding procedures for multicommodity capacitated fixed charge network design problem. Technical Report CRT-96-06, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal.Google Scholar
• Gendron B, Crainic TG, Frangioni A (1998) Multicommodity capacitated network design. Sanso B, Soriono P, eds. Telecommunication Network Planning (Kluwer, Norwell, MA), 1–19.Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M (2003) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51:655–667.Link, Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M (2004) Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131:109–133.Crossref, Google Scholar
• Glover F (1989) Tabu search—Part I. ORSA J. Comput. 1(3):190–206.Link, Google Scholar
• Glover F (1990) Tabu search—Part II. ORSA J. Comput. 2(1):4–32.Link, Google Scholar
• Glover F, Kochenberger GA (2003) Handbook of Metaheuristics (Kluwer, Norwell, MA).Crossref, Google Scholar
• Glover F, Laguna M (1997) Tabu Search (Kluwer, Norwell, MA).Crossref, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (1999) Lifted cover inequalities for 0-1 integer programs: Complexity. INFORMS J. Comput. 11:117–123.Link, Google Scholar
• Hewitt M, Nemhauser GL, Savelsbergh MWP (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22:314–325.Link, Google Scholar
• Holmberg K, Yuan D (2000) A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48:461–481.Link, Google Scholar
• Jayaraman V, Ross A (2002) A simulated annealing methodology to distribution network design and management. Eur. J. Oper. Res. 144:629–645.Crossref, Google Scholar
• Katayama N (2011) Capacitated Network Design Problem: Upper Bounds and Gaps, Results for C Instances. Accessed April 16, 2012, http://www.rku.ac.jp/~katayama/CND_UB_C.html.Google Scholar
• Katayama N, Yurimoto S (2011) Combining capacity scaling and local branch approaches for the logistics network design problem. Proc. 21st Internat. Conf. Production Res., ICPR 2011, Stuttgart, Germany.Google Scholar
• Katayama N, Chen M, Kubo M (2009) A capacity scaling heuristic for the multicommodity capacitated network design problem. J. Comput. Appl. Math. 232:90–101.Crossref, Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18:1–55.Link, Google Scholar
• Minoux M (1989) Networks synthesis and optimum network design problems: Models, solution methods and applications. Networks 19:313–360.Crossref, Google Scholar
• Minoux M (2001) Discrete cost multicommodity network optimization problems and exact solution methods. Ann. Oper. Res. 106:19–46.Crossref, Google Scholar
• Minoux M (2004) Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. Discrete Appl. Math. 144:158–172.Crossref, Google Scholar
• Montgomery DC (2009) Design and Analysis of Experiments, 7th ed. (John Wiley & Sons, New York).Google Scholar
• Montgomery DC, Runger G (2006) Applied Statistics and Probability for Engineering, 3rd ed. (John Wiley & Sons, New York).Google Scholar
• Padberg MW, Van Roy TJ, Wolsey LA (1985) Valid linear inequalities for fixed charge problems. Oper. Res. 33:842–861.Link, Google Scholar
• Ridge E, Kudenko D (2007) Tuning the performance of the MMAS heuristic. Stützle T, Birattari M, Hoos HH, eds. International Workshop on Engineering Stochastic Local Search Algorithms (Springer-Verlag, Berlin), 46–60.Crossref, Google Scholar
• Ridge E, Kudenko D (2010) Tuning an algorithm using design of experiments. Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M, eds. Experimental Methods for the Analysis of Optimization Algorithms (Springer, Berlin), 265–286.Crossref, Google Scholar
• Rodríguez-Martín I, Salazar-González J (2010) A local branching heuristic for the capacitated fixed-charge network design problem. Comput. Oper. Res. 37:575–581.Crossref, Google Scholar
• Sellmann M, Kliewer G, Koberstein A (2002) Capacitated network design, cardinality cuts and coupled variable fixing algorithms based on Lagrangian relaxations. Technical Report (tr-ri-02-234), Department of Computer Science, University of Paderborn, Paderborn, Germany.Google Scholar
• Stallaert JIA (1997) The complementary class of generalized flow cover inequalities. Discrete Appl. Math. 77:73–80.Crossref, Google Scholar
• Talbi EG (2009) Metaheuristics: From Design to Implementation (John Wiley & Sons, New York).Crossref, Google Scholar
• Van Roy TJ, Wolsey LA (1987) Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35:45–57.Link, Google Scholar
• Yaghini M, Karimi M, Rahbar M (2013) A hybrid metaheuristic approach for the capacitated p-median problem. Appl. Soft. Comput. 13:3922–3930.Crossref, 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. Internat. J. Appl. Meta. Comput. 2:13–28.Google Scholar