A simulation-based multi-objective genetic algorithm (SMOGA) procedure for BOT network design problem

被引:69
作者
Chen, Anthony [1 ]
Subprasom, Kitti
Ji, Zhaowang
机构
[1] Utah State Univ, Dept Civil & Environm Engn, Logan, UT 84322 USA
[2] Dept Highways, Planning Div, Bangkok 10400, Thailand
关键词
Network design problem; Multiple objectives; Demand uncertainty; Simulation; Genetic algorithm;
D O I
10.1007/s11081-006-9970-y
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Solving optimization problems with multiple objectives under uncertainty is generally a very difficult task. Evolutionary algorithms, particularly genetic algorithms, have shown to be effective in solving this type of complex problems. In this paper, we develop a simulation-based multi-objective genetic algorithm (SMOGA) procedure to solve the build-operate-transfer (BOT) network design problem with multiple objectives under demand uncertainty. The SMOGA procedure integrates stochastic simulation, a traffic assignment algorithm, a distance-based method, and a genetic algorithm (GA) to solve a multi-objective BOT network design problem formulated as a stochastic bi-level mathematical program. To demonstrate the feasibility of SMOGA procedure, we solve two mean-variance models for determining the optimal toll and capacity in a BOT roadway project subject to demand uncertainty. Using the inter-city expressway in the Pearl River Delta Region of South China as a case study, numerical results show that the SMOGA procedure is robust in generating 'good' non-dominated solutions with respect to a number of parameters used in the GA, and performs better than the weighted-sum method in terms of the quality of non-dominated solutions.
引用
收藏
页码:225 / 247
页数:23
相关论文
共 28 条
[1]  
[Anonymous], P 9 INT S TRANSP TRA
[2]   Multiobjective urban planning using genetic algorithm [J].
Balling, RJ ;
Taber, JT ;
Brown, MR ;
Day, K .
JOURNAL OF URBAN PLANNING AND DEVELOPMENT-ASCE, 1999, 125 (02) :86-99
[3]   ROAD-MAINTENANCE PLANNING USING GENETIC ALGORITHMS .1. FORMULATION [J].
CHAN, WT ;
FWA, TF ;
TAN, CY .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1994, 120 (05) :693-709
[4]   Mean-variance model for the build-operate-transfer scheme under demand uncertainty [J].
Chen, A ;
Subprasom, K ;
Ji, ZW .
TRANSPORTATION NETWORK MODELING 2003: PLANNNING AND ADMINISTRATION, 2003, (1857) :93-101
[5]  
Chen A, 2001, TRANSPORT RES REC, P124
[6]  
COELLOC CA, 2002, EVOLUTIONARY ALGORIT
[7]  
Cree ND, 1998, TRANSPORTATION NETWORKS: RECENT METHODOLOGICAL ADVANCES, P163
[8]  
Daskin M. S., 1995, NETWORK DISCRETE LOC
[9]  
DEB K, 2001, MULTIOJBECTIVE OPTIM
[10]   A SIMULATED ANNEALING APPROACH TO THE NETWORK DESIGN PROBLEM WITH VARIATIONAL INEQUALITY CONSTRAINTS [J].
FRIESZ, TL ;
CHO, HJ ;
MEHTA, NJ ;
TOBIN, RL ;
ANANDALINGAM, G .
TRANSPORTATION SCIENCE, 1992, 26 (01) :18-26