Article thumbnail

Tabu Search with Consistent Neighbourhood for Strip Packing

By G. Gómez-Villouta, J.P. Hamiez and J.K. Hao

Abstract

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

Topics: algorithm analysis and problem complexity, Artificial Intelligence (incl. Robotics), Computation by Abstract Devices, consistent neighborhood, Database Management, Information Storage and Retrieval, Information Systems Applications (incl.Internet), Strip packing, tabu search
Publisher: 'Springer Science and Business Media LLC'
Year: 2010
DOI identifier: 10.1007/978-3-642-13022-9_1
OAI identifier: oai:okina.univ-angers.fr:4459
Provided by: Okina

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.