OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm

2016 ◽  
Vol 29 (10) ◽  
pp. 955-968 ◽  
Author(s):  
Ali Asghar Rahmani Hosseinabadi ◽  
Javad Vahidi ◽  
Valentina Emilia Balas ◽  
Seyed Saeid Mirkamali
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Local Search Algorithm ◽  
Routing Problem ◽  
Open Vehicle Routing Problem ◽  
Open Vehicle Routing

scholarly journals An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

2008 ◽  
Vol 156 (11) ◽  
pp. 2050-2069 ◽  
Author(s):  
Toshihide Ibaraki ◽  
Shinji Imahori ◽  
Koji Nonobe ◽  
Kensuke Sobue ◽  
Takeaki Uno ◽  
...  
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Penalty Functions ◽  
Local Search Algorithm ◽  
Routing Problem

scholarly journals An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Weizhen Rao ◽  
Feng Liu ◽  
Shengbin Wang
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Fuel Consumption ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Classical Model ◽  
Mixed Integer ◽  
Local Search Algorithm ◽  
Routing Problem ◽  
Total Vehicle

The classical model of vehicle routing problem (VRP) generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP) becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient. Complexity analysis of FCVRP is presented through analogy with the capacitated VRP. To tackle the FCVRP’s computational intractability, we propose an efficient two-objective hybrid local search algorithm (TOHLS). TOHLS is based on a hybrid local search algorithm (HLS) that is also used to solve FCVRP. Based on the Golden CVRP benchmarks, 60 FCVRP instances are generated and tested. Finally, the computational results show that the proposed TOHLS significantly outperforms the HLS.

scholarly journals A Hybrid Tabu Search Algorithm for a Real-World Open Vehicle Routing Problem Involving Fuel Consumption Constraints

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Yunyun Niu ◽  
Zehua Yang ◽  
Ping Chen ◽  
Jianhua Xiao
Keyword(s):  
Vehicle Routing ◽  
Fuel Consumption ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Routing Problem ◽  
Total Cost ◽  
Open Vehicle Routing Problem ◽  
Outsourcing Logistics ◽  
Consumption Constraints ◽  
Open Vehicle Routing

Outsourcing logistics operation to third-party logistics has attracted more attention in the past several years. However, very few papers analyzed fuel consumption model in the context of outsourcing logistics. This problem involves more complexity than traditional open vehicle routing problem (OVRP), because the calculation of fuel emissions depends on many factors, such as the speed of vehicles, the road angle, the total load, the engine friction, and the engine displacement. Our paper proposed a green open vehicle routing problem (GOVRP) model with fuel consumption constraints for outsourcing logistics operations. Moreover, a hybrid tabu search algorithm was presented to deal with this problem. Experiments were conducted on instances based on realistic road data of Beijing, China, considering that outsourcing logistics plays an increasingly important role in China’s freight transportation. Open routes were compared with closed routes through statistical analysis of the cost components. Compared with closed routes, open routes reduce the total cost by 18.5% with the fuel emissions cost down by nearly 29.1% and the diver cost down by 13.8%. The effect of different vehicle types was also studied. Over all the 60- and 120-node instances, the mean total cost by using the light-duty vehicles is the lowest.

Sign in / Sign up

Export Citation Format

Share Document