The linehaul-feeder vehicle routing problem with virtual depots

Huey Kuo Chen; Huey Wen Chou; Che Fu Hsueh; Tsung Yu Ho

doi:10.1109/TASE.2011.2142304

The linehaul-feeder vehicle routing problem with virtual depots

Huey Kuo Chen, Huey Wen Chou, Che Fu Hsueh, Tsung Yu Ho

Research output: Contribution to journal › Article › peer-review

20 Scopus citations

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.

Original language	English
Article number	5768043
Pages (from-to)	694-704
Number of pages	11
Journal	IEEE Transactions on Automation Science and Engineering
Volume	8
Issue number	4
DOIs	https://doi.org/10.1109/TASE.2011.2142304
State	Published - Oct 2011

Keywords

Cost-sharing method
logistics
threshold method
vehicle routing problem (VRP)
virtual depot (VD)

Access to Document

10.1109/TASE.2011.2142304

Cite this

@article{97ea8df2c4b94d24af782fb3de51cfbe,

title = "The linehaul-feeder vehicle routing problem with virtual depots",

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.",

keywords = "Cost-sharing method, logistics, threshold method, vehicle routing problem (VRP), virtual depot (VD)",

author = "Chen, {Huey Kuo} and Chou, {Huey Wen} and Hsueh, {Che Fu} and Ho, {Tsung Yu}",

note = "Funding Information: Manuscript received September 26, 2010; revised January 11, 2011; accepted March 20, 2011. Date of publication May 16, 2011; date of current version October 05, 2011. This paper was recommended for publication by Associate Editor D.-H. Lee and Editor Y. Narahari upon evaluation of the reviewers{\textquoteright} comments. This work was supported in part by the National Science Council, Taiwan, under Grant 97-2221-E-008-062-MY2.",

year = "2011",

month = oct,

doi = "10.1109/TASE.2011.2142304",

language = "???core.languages.en_GB???",

volume = "8",

pages = "694--704",

journal = "IEEE Transactions on Automation Science and Engineering",

issn = "1545-5955",

number = "4",

}

TY - JOUR

T1 - The linehaul-feeder vehicle routing problem with virtual depots

AU - Chen, Huey Kuo

AU - Chou, Huey Wen

AU - Hsueh, Che Fu

AU - Ho, Tsung Yu

N1 - Funding Information: Manuscript received September 26, 2010; revised January 11, 2011; accepted March 20, 2011. Date of publication May 16, 2011; date of current version October 05, 2011. This paper was recommended for publication by Associate Editor D.-H. Lee and Editor Y. Narahari upon evaluation of the reviewers’ comments. This work was supported in part by the National Science Council, Taiwan, under Grant 97-2221-E-008-062-MY2.

PY - 2011/10

Y1 - 2011/10

N2 - 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.

AB - 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.

KW - Cost-sharing method

KW - logistics

KW - threshold method

KW - vehicle routing problem (VRP)

KW - virtual depot (VD)

UR - http://www.scopus.com/inward/record.url?scp=80053629382&partnerID=8YFLogxK

U2 - 10.1109/TASE.2011.2142304

DO - 10.1109/TASE.2011.2142304

M3 - 期刊論文

AN - SCOPUS:80053629382

SN - 1545-5955

VL - 8

SP - 694

EP - 704

JO - IEEE Transactions on Automation Science and Engineering

JF - IEEE Transactions on Automation Science and Engineering

IS - 4

M1 - 5768043

ER -

The linehaul-feeder vehicle routing problem with virtual depots

Abstract

Keywords

Access to Document

Fingerprint

Cite this