A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs
| Autor: | Tao Ye, Kan Zhou, Zhipeng Lü, Taoqing Zhou |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization 021103 operations research Optimization problem Computer science business.industry 0211 other engineering and technologies 02 engineering and technology Function (mathematics) Linear ordering Set (abstract data type) Permutation 020901 industrial engineering & automation Benchmark (computing) Memetic algorithm Local search (optimization) business Algorithm |
| Zdroj: | Combinatorial Optimization and Applications ISBN: 9783319711461 COCOA (2) |
| DOI: | 10.1007/978-3-319-71147-8_39 |
| Popis: | Some optimization problems need to finding a permutation of a given set of items that minimizes a certain cost function. This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs (LOPCC). The proposed algorithm combines an order-based recombination operator with an improved forward-backward local search procedure and employs a quality based replacement criterion for pool updating. Extensive experiments on 118 benchmark instances from the literature show that the proposed algorithm achieves competitive results by identifying 46 new upper bounds. Furthermore, some critical ingredients of our algorithm are analyzed to understand the source of its performance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|