{"title":"MICAH: a genetic algorithm system for multi-commodity transshipment problems","authors":"S. Thangiah, K. Nygård","doi":"10.1109/CAIA.1992.200036","DOIUrl":null,"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.0000,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1992.200036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
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.<>