The paired many-to-many pickup and delivery problem: an application

Huey Kuo Chen, Huey Wen Chou, Che Fu Hsueh, Yen Ju Yu

研究成果: 雜誌貢獻期刊論文同行評審

6 引文 斯高帕斯(Scopus)

摘要

This paper addresses a variation of pickup and delivery problems, named the paired many-to-many pickup and delivery problem (PMPDP), which has never been formally classified in the literature. Given “paired” demands between customer nodes, the PMPDP is to find a set of feasible vehicle routes starting from and ending at the depot such that the constructed objective function can be optimized subject to a set of desired constraints. When the PMPDP is applied to public library delivery operations, interchangeably used with the library vehicle routing problem (LVRP) hereafter, the customer nodes are replaced by library branches and the items to be delivered and picked up become books, videos and materials. To explore the LVRP, a mathematical model is rigorously formulated and a two-stage solution algorithm involving a modified bee colony optimization method is elaborately developed. Using real data from the San Francisco library system, the computational results show that our approach performs fairly well as compared with those approaches that have appeared in the literature. Provided each customer node is visited once, the sensitivity analysis indicates that when the number of dispatched library vehicles is more than what are needed, then the obtained result may get worse.

原文???core.languages.en_GB???
頁(從 - 到)220-243
頁數24
期刊TOP
23
發行號1
DOIs
出版狀態已出版 - 4月 2015

指紋

深入研究「The paired many-to-many pickup and delivery problem: an application」主題。共同形成了獨特的指紋。

引用此