Iterated local search multi-objective methodology for the green vehicle routing problem considering workload equity with a private fleet and a common carrier

IF 1.6 3区 工程技术 Q4 ENGINEERING, INDUSTRIAL
John Fredy Castaneda Londono, R. A. G. Rendón, Eliana Mirledy Toro Ocampo
{"title":"Iterated local search multi-objective methodology for the green vehicle routing problem considering workload equity with a private fleet and a common carrier","authors":"John Fredy Castaneda Londono, R. A. G. Rendón, Eliana Mirledy Toro Ocampo","doi":"10.5267/j.ijiec.2020.8.001","DOIUrl":null,"url":null,"abstract":"A multi-objective methodology was proposed for solving the green vehicle routing problem with a private fleet and common carrier considering workload equity. The iterated local search metaheuristic, which is adapted to the solution of the problem with three objectives, was proposed as a solution method. A solution algorithm was divided into three stages. In the first, initial solutions were identified based on the savings heuristic. The second and third act together using the random variable neighbourhood search algorithm, which allows performing an intensification process and perturbance processes, giving the possibility of exploring new regions in the search space, which are proposed within the framework of optimizing the three objectives. According to the previous review of the state of the art, there is little related literature; through discussions with the productive sector, this problem is frequent due to increases in demand in certain seasons or a part of the maintenance vehicle fleet departing from service. The proposed methodology was verified using case studies from the literature, which were adapted to the problem of three objectives, obtaining consistent solutions. Where cases were not reported in the literature, these could be used as a reference in future research.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"27 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Industrial Engineering Computations","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.5267/j.ijiec.2020.8.001","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 5

Abstract

A multi-objective methodology was proposed for solving the green vehicle routing problem with a private fleet and common carrier considering workload equity. The iterated local search metaheuristic, which is adapted to the solution of the problem with three objectives, was proposed as a solution method. A solution algorithm was divided into three stages. In the first, initial solutions were identified based on the savings heuristic. The second and third act together using the random variable neighbourhood search algorithm, which allows performing an intensification process and perturbance processes, giving the possibility of exploring new regions in the search space, which are proposed within the framework of optimizing the three objectives. According to the previous review of the state of the art, there is little related literature; through discussions with the productive sector, this problem is frequent due to increases in demand in certain seasons or a part of the maintenance vehicle fleet departing from service. The proposed methodology was verified using case studies from the literature, which were adapted to the problem of three objectives, obtaining consistent solutions. Where cases were not reported in the literature, these could be used as a reference in future research.
考虑私人车队和公共承运人工作量公平的绿色车辆路径问题的迭代局部搜索多目标方法
提出了一种考虑工作量公平的私人车队和公共承运人绿色车辆路径问题的多目标求解方法。提出了一种适合求解三目标问题的迭代局部搜索元启发式求解方法。求解算法分为三个阶段。首先,根据储蓄启发式确定初始解决方案。第二步和第三步一起使用随机变量邻域搜索算法,该算法允许执行强化过程和扰动过程,从而可以在优化三个目标的框架内探索搜索空间中的新区域。根据以往对技术现状的回顾,相关文献很少;通过与生产部门的讨论,由于某些季节需求增加或部分维修车队离开服务,这个问题经常发生。采用文献中的案例研究验证了所提出的方法,这些案例研究适用于三个目标的问题,获得一致的解决方案。文献中未报道的病例,可作为今后研究的参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.70
自引率
9.10%
发文量
35
审稿时长
20 weeks
×
引用
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学术官方微信