{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:26:55Z","timestamp":1742984815973,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385766"},{"type":"electronic","value":"9783642385773"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38577-3_26","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T01:31:53Z","timestamp":1369013513000},"page":"252-261","source":"Crossref","is-referenced-by-count":0,"title":["A New GA-Based Method for Temporal Constraint Problems"],"prefix":"10.1007","author":[{"given":"Reza","family":"Abbasian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malek","family":"Mouhoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abbasian, R., Mouhoub, M.: An efficient hierarchical parallel genetic algorithm for graph coloring problem. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO, pp. 521\u2013528. ACM (2011)","DOI":"10.1145\/2001576.2001648"},{"issue":"11","key":"26_CR2","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. Allen","year":"1983","unstructured":"Allen, J.: Maintaining knowledge about temporal intervals. CACM\u00a026(11), 832\u2013843 (1983)","journal-title":"CACM"},{"key":"26_CR3","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence\u00a049, 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. Eiben","year":"1998","unstructured":"Eiben, A.E., van der Hauw, J.K., van Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. J. Heuristics\u00a04(1), 25\u201346 (1998)","journal-title":"J. Heuristics"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Flaws and structure (1998)","DOI":"10.1007\/3-540-49481-2_24"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"Haralick, R., Elliott, G.: Increasing tree search efficiency for Constraint Satisfaction Problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"26_CR8","unstructured":"van der Hauw, J.: Evaluating and improving steady state evolutionary algorithms on constraint satisfaction problems (1996), \n                      citeseer.ist.psu.edu\/vanderhauw96evaluating.html"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/ICTAI.2008.43","volume-title":"Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence","author":"B.J. Jashmi","year":"2008","unstructured":"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.\u00a02, pp. 525\u2013529. IEEE Computer Society, Washington, DC (2008)"},{"issue":"4","key":"26_CR10","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.future.2006.10.008","volume":"23","author":"D. Lim","year":"2007","unstructured":"Lim, D., Ong, Y.S., Jin, Y., Sendhoff, B., Lee, B.S.: Efficient hierarchical parallel genetic algorithms using grid computing. Future Gener. Comput. Syst.\u00a023(4), 658\u2013670 (2007)","journal-title":"Future Gener. Comput. Syst."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A.K. Mackworth","year":"1985","unstructured":"Mackworth, A.K., Freuder, E.: The complexity of some polynomial network-consistency algorithms for constraint satisfaction problems. Artificial Intelligence\u00a025, 65\u201374 (1985)","journal-title":"Artificial Intelligence"},{"key":"26_CR12","first-page":"164","volume-title":"The Twelfth IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000)","author":"M. Mouhoub","year":"2000","unstructured":"Mouhoub, M.: Reasoning about Numeric and Symbolic Time Information. In: The Twelfth IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), pp. 164\u2013172. IEEE Computer Society, Vancouver (2000)"},{"key":"26_CR13","unstructured":"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\u2013398. ACTA Press (2003)"},{"issue":"4","key":"26_CR14","first-page":"201","volume":"17","author":"M. Mouhoub","year":"2004","unstructured":"Mouhoub, M.: Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment. AI Communications\u00a017(4), 201\u2013211 (2004)","journal-title":"AI Communications"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s10489-010-0246-z","volume":"36","author":"M. Mouhoub","year":"2012","unstructured":"Mouhoub, M., Sukpan, A.: Conditional and Composite Temporal CSPs. Applied Intelligence\u00a036(1), 90\u2013107 (2012)","journal-title":"Applied Intelligence"},{"key":"26_CR16","first-page":"125","volume-title":"Proceedings of the Eleventh European Conference on Artificial Intelligence","author":"D. Sabin","year":"1994","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 125\u2013129. John Wiley and Sons, Amsterdam (1994)"},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0167-739X(99)00134-X","volume":"17","author":"G.A. Sena","year":"2001","unstructured":"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.\u00a017(4), 477\u2013488 (2001)","journal-title":"Future Gener. Comput. Syst."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B. Smith","year":"1996","unstructured":"Smith, B., Dyer, M.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence\u00a081, 155\u2013181 (1996)","journal-title":"Artificial Intelligence"},{"key":"26_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K. Xu","year":"2000","unstructured":"Xu, K., Li, W.: Exact Phase Transitions in Random Constraint Satisfaction Problems. Journal of Artificial Intelligence Research\u00a012, 93\u2013103 (2000)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38577-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T14:24:50Z","timestamp":1675779890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38577-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385766","9783642385773"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38577-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}