期刊
TRANSPORTMETRICA
卷 1, 期 1, 页码 65-80出版社
TAYLOR & FRANCIS INC
DOI: 10.1080/18128600508685639
关键词
traffic counting location; O-D trip table estimation; multiobjective optimization; genetic algorithm
In this study, we consider the bi-objective traffic counting location problem for the purpose of origin-destination (O-D) trip table estimation. The problem is to determine the number and locations of counting stations that would best cover the network. The maximal coverage and minimal resource utilization criteria, which are generally conflicting, are simultaneously considered in a multi-objective manner to reveal the tradeoff between the quality and cost of coverage. A distance-based genetic algorithm (GA) is used to solve the proposed bi-objective traffic counting location problem by explicitly generating the non-dominated solutions. Numerical results are provided to demonstrate the feasibility of the proposed model. The primary results indicate that the distance-based GA can produce the set of non-dominated solutions from which the decision makers can examine the tradeoff between the quality and cost of coverage and make a proper selection without the need to repeatedly solve the maximal covering problem with different levels of resource.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据