scholarly journals A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows

2010 ◽  
Vol 6 (2) ◽  
pp. 435-451 ◽  
Author(s):  
Ming-Yong Lai ◽  
◽  
Chang-Shi Liu ◽  
Xiao-Jiao Tong ◽  
◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Pickup And Delivery ◽  
Delivery Vehicle ◽  
Two Stage ◽  
Routing Problem

Optimization of the simultaneous pickup and delivery vehicle routing problem based on carbon tax

2019 ◽  
Vol 119 (9) ◽  
pp. 2055-2071 ◽  
Author(s):  
Gaoyuan Qin ◽  
Fengming Tao ◽  
Lixia Li ◽  
Zhenyu Chen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Carbon Tax ◽  
Pickup And Delivery ◽  
Vehicle Speed ◽  
Low Carbon ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Content Type ◽  
Simultaneous Pickup And Delivery

Purpose In order to reduce logistics transportation costs and respond to low-carbon economy, the purpose of this paper is to study the more practical and common simultaneous pickup and delivery vehicle routing problem, which considers the carbon tax policy. A low-carbon simultaneous pickup and delivery vehicle routing problem model is constructed with the minimum total costs as the objective function. Design/methodology/approach This study develops a mathematical optimization model with the minimum total costs, including the carbon emissions costs as the objective function. An adaptive genetic hill-climbing algorithm is designed to solve the model. Findings First, the effectiveness of the algorithm is verified by numerical experiments. Second, the research results prove that carbon tax mechanism can effectively reduce carbon emissions within effective carbon tax interval. Finally, the research results also show that, under the carbon tax mechanism, the effect of vehicle speed on total costs will become more obvious with the increase of carbon tax. Research limitations/implications This paper only considers the weight of the cargo, but it does not consider the volume of the cargo. Originality/value Few studies focus on environmental issues in the simultaneous pickup and delivery problem. Thus, this paper constructs a green path optimization model, combining the carbon tax mechanism for the problem. This paper further analyzes the impact of carbon tax value on total costs and carbon emission; at the same time, the effect of vehicle speed on total cost is also analyzed.

scholarly journals DESIGN OF WASTE VEGETABLE OIL COLLECTION NETWORKS APPLYING VEHICLE ROUTING PROBLEM AND SIMULTANEOUS PICKUP AND DELIVERY

2020 ◽  
Vol 7 (4) ◽  
pp. 261-268
Author(s):  
Lisandra Quintana ◽  
Yalexa Herrera-Mena ◽  
José-Luis Martínez-Flores ◽  
Marcos Coronado ◽  
Gisela Montero ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vegetable Oil ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Capacity Utilization ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Time Restrictions ◽  
Waste Vegetable Oil ◽  
Simultaneous Pickup And Delivery

The growth of industrialization in Mexico has caused an increase in the demand for materials to satisfy the consumption of goods and services of a growing population. Given this scenario, there is a rise of the residual generation with affectations on the ecosystem and population health. Hence, the objective of this research was to design a network for waste vegetable oil collection based on vehicle routing problem with simultaneous pickup and delivery, starting from a distribution centre to 49 restaurants, as the generation sources of waste vegetable oil. The Vehicle Routing Problem Simultaneous Pickup and Delivery with Time Windows was the variant used as a vehicle routing method to solve the problem. The free software VPRPD was the tool used to solve the vehicle routing problem with simultaneous pickup and delivery that allowed to specify time restrictions. This software uses the simulated annealing metaheuristics in its syntax. As a result, it was obtained a total of 8 networks, for a vehicle capacity utilization of 70 percent in the 6 t vehicle and 46 percent in the 8 t vehicle.

Genetic scatter search algorithm to solve the one-commodity pickup and delivery vehicle routing problem

2017 ◽  
Vol 12 (1) ◽  
pp. 2-18 ◽  
Author(s):  
Jalel Euchi
Keyword(s):  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Scatter Search ◽  
Pickup And Delivery ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Content Type ◽  
New Variant ◽  
Crossover And Mutation

Purpose In this paper, the author introduces a new variant of the pickup and delivery transportation problem, where one commodity is collected from many pickup locations to be delivered to many delivery locations within pre-specified time windows (one–to many–to many). The author denotes to this new variant as the 1-commodity pickup-and-delivery vehicle routing problem with soft time windows (1-PDVRPTW). Design/methodology/approach The author proposes a hybrid genetic algorithm and a scatter search to solve the 1-PDVRPTW. It proposes a new constructive heuristic to generate the initial population solution and a scatter search (SS) after the crossover and mutation operators as a local search. The hybrid genetic scatter search replaces two steps in SS with crossover and mutation, respectively. Findings So, the author proposes a greedy local search algorithm as a metaheuristic to solve the 1-PDVRPTW. Then, the author proposes to hybridize the metaheuristic to solve this variant and to make a good comparison with solutions presented in the literature. Originality/value The author considers that this is the first application in one commodity. The solution methodology based on scatter search method combines a set of diverse and high-quality candidate solutions by considering the weights and constraints of each solution.

Sign in / Sign up

Export Citation Format

Share Document