Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems

2020 ◽  
Vol 91 ◽  
pp. 103582 ◽  
Author(s):  
Xiaoshu Xiang ◽  
Jianfeng Qiu ◽  
Jianhua Xiao ◽  
Xingyi Zhang
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Ant Colony ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Demand Coverage

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.

scholarly journals Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems

10.29007/8tjs ◽  
2018 ◽  
Author(s):  
Zhengmao Ye ◽  
Habib Mohamadian
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Urban Areas ◽  
Ant Colony ◽  
Ant Colony System ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Single Vehicle

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different trips as long as the total time or distance is not exceeded. Various approaches are developed to solve the vehicle routing problem (VRP). Except for the simplest cases, VRP is always a computationally complex issue in order to optimize the objective function in terms or both time and expense. Ant colony optimization (ACO) has been introduced to solve the vehicle routing problem. The multiple ant colony system is proposed to search for alternative trails between the source and destination so as to minimize (fuel consumption, distance, time) among numerous geographically scattered routes. The objective is to design adaptive routing so as to balance loads among congesting city networks and to be adaptable to connection failures. As the route number increases, each route becomes less densely packed. It can be viewed as the vehicle scheduling problem with capacity constraints. The proposed scheme is applied to typical cases of vehicle routing problems with a single depot and flexible trip numbers. Results show feasibility and effectiveness of the approach.

Ant colony optimization for real-world vehicle routing problems

2007 ◽  
Vol 1 (2) ◽  
pp. 135-151 ◽  
Author(s):  
A. E. Rizzoli ◽  
R. Montemanni ◽  
E. Lucibello ◽  
L. M. Gambardella
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Real World ◽  
Ant Colony ◽  
Vehicle Routing Problems ◽  
Routing Problems
Sign in / Sign up

Export Citation Format

Share Document