Abstract
We present an application of Constraint Logic Programming (CLP) for finding the minimum number and location of count-posts at urban roundabouts so as to obtain origin-destination data at minimum cost. By finding nice mathematical properties, we were able to model this problem as a constraint satisfaction problem in finite domains, and use CLP(FD) systems to solve it, with almost no implementation effort and very quickly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrade M.: Métodos e Técnicas de Recolha de Dados de Tráfego — Algoritmo para a Definição da Matriz Origem-Destino. Msc. Thesis, Faculty of Engineering, University of Porto, Portugal, 2000.
Carlsson M., Ottosson G., Carlson B.: An Open-Ended Finite Domain Constraint Solver. In Proceedings of PLILP’97, LNCS 1292, 191–206, Springer-Verlag, 1997.
Bianco L., Confessore G., and Reverberi P.: A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates. J. Transportation Science, 35(1), 50–60, 2001.
Cook W., Cunningham W., Pulleyblank W., and Schrijver A.: Combinatorial Optimization. John Wiley & Sons, 1998, Chapter 8.
Cormen H., Leiserson C., Rivest R.: Introduction to Algorithms, MIT Press, 1990.
Freuder E.: In Pursuit of the Holy Grail, Constraints, 2(1), 57–62, 1997.
Hadley G.: Linear Programming. Addison-Wesley, 1969.
Hillier S. H., Lieberman G. J.: Introduction to Operations Research. McGraw-Hill, 6th Ed, 1995.
Marriott K., and Stuckey P.: Programming with Constraints — An Introduction, The MIT Press, 1998.
Mansfield L. E.: Linear Algebra with Geometric Applications, Marcel Dekker, 1976.
Yang H., and Zhou J.: Optimal Traffic Counting Locations for Origin-Destination Matrix Estimation. J. Transportation Research, 32B(2), 109–126, 1998.
Tomás A. P., Andrade M., and Pires da Costa A.: Obtaining OD Data at Optimal Cost at Urban Roundabouts, Internal Report DCC-2-2001, DCC-FC & LIACC, University of Porto, 2001. http://www.ncc.up.pt/fcup/DCC/Pubs/treports.html. Presented at CSOR’01 Workshop (part of EPIA’01), Porto, December 2001.
Tomás A. P.: A Note on Sensor Location for Traffic Counting at Roundabouts — Solutions for a Particular Cost Function, Internal Report DCC-3-2001, DCC-FC & LIACC, University of Porto, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tomás, A.P. (2002). Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD). In: Coello Coello, C.A., de Albornoz, A., Sucar, L.E., Battistutti, O.C. (eds) MICAI 2002: Advances in Artificial Intelligence. MICAI 2002. Lecture Notes in Computer Science(), vol 2313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46016-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-46016-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43475-7
Online ISBN: 978-3-540-46016-9
eBook Packages: Springer Book Archive