ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND problem. In the proposed neighborhoods, first, an open arc based on the incumbent solution is closed; then, by using an ant colony optimization algorithm called Ant Colony System (ACS), a new solution is generated by constructing new paths for the demands delivered on the closed arc. An algorithm is presented to construct new paths by using ACS algorithm for demands with continuous volume. A sub mixed integer programming (MIP) model is then created by joining the ACS and incumbent solutions. The generated sub-MIP is solved by using an MIP solver and its solution is considered as a neighborhood. In order to evaluate the proposed neighborhoods, an algorithm is developed. The algorithm parameters are tuned by using design of experiments. To assess the algorithm, several benchmark problems with different sizes are used. The statistical analysis shows the efficiency and effectiveness of the proposed algorithm compared to the best approaches found in the literature.

[1]  Yao Liang,et al.  Fixed-charge network design and protection problems , 2006 .

[2]  Teodor Gabriel Crainic,et al.  A first multilevel cooperative algorithm for capacitated multicommodity network design , 2006, Comput. Oper. Res..

[3]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[4]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[5]  Teodor Gabriel Crainic,et al.  RELAXATIONS FOR MULTICOMMODITY CAPACITATED NETWORK DESIGN PROBLEMS. , 1994 .

[6]  Inmaculada Rodríguez Martín,et al.  A local branching heuristic for the capacitated fixed-charge network design problem , 2010, Comput. Oper. Res..

[7]  Michel Gendreau,et al.  Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design , 2004, Ann. Oper. Res..

[8]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[9]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[10]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[11]  Teodor Gabriel Crainic,et al.  BOUNDING PROCEDURES FOR MULTICOMMODITY CAPACITATED FIXED CHARGE NETWORK DESIGN PROBLEMS. , 1995 .

[12]  Michel Gendreau,et al.  A Simplex-Based Tabu Search Method for Capacitated Network Design , 2000, INFORMS J. Comput..

[13]  Masoud Yaghini,et al.  Solving train formation problem using simulated annealing algorithm in a simplex framework , 2014 .

[14]  Document DE Synthèse.  CENTRE DE RECHERCHE SUR LES TRANSPORTS , 2003 .

[15]  Masoud Yaghini,et al.  A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design , 2012, Appl. Soft Comput..

[16]  R. F.,et al.  Mathematical Statistics , 1944, Nature.

[17]  Masoud Yaghini,et al.  An improved local branching approach for train formation planning , 2013 .

[18]  Masoud Yaghini,et al.  A hybrid simulated annealing and column generation approach for capacitated multicommodity network design , 2013, J. Oper. Res. Soc..

[19]  K. Fernow.  New York , 1896, American Potato Journal.

[20]  George C. Runger,et al.  Using Experimental Design to Find Effective Parameter Settings for Heuristics , 2001, J. Heuristics.

[21]  Daniel Kudenko,et al.  Tuning an Algorithm Using Design of Experiments , 2010, Experimental Methods for the Analysis of Optimization Algorithms.

[22]  Mervat Chouman,et al.  A Cutting-Plane Algorithm for Multicommodity Capacitated Fixed-Charge Network Design , 2009 .

[23]  Michel Gendreau,et al.  Cooperative Parallel Tabu Search for Capacitated Network Design , 2002, J. Heuristics.

[24]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[25]  Federico Malucelli,et al.  Multicommodity network design with discrete node costs , 2007 .

[26]  Masoud Yaghini,et al.  A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design , 2011, Int. J. Appl. Metaheuristic Comput..

[27]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[28]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[29]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[30]  Teodor Gabriel Crainic,et al.  A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design , 2004, J. Heuristics.

[31]  M. Dorigo,et al.  Aco Algorithms for the Traveling Salesman Problem , 1999 .

[32]  Masoud Yaghini,et al.  Tabu Search Algorithm for the Railroad Blocking Problem , 2013 .

[33]  Masoud Yaghini,et al.  Archive of SID A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design , 2012 .

[34]  Masoud Yaghini,et al.  Multicommodity Network Design Problem in Rail Freight Transportation Planning , 2012 .

[35]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..