集装箱货代业务规划:具有同时取货和交付服务的本地车辆路线模型

Pengfei Zhou
{"title":"集装箱货代业务规划:具有同时取货和交付服务的本地车辆路线模型","authors":"Pengfei Zhou","doi":"10.1109/SOLI.2007.4383867","DOIUrl":null,"url":null,"abstract":"Distribution and transportation of containers is an intense problem faced by container terminals and forwarders to enhance container service level, where clients generally may require simultaneous pick-up and delivery service. In the paper an optimizing model of local container vehicle routing with time window constraints is proposed. By improving solution encoding, genetic algorithm (GA) operators and involution strategy, a genetic algorithm is developed to gain a efficient and feasible solution. Based on the Solomon's customer problem, experiments show that the proposed model and algorithm are potentially efficient and useful in solving container forwarder vehicle routing problems with simultaneous pick-up and delivery service.","PeriodicalId":154053,"journal":{"name":"2007 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Container Forwarder Operational Planning: A Local Vehicle Routing Model with Simultaneous Pick up and Delivery Service\",\"authors\":\"Pengfei Zhou\",\"doi\":\"10.1109/SOLI.2007.4383867\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distribution and transportation of containers is an intense problem faced by container terminals and forwarders to enhance container service level, where clients generally may require simultaneous pick-up and delivery service. In the paper an optimizing model of local container vehicle routing with time window constraints is proposed. By improving solution encoding, genetic algorithm (GA) operators and involution strategy, a genetic algorithm is developed to gain a efficient and feasible solution. Based on the Solomon's customer problem, experiments show that the proposed model and algorithm are potentially efficient and useful in solving container forwarder vehicle routing problems with simultaneous pick-up and delivery service.\",\"PeriodicalId\":154053,\"journal\":{\"name\":\"2007 IEEE International Conference on Service Operations and Logistics, and Informatics\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Service Operations and Logistics, and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOLI.2007.4383867\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Service Operations and Logistics, and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2007.4383867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

集装箱的分配和运输是集装箱码头和货代为提高集装箱服务水平而面临的一个严峻问题,客户通常会要求同时提供收递服务。提出了一种具有时间窗约束的局部集装箱车辆路径优化模型。通过改进解编码、遗传算法算子和对合策略,提出了一种有效可行的遗传算法。基于Solomon客户问题的实验表明,所提出的模型和算法在解决具有同步取货服务的集装箱货代车辆路线问题上具有潜在的有效性和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Container Forwarder Operational Planning: A Local Vehicle Routing Model with Simultaneous Pick up and Delivery Service
Distribution and transportation of containers is an intense problem faced by container terminals and forwarders to enhance container service level, where clients generally may require simultaneous pick-up and delivery service. In the paper an optimizing model of local container vehicle routing with time window constraints is proposed. By improving solution encoding, genetic algorithm (GA) operators and involution strategy, a genetic algorithm is developed to gain a efficient and feasible solution. Based on the Solomon's customer problem, experiments show that the proposed model and algorithm are potentially efficient and useful in solving container forwarder vehicle routing problems with simultaneous pick-up and delivery service.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信