Name
Abstract | ||
|---|---|---|
The problem addressed in this paper-the linehaul-feeder vehicle routing problem with virtual depots (LFVRP-VD)-can be regarded as an extension of the vehicle routing problem. During delivery operation, one large vehicle departs from the physical depot (PD) and services all virtual depots (VDs). A set of small vehicles delivers to customers and, if necessary, reloads either from the PD or from the large vehicle at a VD before continuing work. The objective of the operation is to minimize the total travel and waiting costs for all vehicles. Two heuristics that embed the cost-sharing method and the threshold method are proposed for initial solution construction. Seventeen test problems are extensively examined. The results show that the cost-sharing method outperforms the threshold method in terms of several selected performance measures. In addition, the more candidates available a VD can choose, the better the obtained objective value. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TASE.2011.2142304 | IEEE T. Automation Science and Engineering |
Keywords | Field | DocType |
Combinatorial mathematics,Routing,Logistics,Urban areas | Mathematical optimization,Vehicle routing problem,Combinatorial mathematics,Computer science,Goods distribution,Heuristics | Journal |
Volume | Issue | ISSN |
8 | 4 | 1545-5955 |
Citations | PageRank | References |
7 | 0.45 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huey-Kuo Chen | 1 | 65 | 5.24 |
| Huey-Wen Chou | 2 | 106 | 11.61 |
| Che-fu Hsueh | 3 | 59 | 4.72 |
| Tsung-Yu Ho | 4 | 16 | 2.78 |