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

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.

Pollution routing problem with time window and split delivery

In most classic vehicle routing problems, the main goal is to minimise the total travel time or distance while, the green vehicle routing problem, in addition to the stated objectives, also focuses on minimising fuel costs and greenhouse gas emissions, including carbon dioxide emissions. In this research, a new approach in Pollution Routing Problem (PRP) is proposed to minimise the CO2 emission by investigating vehicle weight fill level in length of each route. The PRP with a homogeneous fleet of vehicles, time windows, considering the possibility of split delivery and constraint of minimum shipment weight that must be on the vehicle in each route is investigated simultaneously. The mathematical model is developed and implemented using a simulated annealing algorithm which is programmed in MATLAB software. The generated results from all experiments demonstrated that the application of the proposed mathematical model led to the reduction in CO2 emission.