位置從屬 車輛經路問題 解法의 改善 = Improvements of the algorithm for vehicle routing with site dependencies

다국어 초록 (Multilingual Abstract)

In the classical vehicle routing problem, a fleet of vehicles deliver goods from a central depot to a set of customers with known demands. The objective of the problem is to form minimum cost routes for the delivery vehicle, while serving all the customer demands. One of the practical variants of the vehicle routing problem is found when there are compatibility problems between some of the customer sites and some of the heterogeneous fleet of vehicles. Only one heuristic algorithm for this vehicle routing with site dependencies is known to this date.
This paper presents a mathematical model of the problem of vehicle routing with site dependencies, and analyzes the existing algorithm of the problem. Then this paper considers possible improvements of the existing algorithm in two ways. In the first one, the generalized assignment heuristic (GAH) is adopted to form a more balanced cluster of customers and thus to reduce the total routing cost. In the second one, the tabu search (TS) metaheuristic is utilized to further improve suboptimal solutions obtained by the existing algorithm. Implementations of these improvements remain as a topic of future research on the problem.

목차 (Table of Contents)

• 目次
• Ⅰ. 序論
• Ⅱ. 位置從屬 車輛經路問題의 數理模型
• Ⅲ. 位置從屬 車輛經路問題의 旣存 解法
• Ⅳ. 旣存 解法의 改善
• Ⅴ. 結論
• 참고 문헌
• Abstract