CONTINUOUS EQUILIBRIUM NETWORK DESIGN PROBLEM WITH ELASTIC DEMAND: DERIVATIVE-FREE SOLUTION METHODS

Three representative algorithms, namely the Hooke-Jeeves method, the equilibrium decomposed optimization heuristic and simulated annealing, which have been applied to the equilibrium network design problem (ENDP) with fixed demand, are compared by numerical examples. The comparison is extended to cover the ENDP with elastic demand. A bi-level formulation of the ENDP with elastic demand is presented and validated. Experiments on simple and complex networks reveal some interesting and important phenomena, for instance, these three algorithms can give very different results when different values of the algorithm's parameters are used. The simulated annealing approach can always obtain the best solution while its computation time requirement is the most too. The equilibrium decomposed optimization heuristic is the most computationally efficient, but the solutions it yields are not quite as good as those given by the Hooke-Jeeves method, in most cases. A warning and suggestions are given in the last section.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/008043052X
• Corporate Authors:

  Elsevier

  The Boulevard, Langford Lane
  Kidlington, Oxford  United Kingdom  OX5 1GB
• Authors:
  • Huang, H-J
  • Bell, MGH
• Conference:
  • Transportation Networks: Recent Methodological Advances. Selected Proceedings of the 4th EURO Transportation Meeting
  • Location: Newcastle, England
  • Date: 1996-9-9 to 1996-9-11
• Publication Date: 1999-1

Language

• English

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 175-193

Subject/Index Terms

• TRT Terms: Algorithms; Annealing; Equilibrium (Systems); Heuristic methods; Networks
• Subject Areas: Highways; Operations and Traffic Management; I71: Traffic Theory;

Filing Info

• Accession Number: 00769248
• Record Type: Publication
• ISBN: 008043052X
• Files: TRIS
• Created Date: Sep 8 1999 12:00AM