MICAH: a genetic algorithm system for multi-commodity transshipment problems

S. Thangiah, K. Nygård
{"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.<>
MICAH:多商品转运问题的遗传算法系统
多商品转运问题(MCTP)是车辆路线问题的一个特殊化问题。MICAH是一种集成MCTP求解器的遗传算法系统,用于求解MCTP问题。MCTP由生产或获取商品的节点和用于在不同节点之间运输商品的弧线组成。目标是使节点之间运输的商品总量最大化,同时使运输成本最小化。多商品转运问题是组合爆炸问题,没有已知的多项式时间算法来获得最优解。MCTP问题属于np完全问题。与MCTP求解器和手动路由相结合的解决方案相比,MICAH获得的实际MCTP解决方案的货物运输量增加了38%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信