WSEAS Transactions on Systems and Control
Print ISSN: 1991-8763, E-ISSN: 2224-2856
Volume 14, 2019
Optimal Solving Large Scale Traveling Transportation Problems by Flower Pollination Algorithm
Authors: ,
Abstract: The traveling transportation problem (TTP) is one of the classic algorithmic problems like the traveling salesman problem (TSP) in the field of computer science, operations research and logistics engineering. It has been classified as the NP-complete problems which can be effectively solved by metaheuristic searching techniques based on modern optimization context. Recently, the flower pollination algorithm (FPA) was developed and proposed as one of the most efficient population-based metaheuristic optimization searching techniques to solve continuous and combinatorial optimization problems. Moreover, the FPA’s algorithm is not complex. In this paper, the FPA is applied to solve the large scale traveling transportation problems (LsTTP) consisting of more than 500 destinations. The FPA is tested against six standard LsTTP problems from literatures. Results obtained by the FPA will be compared with those obtained by the genetic algorithm (GA) and the particle swarm optimization (PSO). As results, the FPA can provide optimal solutions for all selected LsTTP problems superior to GA and PSO within shorter computational time.
Search Articles
Keywords: Large Scale Traveling Transportation Problem, Flower Pollination Algorithm, Metaheuristics
Pages: 19-24
WSEAS Transactions on Systems and Control, ISSN / E-ISSN: 1991-8763 / 2224-2856, Volume 14, 2019, Art. #3