https://scholars.lib.ntu.edu.tw/handle/123456789/607950
標題: | Branch-and-price for a combined order selection and distribution problem in online community group-buying of perishable products | 作者: | Yu B Shan W JIUH-BIING SHEU Diabat A. |
關鍵字: | Branch-and-price;Discrete split delivery;Multi-commodity;Multi-period;Perishability;Vehicle routing problem with profits;Costs;Deterioration;Electronic commerce;Integer programming;Pareto principle;Product design;Social networking (online);Branch and price;On-line communities;Routing problem with profits;Split delivery;Vehicle routing problem with profit;Vehicle Routing Problems;Vehicle routing | 公開日期: | 2022 | 卷: | 158 | 起(迄)頁: | 341-373 | 來源出版物: | Transportation Research Part B: Methodological | 摘要: | As a new social e-commerce model, online community group-buying of perishable products has been under examined. This paper addresses a real-world delivery problem faced in common by an online community group-buying operators, in which operators may suffer revenue loss from product deterioration during delivery. Since delivery quantities of candidate orders may be beyond capacity resources, this paper investigates a new combined order selection and periodic vehicle routing problem with time windows for perishable products. An online community group-buying operator can design daily online community group-buying delivery plan by deciding to serve which customers, to deliver which products and delivery quantities to be transported. To solve this problem, we propose a branch-and-price algorithm that strongly relies on a new label setting algorithm with partial label dominance and a strong bounding strategy based on the definition of Pareto-optimal delivery patterns. Since en-route delivery quantities depend on the interval between two consecutive services, our label setting algorithm is also applicable to the pricing subproblem for the discrete split delivery vehicle routing problem. We conduct a case study on a real-world instance and propose management insights into the structure of delivery plan facing inadequate capacity resources. Numerical experiments on 64 randomly generated instances demonstrate the effectiveness of the proposed branch-and-price algorithm. ? 2022 Elsevier Ltd |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125838257&doi=10.1016%2fj.trb.2022.03.001&partnerID=40&md5=58e6720b19583dc054840fa6bf315673 https://scholars.lib.ntu.edu.tw/handle/123456789/607950 |
ISSN: | 01912615 | DOI: | 10.1016/j.trb.2022.03.001 |
顯示於: | 工商管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。