Name
Abstract | ||
|---|---|---|
In this research we present the design and implementation of heuristics for solving split-delivery pickup and delivery time
window problems with transfer (SDPDTWP) of shipments between vehicles for both static and real-time data sets. In the SDPDTWP
each shipment is constrained with the earliest possible pickup time from the origin and the latest acceptable delivery time
to a destination. Split-deliveries occur when two or more vehicles service the same origin or destination. The proposed heuristics
were applied to both static and real-time data sets. The heuristics computed a solution, in a few seconds, for a static problem
from the literature, achieving an improvement of 60% in distance in comparison to the published solution. In the real-time
SDPDTWP problems, requests for pickup and delivery of a package, breakdown of a truck or insertion of a truck can occur after
the vehicle has left the origin and is enroute to service the customers. Thirty data sets, each consisting of one to seven
real-time customer or truck events, were used to test the efficiency of the heuristics. The heuristics obtained solutions
to real-time data sets in under five seconds of CPU time. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10100-007-0035-x | CEJOR |
Keywords | Field | DocType |
Vehicle routing,Real-time,Pickup and delivery,Split-delivery,Dial-a-ride,R40 | Truck,Vehicle routing problem,Economics,Data set,CPU time,Real-time computing,Heuristics,Pickup,Operations management | Journal |
Volume | Issue | ISSN |
15 | 4 | 1435-246X |
Citations | PageRank | References |
13 | 0.81 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sam R. Thangiah | 1 | 117 | 12.52 |
| Adel Fergany | 2 | 13 | 0.81 |
| Salman Awan | 3 | 13 | 0.81 |