Abstract
Managing numeric and symbolic temporal information is very relevant for a wide variety of applications including scheduling, planning, temporal databases, manufacturing and natural language processing. Often these applications are represented and managed with the well known constraint-based formalism called the Constraint Satisfaction Problem (CSP). We then talk about temporal CSPs where constraints represent qualitative or quantitative temporal information. Like CSPs, temporal CSPs are NP-hard problems and are traditionally solved with a backtrack search algorithm together with constraint propagation techniques. This method has however some limitations especially for large size problems. In order to overcome this difficulty in practice, we investigate the possibility of solving these problems using Genetic Algorithms (GAs). We propose a novel crossover specifically designed for solving TCSPs using GAs. In order to assess the performance of our proposed crossover over the well known heuristic based GAs, we conducted several experiments on randomly generated temporal CSP instances. In addition, we evaluated the performance of an integration of our crossover within a Parallel GA (PGA) approach. The test results clearly show that the proposed crossover outperforms the known GA methods for all the tests in terms of success rate and time needed to reach the solution. Moreover, when integrated within the PGA, our crossover is very efficient for solving very large size hard temporal CSPs.
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
Abbasian, R., Mouhoub, M.: An efficient hierarchical parallel genetic algorithm for graph coloring problem. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO, pp. 521–528. ACM (2011)
Allen, J.: Maintaining knowledge about temporal intervals. CACM 26(11), 832–843 (1983)
Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence 49, 61–95 (1991)
Eiben, A.E., van der Hauw, J.K., van Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. J. Heuristics 4(1), 25–46 (1998)
Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Flaws and structure (1998)
Haralick, R., Elliott, G.: Increasing tree search efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–313 (1980)
van der Hauw, J.: Evaluating and improving steady state evolutionary algorithms on constraint satisfaction problems (1996), citeseer.ist.psu.edu/vanderhauw96evaluating.html
Jashmi, B.J., Mouhoub, M.: Solving temporal constraint satisfaction problems with heuristic based evolutionary algorithms. In: Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence, vol. 2, pp. 525–529. IEEE Computer Society, Washington, DC (2008)
Lim, D., Ong, Y.S., Jin, Y., Sendhoff, B., Lee, B.S.: Efficient hierarchical parallel genetic algorithms using grid computing. Future Gener. Comput. Syst. 23(4), 658–670 (2007)
Mackworth, A.K., Freuder, E.: The complexity of some polynomial network-consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25, 65–74 (1985)
Mouhoub, M.: Reasoning about Numeric and Symbolic Time Information. In: The Twelfth IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), pp. 164–172. IEEE Computer Society, Vancouver (2000)
Mouhoub, M.: Dynamic path consistency for interval-based temporal reasoning. In: 21st International Conference on Artificial Intelligence and Applications (AIA 2003), Applied Informatics, pp. 393–398. ACTA Press (2003)
Mouhoub, M.: Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment. AI Communications 17(4), 201–211 (2004)
Mouhoub, M., Sukpan, A.: Conditional and Composite Temporal CSPs. Applied Intelligence 36(1), 90–107 (2012)
Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 125–129. John Wiley and Sons, Amsterdam (1994)
Sena, G.A., Megherbi, D., Isern, G.: Implementation of a parallel genetic algorithm on a cluster of workstations: Traveling salesman problem, a case study. Future Gener. Comput. Syst. 17(4), 477–488 (2001)
Smith, B., Dyer, M.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81, 155–181 (1996)
Xu, K., Li, W.: Exact Phase Transitions in Random Constraint Satisfaction Problems. Journal of Artificial Intelligence Research 12, 93–103 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abbasian, R., Mouhoub, M. (2013). A New GA-Based Method for Temporal Constraint Problems. In: Ali, M., Bosse, T., Hindriks, K.V., Hoogendoorn, M., Jonker, C.M., Treur, J. (eds) Recent Trends in Applied Artificial Intelligence. IEA/AIE 2013. Lecture Notes in Computer Science(), vol 7906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38577-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-38577-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38576-6
Online ISBN: 978-3-642-38577-3
eBook Packages: Computer ScienceComputer Science (R0)