Application of Ant System to network design problem
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
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.
- Abdulaal, M, Leblanc, LJ (1979) Continuous equilibrium network design models. Transportation Research. 13B: pp. 19-32
- Boyce, DE, Farhi, A, Weischedel, R (1973) Optimal network design problem: a branch-and-bound algorithm. Environment and Planning 5: pp. 519-533
- Chan Y (1964) Optimal travel Time Reduction in a Transport Network: An Application of Network Aggregation and Branch-and-Bound Techniques. Search and Choice in Transport System Planning, Vol. XX, MIT Research Report R 69–39.
- Chen, M, Sul Alfa, A (1991) A Network design algorithm using a stochstic incremental traffic assignment approach. Transportation Science 25: pp. 215-224
- Colorni, A, Dorigo, M, Maniezzo, V (1991) Distributed Optimization by Ant Colonies. Elsevier Publishing, Paris, France
- Colorni, A, Dorigo, M, Maniezzo, V (1992a) An Investigation of Some Properties of an “Ant Algorithm”. Elsevier Publishing, Brussels, Belgium
- Colorni, A, Dorigo, M, Maffioli, F, Maniezzo, V, Righini, G, Trubian, M (1992b) Heuristics from nature for hard combinatorial optimization problem. International Transactions in Operational Research 3: pp. 1-21
- Dantzig, GD, Harvey, RP, Lansdowne, ZF, Robinson, DW, Maier, SF (1979) Formulating and solving the network design problem by decomposition. Transportation Research 13B: pp. 5-17
- Dorigo, M, Di Caro, G, Gambardella, LM (1999) Ant algorithms for discrete optimization. Artificial Life 5: pp. 137-172
- Dorigo, M, Gambardella, LM (1997) Ant colonies for the traveling salesman problem. BioSystems 43: pp. 73-81
- Dorigo M, Maniezzo V & Colorni A (1991) Positive Feedback as a Search Strategy. Report No. 91-016, Dipartimento Di Elettronica, Politecnico Di Milano.
- Dorigo, M, Maniezzo, V, Colorni, A (1996) The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26: pp. 1-13
- Haghani, AE, Daskin, MS (1983) Network Design Application of an Extraction Algorithm for Network Aggregation. Transportation Research Record 944. National Research Council, Washington, DC
- Holmberg, K, Hellstrand, J (1998) Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Operations Research 46: pp. 247-259
- LeBlanc, LJ (1975) An algorithm for the discrete network design problem. Transportation Science 9: pp. 183-199
- Lee CK & Yang KI (1994) Network design of one-way streets with simulated annealing. Papers in Regional Science 73(2), 119–134.
- Magnanti, TL, Wong, RT (1984) Network design and transportation planning: Models and algorithms. Transportation Science 18: pp. 1-55
- Maniezzo, V, Colorni, A (1999) The Ant System applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering 11: pp. 769-778
- Murchland, JD (1970) Braess’ paradox of traffic flow. Transportationn.Research 4: pp. 391-394
- Ochoa -Rosso F & Silva A (1968) Optimum Project Addition in Urban Transportation Networks via Descriptive Assignment Models. Research Report R 68–44, Department of CE, MIT, Cambridge,Mass.
- Onwubolu, GC (2002) Emerging Optimization Techniques in Production Planning and Control. Imperial College Press, London
- Poorzahedy H(1980) Efficient Algorithms for Solving the Network Design Problem. Ph.D Dissertation, Department of Civil Engineering, Northwestern University, Evanston, Ill.
- Poorzahedy, H, Turnquist, MA (1982) Approximate algorithms for the discrete network design problem. Transportation Research 16B: pp. 45-56
- Scott, AJ (1969) The optimal network problem: Same computational procedures. Transportation Research 3: pp. 201-210
- Sheffi, Y (1985) Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs. NY, USA
- Solanki, RS, Gorti, JK, Southworth, F (1998) Using decomposition in large-scale highway network design with quasi-optimization heuristic. Transportation Research-B 32: pp. 127-140
- Steenbrink, PA (1974a) Transportation network optimization in the Dutch integral transportation study. Transportation Research 8: pp. 11-27
- Steenbrink, PA eds. (1974b) Optimization of Transport Networks. John Wiley, New York
- Stützle, T, Hoos, HH (2000) Max-min Ant System. Future Generation Computer System Journal 16: pp. 889-914
- Theraulaz G, Goss S, Gervet J & Deneuborrg JL (1991) Task differentiation in polistes wasp colonies: A model for self-organizing groups of robots. In Simulation of Adaptive Behaviour: From Animals to Animates. (pp. 346–355), Cambridge, Mass: MIT Press, Bradford Books.
- Wagner, IA, Lindenbaum, M, Burkstein, AM (1998) Efficiently searching a graph by a smell-oriented vertex process. Annals of Mathematics and Artificial Intelligence 24: pp. 211-223
- Wong RT (1984) Introduction and recent advances in network design models and algorithms. In: Florian M (ed), Transportation Planning Models, Amsterdam: North-Holland.
- Yang, H, Bell, MGH (1998) Models and algorithms for road network design: A review and some new developments. Transport Review 18: pp. 257-278
- Yin, Y (2000) Genetic-algorithms-based approach for bilevel programming models. Journal of Transportation Engineering 26: pp. 2-2
- Application of Ant System to network design problem
Volume 32, Issue 3 , pp 251-273
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Ant System
- network design
- Industry Sectors