scholarly journals Tighter Analysis of an Approximation for the Cumulative VRP

2017 ◽  
Author(s):  
Mauro Henrique Mulati ◽  
Flávio Keidi Miyazawa
Keyword(s):  
Vehicle Routing ◽  
Fuel Consumption ◽  
Vehicle Routing Problem ◽  
Scaling Factor ◽  
Traveling Salesperson Problem ◽  
Routing Problem

We deal with the cumulative vehicle routing problem (VRP), a generalization of the capacitated VRP, which objective is to minimize the fuel consumption. Gaur et al. in 2013 gave a 4-approximation based on a well-known partition heuristic to the traveling salesperson problem (TSP). We present a tighter analysis obtaining a 4 3s34Q2 -approximation, where Q is the capacity of the vehicle and s is a scaling factor. To the best of our knowledge, this is the best proved approximation for the cumulative VRP so far.

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 Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2082
Author(s):  
Dengkai Hou ◽  
Houming Fan ◽  
Xiaoxue Ren
Keyword(s):  
Energy Consumption ◽  
Vehicle Routing ◽  
Fuel Consumption ◽  
Vehicle Routing Problem ◽  
Joint Distribution ◽  
Road Network ◽  
Time Dependent ◽  
Neighborhood Search ◽  
Routing Problem ◽  
The Road

This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the road network speed in the distribution area, considering the influence of the road network on the vehicle speed and the relationship between vehicle load and fuel consumption, a multi-depot joint distribution vehicle routing optimization model is established to minimize the sum of vehicle fixed cost, fuel consumption cost and time window penalty cost. Traditional vehicle routing problems are modeled based on symmetric graphs. In this paper, considering the influence of time-dependent networks on routes optimization, modeling is based on asymmetric graphs, which increases the complexity of the problem. A hybrid genetic algorithm with variable neighborhood search (HGAVNS) is designed to solve the model, in which the nearest neighbor insertion method and Logistic mapping equation are used to generate the initial solution firstly, and then five neighborhood structures are designed to improve the algorithm. An adaptive neighborhood search times strategy is used to balance the diversification and depth search of the population. The effectiveness of the designed algorithm is verified through several groups of numerical instances with different scales. The research can enrich the relevant theoretical research of multi-depot vehicle routing problems and provide the theoretical basis for transportation enterprises to formulate reasonable distribution schemes.

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.

Vehicle routing problem solution considering minimising fuel consumption

2015 ◽  
Vol 9 (5) ◽  
pp. 523-529 ◽  
Author(s):  
Enjian Yao ◽  
Zhifeng Lang ◽  
Yongsheng Zhang ◽  
Yang Yang
Keyword(s):  
Vehicle Routing ◽  
Fuel Consumption ◽  
Vehicle Routing Problem ◽  
Problem Solution ◽  
Routing Problem

scholarly journals Performance Comparison of Two-phase LP-based Heuristic Methods for Capacitated Vehicle Routing Problem with Three Objectives

2020 ◽  
Vol 24 (5) ◽  
pp. 145-159
Author(s):  
Sophea Horng ◽  
Pisal Yenradee
Keyword(s):  
Vehicle Routing ◽  
Fuel Consumption ◽  
Vehicle Routing Problem ◽  
Experimental Results ◽  
Personal Relationships ◽  
Heuristic Methods ◽  
Two Phase ◽  
Routing Problem ◽  
Clustering Model ◽  
Capacitated Vehicle

This paper develops a two-phase LP-based heuristic for the Capacitated Vehicle Routing Problem (CVRP). It considers three objectives: (1) minimizing the total costs of fuel consumption and overtime, (2) maximizing the total personal relationships between customers and drivers, and (3) balancing the delivery weights of vehicles. The two-phase LP-based heuristic (cluster-first route-second) is proposed. First, in the clustering stage, three LP-based clustering models (denoted by C1, C2, and C3) are developed. Customers are grouped into clusters based on real distances between the customers for C1, personal relationships between the customers and drivers for C2, and the delivery weights of vehicles for C3. Second, in the routing stage, an LP-based traveling salesman problem model is used to form a route for each cluster, to minimize the total costs of fuel consumption and overtime labor. The experimental results from a case study of Thai SMEs show that when the C2 clustering model is applied, the performances are the best. Significant contributions of this paper include: (1) it is an original paper that proposes the C2 clustering model, and it has the best performances based on the experimental results, and (2) the proposed two-phase LP-based heuristic methods are suitable for practical use by SMEs since the required computational time is short, and it has multiple models with different objectives that can be selected to match a user's requirements.

Sign in / Sign up

Export Citation Format

Share Document