限制混合收集和交付的多车厢车辆路线问题

Carlos Leonardo Ramos Póvoa, Geraldo Galdino de Paula, L. V. D. L. Silva, Júlia Landeira Moreira
{"title":"限制混合收集和交付的多车厢车辆路线问题","authors":"Carlos Leonardo Ramos Póvoa, Geraldo Galdino de Paula, L. V. D. L. Silva, Júlia Landeira Moreira","doi":"10.5151/spolm2019-152","DOIUrl":null,"url":null,"abstract":"This paper presents the problem of vehicle routing with multi-compartments with pickup and restricted mixed delivery (MC-PRVCEMR). The same is a generalization of the problem of vehicle routing with deliveries and pickups, allowing the decision maker to choose how much free capacity of the vehicle will be accepted before starting to make the pickups. A GRASP heuristic has been developed to solve the problem, as well as a procedure to verify the customer's insertion in the route. The algorithm was tested with 46 instances, and despite the use of a simple local search procedure, it presented results compatible with the literature.","PeriodicalId":169435,"journal":{"name":"Simpósio de Pesquisa Operacional e Logística da Marinha - Publicação Online","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PROBLEMA DE ROTEIRIZAÇÃO DE VEÍCULOS COM MULTICOMPARTIMENTOS COM COLETA E ENTREGA MISTA RESTRITA\",\"authors\":\"Carlos Leonardo Ramos Póvoa, Geraldo Galdino de Paula, L. V. D. L. Silva, Júlia Landeira Moreira\",\"doi\":\"10.5151/spolm2019-152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the problem of vehicle routing with multi-compartments with pickup and restricted mixed delivery (MC-PRVCEMR). The same is a generalization of the problem of vehicle routing with deliveries and pickups, allowing the decision maker to choose how much free capacity of the vehicle will be accepted before starting to make the pickups. A GRASP heuristic has been developed to solve the problem, as well as a procedure to verify the customer's insertion in the route. The algorithm was tested with 46 instances, and despite the use of a simple local search procedure, it presented results compatible with the literature.\",\"PeriodicalId\":169435,\"journal\":{\"name\":\"Simpósio de Pesquisa Operacional e Logística da Marinha - Publicação Online\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Simpósio de Pesquisa Operacional e Logística da Marinha - Publicação Online\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5151/spolm2019-152\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Simpósio de Pesquisa Operacional e Logística da Marinha - Publicação Online","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5151/spolm2019-152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了带取货和受限混合配送的多车厢车辆路径问题。这同样是对车辆路线问题的概括,包括送货和取货,允许决策者在开始取货之前选择可接受的车辆的空闲容量。为了解决这一问题,开发了一种GRASP启发式算法,以及一种验证客户是否插入路线的程序。该算法在46个实例中进行了测试,尽管使用了简单的局部搜索过程,但其结果与文献相符。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PROBLEMA DE ROTEIRIZAÇÃO DE VEÍCULOS COM MULTICOMPARTIMENTOS COM COLETA E ENTREGA MISTA RESTRITA
This paper presents the problem of vehicle routing with multi-compartments with pickup and restricted mixed delivery (MC-PRVCEMR). The same is a generalization of the problem of vehicle routing with deliveries and pickups, allowing the decision maker to choose how much free capacity of the vehicle will be accepted before starting to make the pickups. A GRASP heuristic has been developed to solve the problem, as well as a procedure to verify the customer's insertion in the route. The algorithm was tested with 46 instances, and despite the use of a simple local search procedure, it presented results compatible with the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信