Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD)

Authors:
Ana Paula Tomás
Affiliations:
-
Venue:
MICAI '02 Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2002

Citing 5
Cited 0

Introduction to algorithms

Introduction to algorithms
Combinatorial optimization

Combinatorial optimization
In Pursuit of the Holy Grail

Constraints
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.