Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

Abstract

As we all know, there are a great number of optimization problems in the world. One of the relatively complicated and highlevel problems is the vehicle routing problem (VRP). Dynamic vehicle routing problem (DVRP) is a major variant of VRP, and it is closer to real logistic scene. In DVRP, the customers' demands appear with time, and the unserved customers' points must be updated and rearranged while carrying out the programming paths. Owing to the complexity and significance of the problem, DVRP applications have grabbed the attention of researchers in the past two decades. In this paper, we have two main contributions to solving DVRP. Firstly, DVRP is solved with enhanced Ant Colony Optimization (E-ACO), which is the traditional Ant Colony Optimization (ACO) fusing improved K-means and crossover operation. K-means can divide the region with the most reasonable distance, while ACO using crossover is applied to extend search space and avoid falling into local optimum prematurely. Secondly, several new evaluation benchmarks are proposed, which can objectively and comprehensively estimate the proposed method. In the experiment, the results for different scale problems are compared to those of previously published papers. Experimental results show that the algorithm is feasible and efficient.

Intelligent Malware Detection Using a Neural Network Ensemble Based on a Hybrid Search Mechanism

“…The neural network ensemble using a memetic algorithm (NNE-MA) is compared with well-known optimisation techniques on a similar set of datasets. The techniques are genetic algorithm (GA) (Amjad et al, 2018), ant colony optimisation (ACO) (Xu et al, 2018), and particle swarm optimisation (PSO) (Liu, Li & Zhu, 2019). The neural network ensemble is then combined with each of these techniques for feature selection optimisation, which results in, respectively, the NNE-GA, NNE-ACO, and NNE-PSO convergence comparisons, as shown in Figure 4.…”

Modeling Ant Colony Optimization for Multi-Agent based Intelligent Transportation System

“…A significant number of researches are conducted using ACO for path detections and routing decisions. For instance, strategy for optimal truss design [23], solution of TSP (Travelling Salesman Problem) [24], optimization for the asymmetric travelling system [25], and Dynamic Vehicle Routing Problem analysis [26] [27]. Previously, our ITMS system was used to find optimum routes using the Dijkstra algorithm, and there was no real-time simulation to visualize the optimum path.…”

Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem

“…And this problem is the extension of the vehicle routing problem. Other extension problems include dynamic vehicle routing problem and stochastic time-dependent vehicle routing problem (see, e.g., Xu, Pu, and Duan [6]; Sun, Duan, and Yang [7]). In order to improve customers' satisfaction, many smallpackage shipping companies focus on service consistency, which attracts scholars' attention as well.…”