{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:58Z","timestamp":1720640758674},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s1571-0653(04)00005-8","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"36-47","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Generating Feasible Schedules for a Pick-up and Delivery Problem"],"prefix":"10.1016","volume":"1","author":[{"given":"Eric","family":"Domenjoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB1","article-title":"Constraint Satisfaction Using A Hybrid Evolutionary Hill-Climbing Algorithm That Performs Opportunistic Arc and Path Revision","volume":"1","author":"Bowen","year":"1996"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB2","series-title":"Iterated Greedy Graph Coloring and the Difficulty Landscape. Technical Report TR 92\u201307","author":"Culberson","year":"1992"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB3","series-title":"Proceedings of the 1995 Workshop on Studying and Solving Really Hard Problems","article-title":"Hiding Our Colors","author":"Culberson","year":"1995"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB4","first-page":"245","article-title":"Exploring the k-Colorable Landscape with Iterated Greedy. DIMACS Series, Volume 26, \u201cCliques, Coloring and Satisfiability\u201d","author":"Culberson","year":"1996"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB5","first-page":"2027","article-title":"Systematic Versus Stochastic Constraint Satisfaction","volume":"1","author":"Freuder","year":"1995","journal-title":"Proceedings of the 14th International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB6","first-page":"294","article-title":"Dead-End Driven Learning","volume":"1","author":"Frost","year":"1994"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB7","first-page":"25","article-title":"Dynamic Backtracking","volume":"1","author":"Ginsberg","year":"1993"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB8","series-title":"Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning","first-page":"226","article-title":"GSAT and Dynamic Backtracking","author":"Ginsberg","year":"1994"},{"issue":"1","key":"10.1016\/S1571-0653(04)00005-8_NEWBIB9","first-page":"32","article-title":"Algorithms for Constraint Satisfaction Problems: a Survey","volume":"13","author":"Kumar","year":"1992","journal-title":"AI Magazine"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB10","doi-asserted-by":"crossref","unstructured":"S. Minton, M. D. Johnston, A. B. Philips, P. Laird. Minimizing Conflicts: A Heuristic Repair Method For Constraint Satisfaction and Scheduling Problems. Constraint-Based Reasoning, Freuder & Mackworth (eds.), 1994.","DOI":"10.7551\/mitpress\/2122.003.0006"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB11","series-title":"Proceedings of the 11th National Conference on Artificial Intelligence","first-page":"40","article-title":"The Breakout Method for Escaping from Local Minima","author":"Morris","year":"1993"},{"issue":"4","key":"10.1016\/S1571-0653(04)00005-8_NEWBIB12","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","article-title":"Constraint Satisfaction Algorithms","volume":"5","author":"Nadel","year":"1989","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB13","unstructured":"S. Prestwich. A Generic Approach to Combining Stochastic Algorithms With Systematic Constraint Solvers. Proceedings of the 1998 Workshop on Frontiers of Combining Systems, Kluwer Series on Applied Logic (to appear)."},{"issue":"3","key":"10.1016\/S1571-0653(04)00005-8_NEWBIB14","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid Algorithms for the Constraint Satisfaction Problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB15","unstructured":"E. T. Richards, B. Richards. Restart-Repair and Learning: An Empirical Study of Single Solution 3-SAT Problems. Proceedings of the CP'97 Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, Linz, Austria, 1997."},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB16","series-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","first-page":"191","article-title":"Some Guidelines for Genetic Algorithms with Penalty Functions","author":"Richardson","year":"1989"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB17","series-title":"Proceedings of the 15th International Joint Conference on Artificial Intelligence","first-page":"1254","article-title":"Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems","author":"Schaerf","year":"1997"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB18","unstructured":"B. Selman, H. Levesque, D. Mitchell. A New Method for Solving Hard Satisfiability Problems. Proceedings of the 10th National Conference on Artificial Intelligence, MIT Press, 1992, pp. 440\u2013446."},{"issue":"2","key":"10.1016\/S1571-0653(04)00005-8_NEWBIB19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","article-title":"Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis","volume":"9","author":"Stallman","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB20","first-page":"313","article-title":"Weak-Commitment Search for Solving Constraint Satisfaction Problems","volume":"1","author":"Yokoo","year":"1994"},{"key":"10.1016\/S1571-0653(04)00005-8_NEWBIB21","first-page":"344","article-title":"Improving Repair-based Constraint Satisfaction Methods by Value Propagation","volume":"1","author":"Yugami","year":"1994"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T17:13:55Z","timestamp":1705252435000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":21,"alternative-id":["S1571065304000058"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00005-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}