Exploring link covering and node covering formulations of detection layout problem

Transportation Research Record

Volumn , Issue 2308, 2012, Pages 17-26

  Barcelo J ^a   Gillieron F ^a   Linares, M ^a   Serch, O ^a   Montero, L ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ADVANCED TRAFFIC MANAGEMENT SYSTEMS; INFORMATION MANAGEMENT; INTELLIGENT SYSTEMS; TABU SEARCH; TRAFFIC CONTROL;

DATA INPUT; INFORMATION AND COMMUNICATION TECHNOLOGIES; LAYOUT PROBLEMS; ORIGIN DESTINATION MATRICES; ORIGIN-DESTINATION TRIP MATRICES; PRIMARY DATA; SIDE CONSTRAINTS; TRAFFIC BEHAVIOR; TRAFFIC MODELING; TRAFFIC-INFORMATION SYSTEMS;

COMPUTATIONAL EFFICIENCY;

EID: 84874071853     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2308-03     Document Type: Article

References (21)

1. Florian, M., and D. Hearn. Network Equilibrium Models and Algorithms. In Network Routing, Handbooks in Operations Research and Management Science, Vol. 8 (M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds.), Elsevier Science, B.V., Amsterdam, Netherlands, 1995.
2. Ben-Akiva, M., M. Bierlaire, D. Burton, H. N. Koutsopoulos, and R. Mishalani. Network State Estimation and Prediction for Real-Time Traffic Management. Networks and Spatial Economics, Vol. 1, 2001, pp. 293-318.
3. Cascetta, E. Transportation Systems Engineering: Theory and Methods Kluwer Academic Publishers, Boston, Mass 2001.
4. Van Zuylen, H. J., and L. G. Willumsen. The Most Likely Trip Matrix Estimated from Traffic Counts. Transportation Research Part B, Vol. 14, 1980, pp. 281-293.
5. Codina, E., and J. Barceló. Adjustment of O-D Matrices from Observed Volumes: An Algorithmic Approach Based on Conjugate Gradients. European Journal of Operations Research, Vol. 155, 2004, pp. 535-557.
6. Lundgren, J. T., and A. Peterson. A Heuristic for the Bilevel Origin-Destination Matrix Estimation Problem. Transportation Research Part B, Vol. 42, 2008, pp. 339-354.
7. Antoniou, C., M. Ben-Akiva, and H. N. Koutsopoulos. Nonlinear Kalman Filtering Algorithms for On-Line Calibration of Dynamic Traffic Assignment Models. IEEE Transactions on Intelligent Transportation Systems, Vol. 8, No. 4, 2007.
8. Barceló, J., L. Montero, L. Marqués, and C. Carmona. Travel Time Forecasting and Dynamic Origin-Destination Estimation for Freeways Based on Bluetooth Traffic Monitoring. In Transportation Research Record: Journal of the Transportation Research Board, No. 2175, Transportation Research Board of the National Academies, Washington, D.C., 2010, pp. 19-27.
9. Bierlaire, M. The Total Demand Scale: A New Measure of Quality for Static and Dynamic Origin-Destination Trip Tables. Transportation Research Part B, Vol. 36, 2002, pp. 837-850. (Pubitemid 34923545)
10. Castillo, E., A. J. Conejo, J. M. Menéndez, and P. Jiménez. The Observability Problem in Traffic Network Models. Computer-Aided Civil and Infrastructure Engineering, Vol. 23, 2008, pp. 208-222. (Pubitemid 351260325)
11. Yang, H., and J. Zhou. Optimal Traffic Counting Locations for Origin-Destination Matrix Estimation. Transportation Research Part B, Vol. 32B, No. 2, 1998, pp. 109-126. (Pubitemid 128714057)
12. Larsson, T., J. T. Lundgren, and A. Peterson. Allocation of Link Flow Detectors for Origin-Destination Matrix Estimation: A Comparative Study. Computer-Aided Civil and Infrastructure Engineering, Vol. 25, 2010, pp. 116-131.
13. Ehlert, A., M. G. H. Bell, and S. Grosso. The Optimisation of Traffic Count Locations in Road Networks. Transportation Research Part B, Vol. 40, 2006, pp. 460-479.
14. Fei, X., H. S. Mahmassani, and S. M. Eisenman. Sensor Coverage and Location for Real-Time Traffic Prediction in Large-Scale Networks. In Transportation Research Record: Journal of the Transportation Research Board, No. 2039, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 1-15. (Pubitemid 351532626)
15. Hoogland, J. K. The Traffic Sensor Location Problem. MS thesis. Delft University, Delft, Netherlands, 2000.
16. Bianco, L., G. Confessore, and P. Reverberi. A Network-Based Model for Traffic Sensor Location with Implications on O-D Matrix Estimates. Transportation Science, Vol. 35, 2001, pp. 50-60. (Pubitemid 32839501)
17. Larsson, T., J. T. Lundgren, M. Patriksson, and C. Rydergreen. Most Likely Equilibrium Route Flows: Analysis and Computation. Proc., TRISTAN III, 1998.
18. Dynameq 1.4. INRO Consultants, Montreal, Quebec, Canada, 2010.
19. Savelsbergh, M. W. P. Preprocessing and Probing Techniques for Mixed Integer Programming Problems. ORSA Journal on Computing, Vol. 6, 1994, pp. 445-455.
20. Hertz, A., E. D. Taillard, and D. de Werra. A Tutorial on Tabu Search. In Local Search in Combinatorial Optimization (E. Aarts and J. K. Lenstra, eds.), 1997, pp. 121-136.
21. Glover, F. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research, Vol. 13, 1986, pp. 533-549. (Pubitemid 17480188)