A BI-OBJECTIVE TRAFFIC COUNTING LOCATION PROBLEM FOR ORIGIN-DESTINATION TRIP TABLE ESTIMATION

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.

[1]  Martin L. Hazelton,et al.  Estimation of origin-destination matrices from link flows on uncongested networks , 2000 .

[2]  C. S. Fisk,et al.  ON COMBINING MAXIMUM ENTROPY TRIP MATRIX ESTIMATION WITH USER OPTIMAL ASSIGNMENT , 1988 .

[3]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[4]  Henk J van Zuylen,et al.  The most likely trip matrix estimated from traffic counts , 1980 .

[5]  Michael G.H. Bell,et al.  A Log-Linear Model for Path Flow Estimation , 1996 .

[6]  Hai Yang,et al.  Estimation of origin-destination matrices from link traffic counts on congested networks , 1992 .

[7]  M. G. H. Bell.  THE ESTIMATION OF JUNCTION TURNING VOLUMES FROM TRAFFIC COUNTS: THE ROLE OF PRIOR INFORMATION , 1984 .

[8]  Kalidas Ashok,et al.  DYNAMIC ORIGIN-DESTINATION MATRIX ESTIMATION AND PREDICTION FOR REAL- TIME TRAFFIC MANAGEMENT SYSTEMS , 1993 .

[9]  Mitsuo Gen,et al.  Genetic Algorithms & Engineering Optimization , 2000 .

[10]  A. Charnes,et al.  Management Models and Industrial Applications of Linear Programming , 1961 .

[11]  C. A. Coello Coello,et al.  A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques , 1999, Knowledge and Information Systems.

[12]  R. Sivanandan,et al.  A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes , 1994 .

[13]  Michael J. Maher,et al.  A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows , 2001 .

[14]  M. Maher.  INFERENCES ON TRIP MATRICES FROM OBSERVATIONS ON LINK VOLUMES: A BAYESIAN STATISTICAL APPROACH , 1983 .

[15]  Anthony Chen,et al.  An evolutionary approach for finding optimal automatic vehicle identification reader locations in transportation networks , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[16]  Hai Yang,et al.  An analysis of the reliability of an origin-destination trip matrix estimated from traffic counts , 1991 .

[17]  E. Cascetta.  Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator , 1984 .

[18]  H. Spiess.  A MAXIMUM LIKELIHOOD MODEL FOR ESTIMATING ORIGIN-DESTINATION MATRICES , 1987 .

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Hai Yang,et al.  Optimal traffic counting locations for origin–destination matrix estimation , 1998 .

[21]  A. Osyczka,et al.  A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm , 1995 .

[22]  Hai Yang,et al.  Determing Cordons and Screen Lines for Origin-destination Trip Studies , 2001 .

[23]  W. H. K. Lam,et al.  Accuracy of O-D estimates from traffic counts , 1990 .