A teaching–learning-based optimization algorithm for the environmental prize-collecting vehicle routing problem

2021 ◽  
Author(s):  
Dimitra Trachanatzi ◽  
Manousos Rigakis ◽  
Magdalene Marinaki ◽  
Yannis Marinakis
Keyword(s):  
Vehicle Routing ◽  
Optimization Algorithm ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Teaching Learning Based Optimization ◽  
Prize Collecting ◽  
Teaching Learning

scholarly journals Current State of Dynamic Vehicle Routing Problems Solved by Ant Colony Optimization Algorithm

2021 ◽  
Vol 15 (3) ◽  
pp. 429-434
Author(s):  
Luka Olivari ◽  
Goran Đukić
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Optimization Algorithm ◽  
Vehicle Routing Problem ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Routing Problem ◽  
Solution Methods

Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the present, real-world problems. Heuristic methods are used to solve the problem as Vehicle Routing Problem is NP-hard. Among many different solution methods, the Ant Colony Optimization algorithm is proven to be the efficient solution when dealing with the dynamic version of the problem. Even though this problem is known to the scientific community for decades, the field is extremely active due to technological advancements and the current relevance of the problem. As various sub-types of routing problems and solution methods exist, there is a great number of possible problem-solution combinations and research directions. This paper aims to make a focused review of the current state in the field of Dynamic Vehicle Routing Problems solved by Ant Colony Optimization algorithm, to establish current trends in the field.

Sign in / Sign up

Export Citation Format

Share Document