The Problem Aware Local Search algorithm: an efficient technique for permutation-based problems
- 173 Downloads
In this article, we will examine whether the Problem Aware Local Search, an efficient method initially proposed for the DNA Fragment Assembly Problem, can also be used in other application domains and with other optimization problems. The main idea is to maintain the key features of PALS and apply it to different permutation-based combinatorial problems. In order to carry out a comprehensive analysis, we use a wide benchmark of well-known problems with different kinds of variation operators and fitness functions, such as the Quadratic Assignment Problem, the Flow Shop Scheduling Problem, and the Multiple Knapsack Problem. We also discuss the main design alternatives for building an efficient and accurate version of PALS for these problems in a competitive manner. In general, the results show that PALS can achieve high-quality solutions for these problems and do it efficiently.
KeywordsMetaheuristic Problem Aware Local Search Optimization problems Quadratic Assignment Problem Flow Shop Scheduling Problem Multiple Knapsack Problem
The first author is supported by the Universidad Nacional de La Pampa, and the ANPCYT under contract PICTO 2011-0278 and the Incentive Program. The second and third authors have been partially funded by Project Number 8.06/5.47.4142 in collaboration with the VSB-Technical University of Ostrava and by the Spanish MINECO Project TIN2014-57341-R (http://moveon.lcc.uma.es).
Compliance with ethical standards
Conflict of interest
All authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Abdelkafi O, Idoumghar L, Lepagnot J (2015) Distributed multistart hybrid iterative tabu search. In: 2015 IEEE international conference on systems, man, and cybernetics, pp 1962–1967. doi: 10.1109/SMC.2015.342
- Alba E, Luque G (2007) A new local search algorithm for the DNA fragment assembly problem. In: Evolutionary computation in combinatorial optimization, EvoCOP’07, Lecture notes in computer science, vol 4446. Springer, Valencia, pp 1–12Google Scholar
- Colombo G, Mumford C (2005) Comparing algorithms, representations and operators for the multi-objective knapsack problem. In: 2005. The 2005 IEEE congress on evolutionary computation, vol 2, pp 1268–1275. doi: 10.1109/CEC.2005.1554836
- Dorronsoro B, Alba E, Luque G, Bouvry P (2008) A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem. IEEE Congr Evol Comput 2008:2651–2658Google Scholar
- Fukunaga A, Tazoe S (2009) Combining multiple representations in a genetic algorithm for the multiple knapsack problem. In: 2009. CEC ’09. IEEE congress on evolutionary computation, pp 2423–2430Google Scholar
- Minetti G, Alba E (2010) Metaheuristic assemblers of DNA strands: noiseless and noisy cases. In: IEEE congress on evolutionary computation. IEEE, pp 1–8Google Scholar
- Minetti G, Leguizamón G, Alba E (2012) SAX: a new and efficient assembler for solving DNA fragment assembly problem. In: JAIIO (ed) 13th Argentine symposium on artificial intelligence, ASAI 2012. SADIO, pp 177–188Google Scholar
- Mumford C (2003) Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem. In: 2003. CEC ’03. The 2003 congress on evolutionary computation, vol 2, pp 854–861. doi: 10.1109/CEC.2003.1299756