Application of Ant System to network design problem

Transportation

Volumn 32, Issue 3, 2005, Pages 251-273

  Poorzahedy, Hossain ^a   Abulghasemi, Farhad ^a  

^a Department of Civil Engineering ^*  (Iran)

Author keywords

Ant System; Network design

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALIBRATION; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; PROJECT MANAGEMENT;

ANT SYSTEM (AS); BUDGET; NETWORK DESIGN PROBLEM (NPD); NONCONVEXITY;

MASS TRANSPORTATION;

NETWORK DESIGN;

EID: 14044274982     PISSN: 00494488     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11116-004-8246-7     Document Type: Article

References (34)

1. M Abdulaal LJ Leblanc 1979 Continuous equilibrium network design models Transportation Research. 13B 19-32
2. DE Boyce A Farhi R Weischedel 1973 Optimal network design problem: A branch-and-bound algorithm Environment and Planning 5 519-533
3. 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.
4. M Chen A Sul Alfa 1991 A Network design algorithm using a stochstic incremental traffic assignment approach Transportation Science 25 215-224
5. A Colorni M Dorigo V Maniezzo 1991 Distributed Optimization by Ant Colonies Elsevier Publishing Paris, France 134-142 Proceedings of European Conference on Artificial Life
6. A Colorni M Dorigo V Maniezzo 1992a An Investigation of Some Properties of an "Ant Algorithm" Elsevier Publishing Brussels, Belgium 509-520 in proceedings of the Parallel Problem Solving From Nature Conference
7. A Colorni M Dorigo F Maffioli V Maniezzo G Righini M Trubian 1992b Heuristics from nature for hard combinatorial optimization problem International Transactions in Operational Research 3 1 1-21
8. GD Dantzig RP Harvey ZF Lansdowne DW Robinson SF Maier 1979 Formulating and solving the network design problem by decomposition Transportation Research 13B 5-17
9. M Dorigo G Di Caro LM Gambardella 1999 Ant algorithms for discrete optimization Artificial Life 5 3 137-172
10. M Dorigo LM Gambardella 1997 Ant colonies for the traveling salesman problem BioSystems 43 73-81
11. Dorigo M, Maniezzo V & Colorni A (1991) Positive Feedback as a Search Strategy. Report No. 91-016, Dipartimento Di Elettronica, Politecnico Di Milano.
12. M Dorigo V Maniezzo A Colorni 1996 The ant system: Optimization by a colony of cooperating agents IEEE Transactions on Systems, Man, and Cybernetics-Part B 26 1 1-13
13. AE Haghani MS Daskin 1983 Network Design Application of an Extraction Algorithm for Network Aggregation. Transportation Research Record 944 National Research Council Washington, DC
14. K Holmberg J Hellstrand 1998 Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound Operations Research 46 2 247-259
15. LJ LeBlanc 1975 An algorithm for the discrete network design problem Transportation Science 9 183-199
16. Lee CK & Yang KI (1994) Network design of one-way streets with simulated annealing. Papers in Regional Science 73(2), 119-134.
17. TL Magnanti RT Wong 1984 Network design and transportation planning: Models and algorithms Transportation Science 18 1-55
18. V Maniezzo A Colorni 1999 The Ant System applied to the quadratic assignment problem IEEE Transactions on Knowledge and Data Engineering 11 5 769-778
19. JD Murchland 1970 Braess' paradox of traffic flow Transportationn.Research 4 391-394
20. 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.
21. GC Onwubolu 2002 Emerging Optimization Techniques in Production Planning and Control Imperial College Press London
22. Poorzahedy H(1980) Efficient Algorithms for Solving the Network Design Problem. Ph.D Dissertation, Department of Civil Engineering, Northwestern University, Evanston, Ill.
23. H Poorzahedy MA Turnquist 1982 Approximate algorithms for the discrete network design problem Transportation Research 16B 45-56
24. AJ Scott 1969 The optimal network problem: Same computational procedures Transportation Research 3 201-210
25. Y Sheffi 1985 Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods Prentice-Hall Englewood Cliffs. NY, USA
26. RS Solanki JK Gorti F Southworth 1998 Using decomposition in large-scale highway network design with quasi-optimization heuristic Transportation Research-B 32 127-140
27. PA Steenbrink 1974a Transportation network optimization in the Dutch integral transportation study Transportation Research 8 11-27
28. PA Steenbrink 1974b Optimization of Transport Networks John Wiley New York
29. T Stützle T. HH Hoos 2000 Max-min Ant System Future Generation Computer System Journal 16 8 889-914
30. 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.
31. IA Wagner M Lindenbaum AM Burkstein 1998 Efficiently searching a graph by a smell-oriented vertex process Annals of Mathematics and Artificial Intelligence 24 211-223
32. Wong RT (1984) Introduction and recent advances in network design models and algorithms. In: Florian M (ed), Transportation Planning Models, Amsterdam: North-Holland.
33. H Yang MGH Bell 1998 Models and algorithms for road network design: A review and some new developments Transport Review 18 3 257-278
34. Y Yin 2000 Genetic-algorithms-based approach for bilevel programming models Journal of Transportation Engineering 26 2