A Pickup and Delivery Problem with Hub-Exchange
Date Issued
2011
Date
2011
Author(s)
Yanti, Lili
Abstract
The innovation study of Pickup and Delivery Problem (PDP) is to implement Hub-Exchange in handling the Urgent Transfer of Medical Record folders in Hospital. The urgent transfer process from one department to another is necessary for patients who visit more than one department in one day. The Hub-Exchange procedure may reduce the Couriers'' workload and Patients'' waiting time simultaneously. Hub exchange is the activity when couriers doing the transshipment exchange folders for far regions with another courier in Hub/depot.
The comparison between existing procedure (Policy I) and Hub-Exchange procedure (Policy II) is based on 3 different time periods in one month data for representing different levels of couriers’ workload. The comparison makes use of the heuristics methods of Nearest Neighbor Algorithm. The simulation running 30 minute time interval and the request data will be divided into three groups of couriers’ territory. The route starts from depot and return to depot after completing the job. There are different estimation methods of Complete Tour and Waiting Time calculation between Policy I and Policy II. As the result of Hub-Exchange procedure increases the working efficiency between couriers, which shown by the workload more evenly, decreased of couriers’ workload, and the shorter time needed to complete the job.
Subjects
Pickup and Delivery Problem
Hub-Exchange
Heuristics
Nearest Neighbor Algorithm.
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-100-R98546038-1.pdf
Size
23.54 KB
Format
Adobe PDF
Checksum
(MD5):a2c2efb836e1883dc2f9833410be695e
