求解多目标三维背包问题的人工蜂群

Suriya Phongmoo, K. Leksakul, Pongsawat Premphet
{"title":"求解多目标三维背包问题的人工蜂群","authors":"Suriya Phongmoo, K. Leksakul, Pongsawat Premphet","doi":"10.1145/3397056.3397087","DOIUrl":null,"url":null,"abstract":"The objectives of this research aim to apply the mathematical model, to propose an Artificial Bee Colony for Solving Three-Dimensional Knapsack Problem and to determine the optimal parameters of an Artificial Bee Colony Algorithm. This work application of heuristic approach is used for optimizing containers loading problem and we has a contract with logistic and transport company in the northern of Thailand to joint on this research. For the containers loading problem are the Three-Dimensional Knapsack Problem and it will be solving the real problem within the supporting of logistic and transport company in the northern of Thailand. However we deal with Nim See Seng Transport 1988 Co., Ltd cause of they are the big transportation company in the north of Thailand. The result of this research will be comparing between performance of the result in OR-Library which is a database that collects the best optimal solution data about Three-Dimensional Knapsack Problem and Artificial Bee Colony Algorithm, on the other hand Artificial Bee Colony Algorithm will be provides the good solutions within the satisfaction computer runtime, maximize profit, minimize empty space and respond to customers satisfaction also.","PeriodicalId":365314,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Geoinformatics and Data Analysis","volume":"256 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Artificial Bee Colony for Solving Multi-Objectives Three-Dimensional Knapsack Problem\",\"authors\":\"Suriya Phongmoo, K. Leksakul, Pongsawat Premphet\",\"doi\":\"10.1145/3397056.3397087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objectives of this research aim to apply the mathematical model, to propose an Artificial Bee Colony for Solving Three-Dimensional Knapsack Problem and to determine the optimal parameters of an Artificial Bee Colony Algorithm. This work application of heuristic approach is used for optimizing containers loading problem and we has a contract with logistic and transport company in the northern of Thailand to joint on this research. For the containers loading problem are the Three-Dimensional Knapsack Problem and it will be solving the real problem within the supporting of logistic and transport company in the northern of Thailand. However we deal with Nim See Seng Transport 1988 Co., Ltd cause of they are the big transportation company in the north of Thailand. The result of this research will be comparing between performance of the result in OR-Library which is a database that collects the best optimal solution data about Three-Dimensional Knapsack Problem and Artificial Bee Colony Algorithm, on the other hand Artificial Bee Colony Algorithm will be provides the good solutions within the satisfaction computer runtime, maximize profit, minimize empty space and respond to customers satisfaction also.\",\"PeriodicalId\":365314,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Geoinformatics and Data Analysis\",\"volume\":\"256 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Geoinformatics and Data Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3397056.3397087\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Geoinformatics and Data Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3397056.3397087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究的目的是应用数学模型,提出求解三维背包问题的人工蜂群算法,并确定人工蜂群算法的最优参数。该工作应用启发式方法用于优化集装箱装载问题,我们与泰国北部的物流和运输公司签订了合同,共同进行这项研究。集装箱装载问题是三维背包问题,它将在泰国北部的物流和运输公司的支持下解决实际问题。然而,我们与Nim See Seng运输1988有限公司打交道,因为他们是泰国北部的大型运输公司。本研究的结果将比较OR-Library(收集三维背包问题最优解数据的数据库)与人工蜂群算法的性能,另一方面,人工蜂群算法将在满意的计算机运行时间内提供良好的解决方案,最大化利润,最小化空置空间,并响应客户满意度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial Bee Colony for Solving Multi-Objectives Three-Dimensional Knapsack Problem
The objectives of this research aim to apply the mathematical model, to propose an Artificial Bee Colony for Solving Three-Dimensional Knapsack Problem and to determine the optimal parameters of an Artificial Bee Colony Algorithm. This work application of heuristic approach is used for optimizing containers loading problem and we has a contract with logistic and transport company in the northern of Thailand to joint on this research. For the containers loading problem are the Three-Dimensional Knapsack Problem and it will be solving the real problem within the supporting of logistic and transport company in the northern of Thailand. However we deal with Nim See Seng Transport 1988 Co., Ltd cause of they are the big transportation company in the north of Thailand. The result of this research will be comparing between performance of the result in OR-Library which is a database that collects the best optimal solution data about Three-Dimensional Knapsack Problem and Artificial Bee Colony Algorithm, on the other hand Artificial Bee Colony Algorithm will be provides the good solutions within the satisfaction computer runtime, maximize profit, minimize empty space and respond to customers satisfaction also.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信