A Clustering Analysis of the Vehicle Routing Problem with a Single Depot
Resource
地理學報, 37, 123-137
Journal
地理學報
Journal Issue
37
Pages
123-137
Date Issued
2004-09
Date
2004-09
Author(s)
陳致元
Abstract
In the last few years, many researches have studied the vehicle routing problem (VRP) in logistics studies, which is a NP-complete problem that can only be solved heuristically. The most frequently used methodology is the “two-step method” The first step is to generate several unimproved solutions, and the second step is to improve the results generated in the first step. Although many studies have focused on the algorithms of the second step, little is known about the influences of the result of the first step. The purpose of this research is to compare the dispatching costs calculated by the application of the VRP models with the costs obtained by traditional algorithms. The study shows that the VRP models yield better results when the demand points are clustered. We also show two clustered patterns of demand points under which the dispatching of goods is cost effective.
Subjects
物流配送
群聚分析
車輛途程問題
Logistics
Dispatch
Clustering analysis
VRP
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
0037_200409_5.pdf
Size
721.09 KB
Format
Adobe PDF
Checksum
(MD5):744be0f72d50123a2d5570880d02b21e