An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem
Tantikorn Pichpibul, Ruengsak Kawtummachai
Thammasat University Panyapiwat Institute of Management
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In this paper, we have proposed an algorithm that has been improved from the classical Clarke and Wright savings algorithm (CW) to solve the capacitated vehicle routing problem.The main concept of our proposed algorithm is to hybridize the CW with tournament and roulette wheel selections to determine a new and efficient algorithm.The objective is to find the feasible solutions (or routes) to minimize travelling distances and number of routes.We have tested the proposed algorithm with 84 problem instances and the numerical results indicate that our algorithm outperforms CW and the optimal solution is obtained in 81% of all tested instances (68 out of 84).The average deviation between our solution and the optimal one is always very low (0.14%). KEYWORDS: heuristics, optimization, tournament selection, roulette wheel selectionBold indicates the optimal solution was obtained.* indicates the obtained solution beats the others.(number) indicates the infeasible solution (the number of available vehicles is inadequate).
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
工程Vehicle Routing Optimization Methods
Metaheuristic Optimization Algorithms Research · Facility Location and Emergency Management