求解有能力不对称分配枢纽位置问题的一种杂交方法

Sun Ji Ung
{"title":"求解有能力不对称分配枢纽位置问题的一种杂交方法","authors":"Sun Ji Ung","doi":"10.47880/inf2602-01","DOIUrl":null,"url":null,"abstract":"This paper deals with a capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. To solve the problem optimally, we present a 0-1 integer programming model and find an optimal solution using CPLEX. As the CAAHLP has impractically demanding for the large-sized problem, a solution method based on combined ant colony optimization algorithm and genetic algorithm is developed which solve hub location problem and node allocation problem respectively. We investigate performance of the proposed solution method through the comparative study. Key Words: Hub Location, Asymmetric Allocation, Ant Colony Optimization, Genetic Algorithm","PeriodicalId":50362,"journal":{"name":"Information-An International Interdisciplinary Journal","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hybridization Approach to Solve the Capacitated Asymmetric Allocation Hub Location Problem\",\"authors\":\"Sun Ji Ung\",\"doi\":\"10.47880/inf2602-01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with a capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. To solve the problem optimally, we present a 0-1 integer programming model and find an optimal solution using CPLEX. As the CAAHLP has impractically demanding for the large-sized problem, a solution method based on combined ant colony optimization algorithm and genetic algorithm is developed which solve hub location problem and node allocation problem respectively. We investigate performance of the proposed solution method through the comparative study. Key Words: Hub Location, Asymmetric Allocation, Ant Colony Optimization, Genetic Algorithm\",\"PeriodicalId\":50362,\"journal\":{\"name\":\"Information-An International Interdisciplinary Journal\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information-An International Interdisciplinary Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47880/inf2602-01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information-An International Interdisciplinary Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47880/inf2602-01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了一个有能力的非对称分配集线器定位问题。我们以满足所需服务水平的最小总运输成本为目标,确定了枢纽的数量、枢纽的位置以及非枢纽节点到枢纽的不对称分配。为了最优地解决这一问题,我们提出了一个0-1整数规划模型,并利用CPLEX找到了最优解。针对CAAHLP对大型问题的不切实际要求,提出了一种基于蚁群优化算法和遗传算法相结合的求解方法,分别求解集线器定位问题和节点分配问题。我们通过比较研究来考察所提出的求解方法的性能。关键词:枢纽选址,不对称分配,蚁群优化,遗传算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Hybridization Approach to Solve the Capacitated Asymmetric Allocation Hub Location Problem
This paper deals with a capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. To solve the problem optimally, we present a 0-1 integer programming model and find an optimal solution using CPLEX. As the CAAHLP has impractically demanding for the large-sized problem, a solution method based on combined ant colony optimization algorithm and genetic algorithm is developed which solve hub location problem and node allocation problem respectively. We investigate performance of the proposed solution method through the comparative study. Key Words: Hub Location, Asymmetric Allocation, Ant Colony Optimization, Genetic Algorithm
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
8.3 months
期刊最新文献
Sentiment Analysis using a CNN-BiLSTM Deep Model Based on Attention Classification A Study on the Changes in Safety Perception of Air Passengers in the Living with COVID-19 Era: The Case of South Korea Going Back to the Basic of Green Economy: Special Reference to Economic Interpretation and Policies Research on the Revitalization of the Defensive Fortress of the Great Wall Based on the Adversarial Interpretive-Structure Model An Analysis of Effect of Stress on Self-Efficacy of Flight Trainees in Korea: Using Multiple Regression Analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1