A BI-OBJECTIVE TRAFFIC COUNTING LOCATION PROBLEM FOR ORIGIN-DESTINATION TRIP TABLE ESTIMATION
- 1 January 2005
- journal article
- research article
- Published by Taylor & Francis in Transportmetrica
- Vol. 1 (1), 65-80
- https://doi.org/10.1080/18128600508685639
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flowsTransportation Research Part B: Methodological, 2001
- Estimation of origin–destination matrices from link flows on uncongested networksTransportation Research Part B: Methodological, 2000
- A new method to solve generalized multicriteria optimization problems using the simple genetic algorithmStructural and Multidisciplinary Optimization, 1995
- Network and Discrete LocationPublished by Wiley ,1995
- A linear programming approach for synthesizing origin-destination trip tables from link traffic volumesTransportation Research Part B: Methodological, 1994
- On combining maximum entropy trip matrix estimation with user optimal assignmentTransportation Research Part B: Methodological, 1988
- A maximum likelihood model for estimating origin-destination matricesTransportation Research Part B: Methodological, 1987
- Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimatorTransportation Research Part B: Methodological, 1984
- Inferences on trip matrices from observations on link volumes: A Bayesian statistical approachTransportation Research Part B: Methodological, 1983
- The most likely trip matrix estimated from traffic countsTransportation Research Part B: Methodological, 1980