Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 33, Issue 3, Pages 836-858Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2004.08.011
Keywords
integer linear programming; transportation network; column generation; location theory; traffic survey
Ask authors/readers for more resources
We consider an overlooked, but important, practical problem about the optimal selection of cordon-screen lines for traffic census study in road networks. The problem can be stated as: (1) how to select the optimal locations of a given number of counting stations to separate as many origin-destination (O-D) pairs as possible, (2) how to determine the minimum number of counting stations and their locations required for separating all O-D pairs. Here, an O-D pair is said to be separated if trips between this O-D pair are entirely intercepted by the current traffic-counting stations. The problems of interest are formulated as integer linear-programming models. After exploring the relaxed linear-programming problems and their dual problems, a solution scheme that combines a shortest path-based column generation procedure and a branch-and-bound technique is developed to find an optimal counting location solution. The proposed models and algorithms are illustrated with numerical examples and compared with the genetic algorithm. (c) 2004 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available