The capacitated pollution routing problem with pickup and delivery in the last mile

被引:14
|
作者
Tan, Yuyang [1 ]
Deng, Lei [1 ]
Li, Longxiao [1 ]
Yuan, Fang [1 ]
机构
[1] Chongqing Univ, Coll Mech Engn, Chongqing, Peoples R China
关键词
Home delivery and pickup site services; Hybrid two-phase algorithm; Pollution-routing problem; FUEL CONSUMPTION; GENETIC ALGORITHM; OPTIMIZATION; SEARCH; MODEL;
D O I
10.1108/APJML-06-2018-0217
中图分类号
F [经济];
学科分类号
02 ;
摘要
Purpose With the increasing awareness of global warming and the important role of last mile distribution in logistics activities, the purpose of this paper is to build an environmental and effective last mile distribution model considering fuel consumption and greenhouse gas emission, vehicle capacity and two practical delivery service options: home delivery (HD) and pickup site service (PS). This paper calls the problem as the capacitated pollution-routing problem with pickup and delivery (CPRPPD). The goal is to find an optimal route to minimize operational and environmental costs, as well as a set of optimal speeds over each arc, while respecting capacity constraints of vehicles and pickup sites. Design/methodology/approach To solve this problem, this research proposes a two-phase heuristic algorithm by combining a hybrid ant colony optimization (HACO) in the first stage and a multiple population genetic algorithm in the second stage. First, the HACO is presented to find the minimal route solution and reduce distribution cost based on optimizing the speed over each arc. Findings To verify the proposed CPRPPD model and algorithm, a real-world instance is conducted. Comparing with the scenario including HD service only, the scenario including both HD and PS option is more economical, which indicates that the CPRPPD model is more efficient. Besides, the results of speed optimization are significantly better than before. Practical implications - The developed CPRPPD model not only minimizes delivery time and reduces the total emission cost, but also helps logistics enterprises to establish a more complete distribution system and increases customer satisfaction. The model and algorithm of this paper provide optimal support for the actual distribution activities of logistics enterprises in low-carbon environment, and also provide reference for the government to formulate energy-saving and emission reduction policies. Originality/value This paper provides a great space for the improvement of carbon emissions in the last mile distribution. The results show that the distribution arrangement including HD and PS services in the last mile adopting speed optimization can significantly reduce the carbon emission. Additionally, an integrated real-world instance is applied in this paper to illustrate the validity of the model and the effectiveness of this method.
引用
收藏
页码:1193 / 1215
页数:23
相关论文
共 50 条
  • [31] Model and algorithm for bilevel multisized terminal location-routing problem for the last mile delivery
    Zhou, Lin
    Lin, Yun
    Wang, Xu
    Zhou, Fuli
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (01) : 131 - 156
  • [32] The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode
    Li, Yali
    Yang, Jun
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 190
  • [33] The multi-vehicle truck-and-robot routing problem for last-mile delivery
    Ostermeier, Manuel
    Heimfarth, Andreas
    Huebner, Alexander
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 310 (02) : 680 - 697
  • [34] Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery
    Setareh Majidi
    Seyyed-Mahdi Hosseini-Motlagh
    Joshua Ignatius
    [J]. Soft Computing, 2018, 22 : 2851 - 2865
  • [35] From the Last Mile to the Last 800 ft Key Factors in Urban Pickup and Delivery of Goods
    Butrina, Polina
    Giron-Valderrama, Gabriela del Carmen
    Machado-Leon, Jose Luis
    Goodchild, Anne
    Ayyalasomayajula, Pramod C.
    [J]. TRANSPORTATION RESEARCH RECORD, 2017, (2609) : 85 - 92
  • [36] Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery
    Majidi, Setareh
    Hosseini-Motlagh, Seyyed-Mahdi
    Ignatius, Joshua
    [J]. SOFT COMPUTING, 2018, 22 (09) : 2851 - 2865
  • [37] Deep Reinforcement Learning for the Capacitated Pickup and Delivery Problem with Time Windows
    Soroka, A. G.
    Meshcheryakov, A. V.
    Gerasimov, S. V.
    [J]. PATTERN RECOGNITION AND IMAGE ANALYSIS, 2023, 33 (02) : 169 - 178
  • [38] Deep Reinforcement Learning for the Capacitated Pickup and Delivery Problem with Time Windows
    A. G. Soroka
    A. V. Meshcheryakov
    S. V. Gerasimov
    [J]. Pattern Recognition and Image Analysis, 2023, 33 : 169 - 178
  • [39] Inventory routing for the last mile delivery of humanitarian relief supplies
    Ekici, Ali
    Ozener, Okan Orsan
    [J]. OR SPECTRUM, 2020, 42 (03) : 621 - 660
  • [40] Inventory routing for the last mile delivery of humanitarian relief supplies
    Ali Ekici
    Okan Örsan Özener
    [J]. OR Spectrum, 2020, 42 : 621 - 660