Application of Ant System to network design problem

Network design problem (NDP) is the problem of choosing from among a set of alternative projects which optimizes an objective (e.g., minimizes total travel time), while keeping consumption of resources (e.g., budget) within their limits. This problem is difficult to solve, because of its combinatorial nature and nonconvexity of the objective function. Many algorithms are presented to solve the problem more efficiently, while trading-off accuracy with computational speed. This increase in speed stems from certain approximations in the formulation of the problem, decomposition, or heuristics. This study adapts a meta – heuristic approach to solve NDP, namely Ant System (AS). The algorithm is first designed, and then calibrated to solve NDP for the Sioux Falls test network. The behavior of the algorithm is then investigated. The result seems encouraging.

[1]  Yu-Po Chan.  SEARCH AND CHOICE IN TRANSPORT SYSTEMS PLANNING. VOLUME XX. OPTIMAL TRAVEL TIME REDUCTION IN A TRANSPORT NETWORK: AN APPLICATION OF NETWORK AGGREGATION AND BRANCH AND BOUND TECHNIQUES. , 1969 .

[2]  A. Scott.  The optimal network problem: Some computational procedures , 1969 .

[3]  J. D. Murchland,et al.  Braess's paradox of traffic flow , 1970 .

[4]  R. Weischedel,et al.  Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .

[5]  Peter A. Steenbrink,et al.  Optimization of Transport Networks , 1974 .

[6]  Peter A. Steenbrink,et al.  Transport network optimization in the Dutch integral transportation study , 1974 .

[7]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[8]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[9]  George B. Dantzig,et al.  Formulating and solving the network design problem by decomposition , 1979 .

[10]  Hossain Poorzahedy.  Efficient algorithms for solving the network design problem , 1980 .

[11]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[12]  Mark S. Daskin,et al.  NETWORK DESIGN APPLICATION OF AN EXTRACTION ALGORITHM FOR NETWORK AGGREGATION. , 1983 .

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

[14]  R T Wong.  INTRODUCTION AND RECENT ADVANCES IN NETWORK DESIGN: MODELS AND ALGORITHMS , 1984 .

[15]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[16]  Attahiru Sule Alfa,et al.  A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach , 1991, Transp. Sci..

[17]  Guy Theraulaz,et al.  Task differentiation in Polistes wasp colonies: a model for self-organizing groups of robots , 1991 .

[18]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[19]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[20]  Giovanni Righini,et al.  Heuristics from Nature for Hard Combinatorial Optimization Problems , 1996 .

[21]  Gian Luca Foresti,et al.  A distributed probabilistic system for adaptive regulation of image processing parameters , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[22]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[23]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[24]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[25]  Rajendra S. Solanki,et al.  Using decomposition in large-scale highway network design with a quasi-optimization heuristic , 1998 .

[26]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[27]  E. D. Taillard,et al.  Ant Systems , 1999 .

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

[29]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[30]  Yafeng Yin,et al.  Genetic-Algorithms-Based Approach for Bilevel Programming Models , 2000 .

[31]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[32]  Godfrey C. Onwubolu,et al.  Emerging optimization techniques in production planning and control , 2002 .

[33]  Godfrey C. Onwubolu.  Emerging Optimization Techniques , 2002 .

[34]  Israel A. Wagner,et al.  Efficiently searching a graph by a smell-oriented vertex process , 2004, Annals of Mathematics and Artificial Intelligence.

[35]  Chi-Kang Lee,et al.  NETWORK DESIGN OF ONE‐WAY STREETS WITH SIMULATED ANNEALING , 2005 .