Tabu Search with Consistent Neighbourhood for Strip Packing - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Tabu Search with Consistent Neighbourhood for Strip Packing

(1) , (1) , (1)
1

Résumé

This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem knowledge, and a diversification based on the history of the search. The neighborhood only considers valid, sometimes partial, packings. The fitness function incorporates measures related to the empty spaces. Diversification relies on a set of historically “frozen” objects. Experimental results are shown on a set of well-known hard instances and compared with previously reported tabu search algorithms as well as the best performing algorithms.

Dates et versions

hal-03255417 , version 1 (09-06-2021)

Identifiants

Citer

Giglia Gómez-Villouta, Jean-Philippe Hamiez, Jin-Kao Hao. Tabu Search with Consistent Neighbourhood for Strip Packing. 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2010, 2010, Cordoue, Spain. pp.1 - 10, ⟨10.1007/978-3-642-13022-9_1⟩. ⟨hal-03255417⟩

Collections

UNIV-ANGERS LERIA
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More