The Single Vehicle Routing Problem for Home Delivery
碩士 === 逢甲大學 === 交通工程與管理所 === 93 === With the development of e-Commerce, people can place orders through internet and the commodity is shipped right to the customer’s door, hence people reply on home delivery service more and more and the service competition becomes more intensive. The characteristic...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02737963384631670398 |
id |
ndltd-TW-093FCU05118010 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-093FCU051180102015-10-13T11:20:16Z http://ndltd.ncl.edu.tw/handle/02737963384631670398 The Single Vehicle Routing Problem for Home Delivery 單一宅配車輛路線規劃之研究 Yi-Fang Chen 陳怡芳 碩士 逢甲大學 交通工程與管理所 93 With the development of e-Commerce, people can place orders through internet and the commodity is shipped right to the customer’s door, hence people reply on home delivery service more and more and the service competition becomes more intensive. The characteristics of home delivery service are of low volume, being highly variable, and needs to serve many points within a time window. Hence the service cost is higher than traditional carrier’s. Vehicle routing has a great impact on the level of service (responsiveness) and operating costs (efficiency). Therefore, how to plan vehicle routing effectively for home delivery is the key to success in competition. Home delivery service serves two types of customers - general customers and contracted customers. Usually, pickup-delivery service is provided in the morning and afternoon for general customers but at pre-specified times for contracted customers. Considering the service time for both customers, the vehicle routing problem becomes a time window constraint problem. In addition, some demands are still unknown before vehicles leaving from the depot. Therefore, we can define the vehicle routing planning of home delivery service as Dynamic Pickup-Delivery VRP with Time Window (DPDVRPTW). In this study, we design a vehicle routing system. The initial vehicle routes are constructed by the nearest insertion method. The Tabu Search (TS) algorithm is used for improving vehicle routes and Swap and Or-opt are used in sequence as search engines. The test problems are designed in different scales depending on the service times and the related parameters are selected according to the improving rate obtained from each problem test. Finally, the spatial analysis feature of Geographic Information System (GIS) is used to assist home delivery service companies in vehicle routing. According to the test results, the length of initial routes can be reduced by 30% to 40% after improving the routing procedure and the level of service remains satisfactory. Da-Jie Lin 林大傑 2005 學位論文 ; thesis 106 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 逢甲大學 === 交通工程與管理所 === 93 === With the development of e-Commerce, people can place orders through internet and the commodity is shipped right to the customer’s door, hence people reply on home delivery service more and more and the service competition becomes more intensive. The characteristics of home delivery service are of low volume, being highly variable, and needs to serve many points within a time window. Hence the service cost is higher than traditional carrier’s. Vehicle routing has a great impact on the level of service (responsiveness) and operating costs (efficiency). Therefore, how to plan vehicle routing effectively for home delivery is the key to success in competition.
Home delivery service serves two types of customers - general customers and contracted customers. Usually, pickup-delivery service is provided in the morning and afternoon for general customers but at pre-specified times for contracted customers. Considering the service time for both customers, the vehicle routing problem becomes a time window constraint problem. In addition, some demands are still unknown before vehicles leaving from the depot. Therefore, we can define the vehicle routing planning of home delivery service as Dynamic Pickup-Delivery VRP with Time Window (DPDVRPTW). In this study, we design a vehicle routing system. The initial vehicle routes are constructed by the nearest insertion method. The Tabu Search (TS) algorithm is used for improving vehicle routes and Swap and Or-opt are used in sequence as search engines. The test problems are designed in different scales depending on the service times and the related parameters are selected according to the improving rate obtained from each problem test. Finally, the spatial analysis feature of Geographic Information System (GIS) is used to assist home delivery service companies in vehicle routing.
According to the test results, the length of initial routes can be reduced by 30% to 40% after improving the routing procedure and the level of service remains satisfactory.
|
author2 |
Da-Jie Lin |
author_facet |
Da-Jie Lin Yi-Fang Chen 陳怡芳 |
author |
Yi-Fang Chen 陳怡芳 |
spellingShingle |
Yi-Fang Chen 陳怡芳 The Single Vehicle Routing Problem for Home Delivery |
author_sort |
Yi-Fang Chen |
title |
The Single Vehicle Routing Problem for Home Delivery |
title_short |
The Single Vehicle Routing Problem for Home Delivery |
title_full |
The Single Vehicle Routing Problem for Home Delivery |
title_fullStr |
The Single Vehicle Routing Problem for Home Delivery |
title_full_unstemmed |
The Single Vehicle Routing Problem for Home Delivery |
title_sort |
single vehicle routing problem for home delivery |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/02737963384631670398 |
work_keys_str_mv |
AT yifangchen thesinglevehicleroutingproblemforhomedelivery AT chényífāng thesinglevehicleroutingproblemforhomedelivery AT yifangchen dānyīzháipèichēliànglùxiànguīhuàzhīyánjiū AT chényífāng dānyīzháipèichēliànglùxiànguīhuàzhīyánjiū AT yifangchen singlevehicleroutingproblemforhomedelivery AT chényífāng singlevehicleroutingproblemforhomedelivery |
_version_ |
1716840955501346816 |