A Heuristic Approach Based on Clarke‐Wright Algorithm for Open Vehicle Routing Problem
Tantikorn Pichpibul, Ruengsak Kawtummachai
Panyapiwat Institute of Management
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route postimprovement. Computational results show that the proposed CW is competitive and outperforms classical CW in all directions. Moreover, the best known solution is also obtained in 97% of tested instances (60 out of 62).
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
工程Vehicle Routing Optimization Methods
Facility Location and Emergency Management · Metaheuristic Optimization Algorithms Research