2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication) :

NDLデジタルコレクション
  • Nakao,Yoshitaka
    Mathematical Science Department Canon System Solutions Inc.
  • Nagamochi,Hiroshi
    Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University

この論文をさがす

説明

We consider a discrete-type split delivery vehicle routing problem, in which delivery goods for a customer consist of a set of items, each item is serviced by exactly one vehicle, and each customer is allowed to be visited more than once. In this paper, we propose a fast algorithm for constructing a set of routes one by one without improving the resulting routes by any modification. The algorithm generates routes by dynamic programming based on an elaborate route evaluation function that estimates the total travel cost by vehicles to service all the remaining items. Experimental results on real-world instances are reported.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ