A hybrid algorithm for three-dimensional loading capacitated vehicle routing problems with time windows

2020 ◽  
Author(s):  
Yingjing Yan ◽  
Jinxiu Chen ◽  
Hongyi Huang ◽  
Shuangyuan Yang
Keyword(s):  
Vehicle Routing ◽  
Hybrid Algorithm ◽  
Time Windows ◽  
Three Dimensional ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Capacitated Vehicle

An Intelligent Water Drop Algorithm for Solving Multi-Objective Vehicle Routing Problems With Mixed Time Windows

2019 ◽  
Vol 10 (1) ◽  
pp. 82-104 ◽  
Author(s):  
Tao Wang ◽  
Jing Ni ◽  
Yixuan Wang
Keyword(s):  
Vehicle Routing ◽  
Hybrid Algorithm ◽  
Water Drop ◽  
Time Windows ◽  
Continuous Optimization ◽  
Vehicle Routing Problems ◽  
Basic Algorithm ◽  
Routing Problems ◽  
Multi Objective ◽  
Minimum Number

This article proposes an Intelligent Water Drop Algorithm for solving Multi-Objective Vehicle Routing Problems by considering the constraints of vehicle volume, delivery mileage, and mixed time windows and minimizing the cost of distribution and the minimum number of vehicles. This article improves the basic Intelligent Water Drop Algorithm and show the improved intelligent water droplet genetic hybrid algorithm is an effective method for solving discrete problems. The authors present a practical example and show the applicability of the proposed algorithm. The authors compare the algorithms with the basic algorithm and show the improved intelligent droplet genetic hybrid algorithm has higher computing efficiency and continuous optimization capability.

An adaptive hybrid algorithm for vehicle routing problems with time windows

2017 ◽  
Vol 113 ◽  
pp. 382-391 ◽  
Author(s):  
Esam Taha Yassen ◽  
Masri Ayob ◽  
Mohd Zakree Ahmad Nazri ◽  
Nasser R. Sabar
Keyword(s):  
Vehicle Routing ◽  
Hybrid Algorithm ◽  
Time Windows ◽  
Vehicle Routing Problems ◽  
Routing Problems

scholarly journals A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Yucheng Kao ◽  
Ming-Hsien Chen ◽  
Yi-Ting Huang
Keyword(s):  
Swarm Intelligence ◽  
Vehicle Routing ◽  
Hybrid Algorithm ◽  
Optimization Problem ◽  
Benchmark Problems ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Logistic Management ◽  
Capacitated Vehicle

The vehicle routing problem (VRP) is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence (SI) approaches, ant colony optimization (ACO) and particle swarm optimization (PSO), for solving capacitated vehicle routing problems (CVRPs). In the proposed algorithm, each artificial ant, like a particle in PSO, is allowed to memorize the best solution ever found. After solution construction, only elite ants can update pheromone according to their own best-so-far solutions. Moreover, a pheromone disturbance method is embedded into the ACO framework to overcome the problem of pheromone stagnation. Two sets of benchmark problems were selected to test the performance of the proposed algorithm. The computational results show that the proposed algorithm performs well in comparison with existing swarm intelligence approaches.

scholarly journals Self-imposed time windows in vehicle routing problems

OR Spectrum ◽  
2013 ◽  
Vol 37 (2) ◽  
pp. 331-352 ◽  
Author(s):  
Ola Jabali ◽  
Roel Leus ◽  
Tom Van Woensel ◽  
Ton de Kok
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Vehicle Routing Problems ◽  
Routing Problems
Sign in / Sign up

Export Citation Format

Share Document