{"title":"MICAH: a genetic algorithm system for multi-commodity transshipment problems","authors":"S. Thangiah, K. Nygård","doi":"10.1109/CAIA.1992.200036","DOIUrl":"https://doi.org/10.1109/CAIA.1992.200036","url":null,"abstract":"The multicommodity transshipment problem (MCTP) is a specialization of the vehicle routing problem. MICAH, a genetic algorithm system integrated with a MCTP solver for solving MCTPs, is described. An MCTP consists of nodes that either produce or acquire commodities and arcs that are used for the transportation of commodities between the different nodes. The objective is to maximize the total amount of commodities transported between the nodes while minimizing the transportation cost. Multicommodity transshipment problems are combinatorially explosive problems that have no known polynomial-time algorithms for obtaining optimal solutions. MCTP problems belong to the NP-complete class of problems. The solution obtained from MICAH for a real-world MCTP transports 38% more commodities compared to the solution obtained from a combination of a MCTP solver and manual routing.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122342783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel approach to knowledge-based communication system design","authors":"M. Edrich","doi":"10.1109/CAIA.1992.200041","DOIUrl":"https://doi.org/10.1109/CAIA.1992.200041","url":null,"abstract":"A new approach to assist communication system design at an early stage and at a high level is presented. A knowledge-based design tool for the class of spread spectrum communication systems is described which is capable of providing basic system concepts and design recommendations based on abstract specifications of functional requirements, restrictions, and a set of optimizing criteria. By the chosen level of abstraction of synthesized system descriptions the structure and the parameters of the system in each case are completely determined, allowing accurate performance prediction and fine tuning by means of commercially available simulation tools. The abstraction level is high enough to permit maintenance of the knowledge base at little expense.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121935854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An assumption-based combinatorial optimization system","authors":"H. Hara, N. Yugami, H. Yoshida","doi":"10.1109/CAIA.1992.200019","DOIUrl":"https://doi.org/10.1109/CAIA.1992.200019","url":null,"abstract":"An assumption-based combinatorial optimization system is proposed for solving combinatorial optimization problems. The assumption-based combinatorial optimization system is a local search method in which a solution is formulated as a set of assumptions. Minimal support for the objective function is a minimal set of assumptions that guarantee the value of the objective function. Using minimal support, the system finds an approximate optimal solution efficiently because it: reduces the number of neighbors, defends the loop of a search and prunes search space, and never stays at a local optimal solution. The system was applied to a jobshop scheduling problem, and the system's effectiveness compared with other methods was demonstrated.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Explanation based on contexts","authors":"P. Huuskonen, A. Korteniemi","doi":"10.1109/CAIA.1992.200027","DOIUrl":"https://doi.org/10.1109/CAIA.1992.200027","url":null,"abstract":"The authors present a hypertext-based explanation mechanism built on an existing diagnostic expert system. The system is a decision support tool for experts analyzing the condition of rotating machinery. Explanation for the system is based on context. It guides interaction and search for suitable explanations. Questions and answers are modeled separately, allowing heuristic answering. System knowledge is modeled as explicable objects to make explanations more modular. Using context to maintain a dialogue is discussed with an implementational view, and explanation techniques of an actual real-world system are presented.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"21 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114034223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}