scholarly journals Route Optimization of Electric Vehicle considering Soft Time Windows and Two Ways of Power Replenishment

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Ming Meng ◽  
Yun Ma
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Ant Colony Algorithm ◽  
Time Windows ◽  
Transportation Cost ◽  
Ant Colony ◽  
Route Optimization ◽  
Research Experience ◽  
Penalty Cost ◽  
Routing Optimization

Under the background of severe air pollution and energy shortage, electric vehicles (EVs) are promising vehicles to support green supply chain and clean production. In the world, the renewal of EVs has become a general trend. Therefore, the concern about EVs is a hot issue at present, but EVs have the characteristics of limited driving distance and long charging time. When the EVs are used in logistics transportation, these characteristics have a significant impact on the vehicle routing problems. Therefore, based on the research experience of traditional vehicle routing optimization, combining with the characteristics of EVs, this paper presents an optimal problem of electric vehicle routes with time windows based on two charging methods and it also designs a mathematical model which was caused by early and late arrival as the objective function to minimize the transportation cost, vehicle use cost, power supply cost, and penalty cost. The model is solved using an ant colony algorithm. Finally, the ant colony algorithm is tested and analysed with an example.

Research on Vehicle Routing Optimization Based on Improved Ant Colony Algorithm

2013 ◽  
Vol 385-386 ◽  
pp. 1917-1920
Author(s):  
Rui Wang ◽  
Zai Tang Wang
Keyword(s):  
Vehicle Routing ◽  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Route Optimization ◽  
Local Optimum ◽  
Evaporation Coefficient ◽  
Logistics Distribution ◽  
Routing Optimization ◽  
Vehicle Routing Optimization

This paper analyzes the domestic and international logistics distribution route optimization problem and the research status of ant colony algorithm, illustrates the problems existing in the logistics distribution now. It reflects the necessity to research on the vehicle routing optimization problem. In order to increasing the ant colony algorithm’s convergence speed and avoiding to fall into local optimum, we improve the pheromone evaporation coefficient and visibility to optimize the searching ability, which can avoid premature convergence and stagnation.

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem

2014 ◽  
Vol 556-562 ◽  
pp. 4693-4696
Author(s):  
Yue Li Li ◽  
Ai Hua Ren
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Ant Colony System ◽  
Routing Problem ◽  
Logistics Industry ◽  
Routing Optimization ◽  
Constrained Vehicle Routing ◽  
Capacity Constrained

With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, the use of hybrid heuristic optimization can greatly improve the efficiency of the solution. The algorithm produces high-quality solutions for the capacity-constrained vehicle routing problem.

A Methodology and Modelling Technique for Taxi Path Optimization

2013 ◽  
Vol 711 ◽  
pp. 816-821
Author(s):  
Zhi Ping Hou ◽  
Feng Jin ◽  
Qin Jian Yuan ◽  
Yong Yi Li
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Route Optimization ◽  
Routing Problem ◽  
Control Center ◽  
Material Resources ◽  
New Type

Vehicle Routing Problem (VRP) is a typical combinatorial optimization problem. A new type of bionic algorithm-ant colony algorithm is very appropriate to solve Vehicle Routing Problem because of its positive feedback, robustness, parallel computing and collaboration features. In view of the taxi route optimization problem, this article raised the issue of the control of the taxi, by using the Geographic Information System (GIS), through the establishment of the SMS platform and reasonable taxi dispatch control center, combining ant colony algorithm to find the most nearest no-load taxi from the passenger, and giving the no-load taxi the best path to the passenger. Finally this paper use Ant Colony laboratory to give the simulation. By using this way of control, taxis can avoid the no-load problem effectively, so that the human and material resources can also achieve savings.

A Improved Pareto of Ant Colony Algorithm to Solve the Vehicle Routing Problem with Time Windows

2014 ◽  
Vol 1030-1032 ◽  
pp. 1941-1944
Author(s):  
Hong Dou Zhang ◽  
Ning Guo ◽  
Jian Lin Mao ◽  
Hai Feng Wang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Transition Probability ◽  
Time Windows ◽  
Optimal Solution ◽  
Ant Colony ◽  
Local Optimum ◽  
Routing Problem ◽  
Important Extension

Vehicle routing problem with time Windows (VRPTW) that is a kind of important extension type for VPR. In view of problem which the ant colony algorithm in solving VRPTW easily plunged into local optimum , this paper defines a new ant transition probability of saving ideas, and uses the Pareto optimal solution set of global pheromone updating rule, and puts forward a kind of improved Pareto ant colony algorithm (IPACA) . Through the simulation experiments show that IPACA improves the global search ability of ACA, effectively avoids the algorithm falls into local optimum, and reduces the total distribution cost (distance), so as to verify the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document