Back to Search
Start Over
The Problem Aware Local Search algorithm: an efficient technique for permutation-based problems
- Source :
- Soft Computing. 21:5193-5206
- Publication Year :
- 2017
- Publisher :
- Springer Science and Business Media LLC, 2017.
-
Abstract
- 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.
- Subjects :
- Mathematical optimization
021103 operations research
Optimization problem
Quadratic assignment problem
Continuous knapsack problem
0211 other engineering and technologies
Covering problems
02 engineering and technology
Theoretical Computer Science
Cutting stock problem
Knapsack problem
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Geometry and Topology
Computational problem
Software
Generalized assignment problem
Mathematics
Subjects
Details
- ISSN :
- 14337479 and 14327643
- Volume :
- 21
- Database :
- OpenAIRE
- Journal :
- Soft Computing
- Accession number :
- edsair.doi...........0b0e2f0f1ff87e34513853640a317977