多目标元启发式方法求解同时取货和投递的位置路径问题

Xuefeng Wang
{"title":"多目标元启发式方法求解同时取货和投递的位置路径问题","authors":"Xuefeng Wang","doi":"10.1109/ISCID.2013.197","DOIUrl":null,"url":null,"abstract":"We address an integrated logistics system where decisions on location of depot, vehicle routing are considered simultaneously. Total cost and service quality are common criteria influencing decision-making. Literature on location routing problem (LRP) addressed the location and vehicle routing decisions with a common assumption that each vehicle can only performance pickup or delivery assignment in each dispatch. However, both demands of each customer often require be satisfied at the same time. In this paper we consider a LRP with simultaneous pickup and delivery to minimize total cost and customer waiting time. We formulate a nonlinear multi-objective integrated programming model for the problem. A heuristic algorithm based on tabu search is proposed to solve the large-size problem. We then empirically evaluate the strengths of the proposed formulations with respect to their ability to find optimal solutions or strong lower bounds, and investigate the effectiveness of the proposed heuristic approach. Results show that the proposed heuristic approach is computationally efficient in finding good quality solutions.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective Metaheuristics for a Location-Routing Problem with Simultaneous Pickup and Delivery\",\"authors\":\"Xuefeng Wang\",\"doi\":\"10.1109/ISCID.2013.197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address an integrated logistics system where decisions on location of depot, vehicle routing are considered simultaneously. Total cost and service quality are common criteria influencing decision-making. Literature on location routing problem (LRP) addressed the location and vehicle routing decisions with a common assumption that each vehicle can only performance pickup or delivery assignment in each dispatch. However, both demands of each customer often require be satisfied at the same time. In this paper we consider a LRP with simultaneous pickup and delivery to minimize total cost and customer waiting time. We formulate a nonlinear multi-objective integrated programming model for the problem. A heuristic algorithm based on tabu search is proposed to solve the large-size problem. We then empirically evaluate the strengths of the proposed formulations with respect to their ability to find optimal solutions or strong lower bounds, and investigate the effectiveness of the proposed heuristic approach. Results show that the proposed heuristic approach is computationally efficient in finding good quality solutions.\",\"PeriodicalId\":297027,\"journal\":{\"name\":\"2013 Sixth International Symposium on Computational Intelligence and Design\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Sixth International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2013.197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Sixth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2013.197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们解决了一个综合物流系统,其中仓库的位置,车辆路线的决定是同时考虑的。总成本和服务质量是影响决策的常见标准。位置路径问题(LRP)的文献研究了位置和车辆路径决策,假设每辆车在每次调度中只能执行取货或送货任务。然而,每个客户的两种需求往往需要同时得到满足。在本文中,我们考虑了一个同时取货和交货的LRP,以最小化总成本和客户等待时间。针对该问题,建立了一个非线性多目标综合规划模型。提出了一种基于禁忌搜索的启发式算法来解决大尺寸问题。然后,我们根据其寻找最优解或强下界的能力来经验地评估所提出的公式的优势,并研究所提出的启发式方法的有效性。结果表明,提出的启发式方法在寻找高质量解方面具有计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective Metaheuristics for a Location-Routing Problem with Simultaneous Pickup and Delivery
We address an integrated logistics system where decisions on location of depot, vehicle routing are considered simultaneously. Total cost and service quality are common criteria influencing decision-making. Literature on location routing problem (LRP) addressed the location and vehicle routing decisions with a common assumption that each vehicle can only performance pickup or delivery assignment in each dispatch. However, both demands of each customer often require be satisfied at the same time. In this paper we consider a LRP with simultaneous pickup and delivery to minimize total cost and customer waiting time. We formulate a nonlinear multi-objective integrated programming model for the problem. A heuristic algorithm based on tabu search is proposed to solve the large-size problem. We then empirically evaluate the strengths of the proposed formulations with respect to their ability to find optimal solutions or strong lower bounds, and investigate the effectiveness of the proposed heuristic approach. Results show that the proposed heuristic approach is computationally efficient in finding good quality solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信