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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
