Anzeige
Erschienen in:
2017 | OriginalPaper | Buchkapitel
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs
verfasst von : Taoqing Zhou, Zhipeng Lü, Tao Ye, Kan Zhou
Erschienen in: Combinatorial Optimization and Applications
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
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.