{"title":"COKE: efficient solving of complex assignment problems with the propose-and-exchange method","authors":"Karsten Poeck, F. Puppe","doi":"10.1109/TAI.1992.246362","DOIUrl":null,"url":null,"abstract":"A problem-solving method for assignment problems and a corresponding expert system shell named COKE are presented and evaluated. The method consists of four main steps. Until all elements are assigned: (1) select an element to be assigned next, (2) propose a partner element for that element, (3) if new constraints are violated after the proposed step, try exchanging elements to remove or minimize the constraint violations from a local point of view, and (4) if the completed assignment still violates constraints, try exchanges to remove or minimize them from a global point of view and with more effort. Each step can take advantage of problem-specific knowledge. The evaluation with COKE shows that flexibility is of key importance in dealing with different kinds of assignment problems.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 52
Abstract
A problem-solving method for assignment problems and a corresponding expert system shell named COKE are presented and evaluated. The method consists of four main steps. Until all elements are assigned: (1) select an element to be assigned next, (2) propose a partner element for that element, (3) if new constraints are violated after the proposed step, try exchanging elements to remove or minimize the constraint violations from a local point of view, and (4) if the completed assignment still violates constraints, try exchanges to remove or minimize them from a global point of view and with more effort. Each step can take advantage of problem-specific knowledge. The evaluation with COKE shows that flexibility is of key importance in dealing with different kinds of assignment problems.<>