Abstract
The paper proposes and applies a method for systematically sorting and reducing the number of different possible solutions to a network design problem (NDP). This is achieved first by defining a topological similarity measurement and then by applying cluster analysis. The NDP can be derived from the scientific literature. In general, the method consists of some models and subsequent algorithms that generate different solutions (enumerative, branch and bound, genetic, expert panel, ...) and evaluate for each solution an objective function (with deterministic or stochastic network assignment and with elastic or inelastic demand). The NDP, mainly in urban areas, needs multi-criteria evaluation and in each case a large set of non-dominated solutions is generated. In this paper, in order to select solutions and identify latent optimal network layouts, cluster analysis is carried out. The methodology utilises a “cluster” formation in relation to the solution topology and a “best” (representative) solutions extraction in relation to the criteria values. It can be utilised after solving the existing multi-criteria NDP and in other network problems, where the best solutions (for global or local network layouts) are extracted (with respect to the network topology) from a large set. The method is applied in a test system and on different real networks in two Italian towns, in order to analyse the goodness of the solution algorithm and assess its possible application to different networks.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
JW Billheimer P Gray (1973) ArticleTitleNetwork design with fixed and variable cost elements Transportation Science 7 49–74
DE Boyce O Ben Ayed CE Blair SuffixIII (1988) ArticleTitleA general bilevel programming formulation of the network design problem Transportation Research 22 311–318 Occurrence Handle10.1016/0191-2615(88)90006-9
GE Cantarella (1998) ArticleTitleA general fixed point approach to multi-mode multi-user equilibrium with elastic demand Transportation Science 31 107–128
Cantarella GE & Sforza A (1988) Determinazione di tariffe e frequenze per il servizio passeggeri di una rete ferroviaria. Un approccio in programmazione non lineare. Atti delle giornate AIRO, Pisa
Cantarella GE & Sforza A (1991) Road network signal setting: Equilibrium conditions. In: Papageorgiou M (ed) Concise Encyclopedia of Traffic and Transportation Systems (pp. 366–371). Pergamon Press
Cantarella GE & Vitetta A (1994) A multicriteria analysis for urban network design and parking location. Preprints of Tristan II Conference (pp. 839–852). Capri, Italy
Cascetta E (2001) Transportation System Engineering. Kluwer
A Ceder NHM Wilson (1986) ArticleTitleBus network design Transportation Research 20B 331–344
Chen M & Alfa AS (1991) A network design algorithm using a stochastic incremental traffic assignment approach. Transportation Science 25: 215–224
Z Drezner GO Wesolowsky (2003) ArticleTitleNetwork design: Selection and design of links and facility location Transportation Research 37A 241–256
Florian M & Costantin I (1993) Optimizing Frequencies in a Transit Network: a Nonlinear Bi-level Programming Approach. Publication 914 of Crt, University of Montreal
LR Foulds (1981) ArticleTitleA multi-commodity flow network design problem Transportation Research 15B 273–283
TL Friesz S Shah (2001) ArticleTitleAn overview of nontraditional formulation of static and dynamic equilibrium network design Transportation Research 35B 5–21
Goldberg DE (1989) Genetic Algorithms in Search. Optimization and Machine Learning. Addison Wesley
SR Kendall A Stuart J Ord (1983) The Advanced Theory of Statistics Charles Griffin & Company Limited London & High Wycombe
TL Magnanti RT Wong (1984) ArticleTitleNetwork design and transportation planning: Models and algorithms Transportation Science 18 1–55 Occurrence Handle10.1287/trsc.18.1.1
Q Meng H Yang MGH Bell (2001) ArticleTitleAn equivalent continuously differentiable model and a local convergent algorithm for the continuous network design problem Transportation Research 35B 83–105
Q Meng H Yang (2002) ArticleTitleBenefit distribution and equity in road network design Transportation Research 36B 19–35
H Poorzahedy MA Turnquist (1982) ArticleTitleApproximate algorithms for the discrete network design problem Transportation Research 16B 45–55
Russo F (1998) Transit frequencies design for enhancing the efficiency of public urban transportation systems: An optimization model and an algorithm. Proceedings of the 31st ISATA Stuttgart. Croydon, England: Automotive Automation Limited
Y Sheffy (1985) Urban Transportation Network. Prentice Hall Englewood Cliff
Webster FW (1958) Traffic signal settings. Road Research Technical Paper no. 39
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Russo, F., Vitetta, A. A Topological Method to Choose Optimal Solutions after Solving the Multi-criteria Urban Road Network Design Problem. Transportation 33, 347–370 (2006). https://doi.org/10.1007/s11116-005-3507-7
Issue Date:
DOI: https://doi.org/10.1007/s11116-005-3507-7