Professional Documents
Culture Documents
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 74
Abstract— Constraint Satisfaction represents a great modeling formalism for complex problems in the areas of Artificial
Intelligence and Computer science. A constraint satisfaction problem (CSP) is defined by a set of variables and a set of
constraints which translate all the rules and obligations having to be satisfied by the solutions, each variable has a well defined
domain area. CSP has several applications in many real life fields. Therefore, researchers have worked on CSP and have
developed several solving algorithms and have enlarged the scope of application of CSP formalism. Among the interesting
areas of application of CSP, figure transport and scheduling problems. In this article, we addressed the problem of resources
scheduling in a transport context, which consists in optimal resource assigning in order to accomplish transport duties, called
also tour services. Resources are Transport equipments, Drivers and Time. We have modeled this problem as a CSP, and then
we have implemented a resolving web based system with two algorithms: Generate & Test and Backtracking. Our work has
been strongly appreciated by domain experts.
Index Terms — Computational intelligence, Constraint Satisfaction Problems, Transport problems, Intelligent Scheduling,
algorithms
—————————— ——————————
1 INTRODUCTION
Authors:
3 CONCLUSION
In this paper, we reported our work in the context of re-
sources scheduling in a transport problem. We have
modeled our problem as a Constraint Satisfaction Prob-
lem. Then, we have implemented two algorithms for ge-
nerating solutions: Test & generate and backtracking.
Real experiments of our system have generated adequate
solutions with high accuracy and without any conflicts
between resources allocations. For presentation reasons,
we have developed a web-based component oriented to
end users and domain experts in order to setting up pa-
rameters, executing algorithms and deploying results. In
order to improve our work, we are actually working on
dealing with more complex problems in terms of va-
riables and constraints. We plan also to apply heuristics
and incomplete methods for resolving the transport sche-
duling problem.
REFERENCES
[1] V., Kumar, “Algorithms for constraint-satisfaction problems: A
survey”, AI Magazine, Vol. 13, pp. 32-44, 1992.
[2] F., Benhamou, N., Jussien, B., O'Sullivan, “Trends in Constraint
Programming”, ISTE Publishing Company, 2007.
[3] B., Spell, “Pro Java Programming", Second edition, APress edi-
tion, 2005.
[4] B. Dudney, J., Lehr, B., Willis, L. Mattingly, "Mastering Java
Server Faces", Wiley Press Edition, 2004.
[5] E., Armstrong, J., Ball, S., Bodoff, D. B., Carson, I., Evans, D.,
Green, K., Haase, E., Jendrock, "The J2EE Tutorial", Sun Micro-
systems, 2005
[6] O., Goldreich, “Computational Complexity", Cambridge Uni-
versity Press, 2008.