An ILP-embedded Tabu Search heuristic for the design of integrated cellular manfacturing systems with production planning and dynamic system reconfiguration
An ILP-embedded Tabu Search heuristic for the design of integrated cellular manfacturing systems with production planning and dynamic system reconfiguration
This paper describes a tabu search algorithm to solve the integrated cellular manufacturing systems design problem. The algorithm makes use of both short term and long term memory aspects, in combination with integer linear programming (ILP), to construct the neighbour solutions. Within the short term memory component, attributive recency based memory is used in tabu lists to determine the tabu status of move operators. Within the long-term memory structures, frequency based memory is used in the form of residency measures to guide the diversification scheme and explicit memory is used to guide the intensification scheme. Computational results show that the tabu search procedure generates good quality solutions and that better solution times are experienced compared to that of state-of-the-art optimization software, hence proves to be a viable algorithm especially for the larger sized problems.
Ahkioon, S.
b91900be-0cd2-4183-b058-32e4bce2edf5
Bulgak, A.A.
73768163-3e7a-4ea7-a29a-e2f8294760fb
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
April 2008
Ahkioon, S.
b91900be-0cd2-4183-b058-32e4bce2edf5
Bulgak, A.A.
73768163-3e7a-4ea7-a29a-e2f8294760fb
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Ahkioon, S., Bulgak, A.A. and Bektas, T.
(2008)
An ILP-embedded Tabu Search heuristic for the design of integrated cellular manfacturing systems with production planning and dynamic system reconfiguration
Record type:
Monograph
(Project Report)
Abstract
This paper describes a tabu search algorithm to solve the integrated cellular manufacturing systems design problem. The algorithm makes use of both short term and long term memory aspects, in combination with integer linear programming (ILP), to construct the neighbour solutions. Within the short term memory component, attributive recency based memory is used in tabu lists to determine the tabu status of move operators. Within the long-term memory structures, frequency based memory is used in the form of residency measures to guide the diversification scheme and explicit memory is used to guide the intensification scheme. Computational results show that the tabu search procedure generates good quality solutions and that better solution times are experienced compared to that of state-of-the-art optimization software, hence proves to be a viable algorithm especially for the larger sized problems.
This record has no associated files available for download.
More information
Published date: April 2008
Identifiers
Local EPrints ID: 55834
URI: http://eprints.soton.ac.uk/id/eprint/55834
PURE UUID: 3b17b619-07cf-4f1b-817b-04c18b565906
Catalogue record
Date deposited: 20 Aug 2008
Last modified: 20 Feb 2024 17:42
Export record
Contributors
Author:
S. Ahkioon
Author:
A.A. Bulgak
Author:
T. Bektas
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics