WSEAS Transactions on Systems
Print ISSN: 1109-2777, E-ISSN: 2224-2678
Volume 19, 2020
Solving Multiple Vehicle Routing Problems with Time Constraints by Flower Pollination Algorithm Optimization
Author:
Abstract: he multiple vehicle routing problem (MVRP) with the time constraint is one of the most important real-world problems in industrial and logistic engineering. The MVRP problems can be considered as a class of the non-polynomial (NP) time-complete combinatorial optimization problem. Such the MVRP problems aim to find the set of routes with the shortest total distance for overall minimum route cost serving all the given demands by the fleet of vehicles. Based on modern optimization, the MVRP problems can be optimally solved by the potential metaheuristic optimization techniques. The flower pollination algorithm (FPA) is one of the most efficient metaheuristic optimizers proposed for solving the combinatorial optimization problems. With few searching parameters, the algorithm of the FPA is not complex and ease of use. In this paper, the FPA is applied to solve five selected benchmark MVRP problems with the time constraints consisting of 50-100 destinations. Results obtained by the FPA will be compared with those obtained by genetic algorithm (GA), tabu search (TS) and particle swarm optimization (PSO). From results, the FPA can provide optimal solutions of all five selected problems. Optimal results obtained by the FPA are superior to PSO, TS and GA, respectively, with shorter total distance and computational time consumed.
Search Articles
Keywords: Multiple Vehicle Routing Problem, Flower Pollination Algorithm, Time Constraint, Metaheuristic Optimizer
Pages: 178-187
DOI: 10.37394/23202.2020.19.23