An urban transportation problem solved by parallel programming with hyper-heuristics
- 18 January 2019
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 51 (11) , 1965-1979
Abstract
An innovative optimization strategy by means of hyper-heuristics is proposed. It consists of a parallel combination of three metaheuristics. In view of the need both to escape from local optima and to achieve high diversity, the algorithm cooperatively combines simulated annealing with genetic algorithms and ant colony optimization. A location routing problem (LRP), which aims at the design of transport networks, was adopted for the performance evaluation of the proposed algorithm. Information exchanges took place effectively between the metaheuristics and speeded up the search process. Moreover, the parallel implementation was useful since it allowed several metaheuristics to run simultaneously, thus achieving a significant reduction in the computational time. The algorithmic efficiency and effectiveness were ratified for a medium-sized city. The proposed optimization algorithm not only accelerated computations, but also helped to improve solution quality.Keywords
This publication has 26 references indexed in Scilit:
- Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depotsTransportation Research Part B: Methodological, 2014
- Hyper-heuristics: a survey of the state of the artJournal of the Operational Research Society, 2013
- A taxonomical analysis, current methods and objectives on location‐routing problemsInternational Transactions in Operational Research, 2013
- Hyper-heuristic approaches for the response time variability problemEuropean Journal of Operational Research, 2011
- A Classification of Hyper-heuristic Approaches2010
- Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search HeuristicTransportation Science, 2007
- Transit Route Network Design Using Parallel Genetic AlgorithmJournal of Computing in Civil Engineering, 2004
- A two-phase tabu search approach to the location routing problemEuropean Journal of Operational Research, 1999
- Genetic AlgorithmsScientific American, 1992
- Optimization by Simulated AnnealingScience, 1983