By Topic

Solving a new mathematical model of a closed-loop layout problem with unequal-sized facilities by a genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tavakkoli-Moghaddam, R. ; Univ. of Tehran, Tehran ; Panahi, H.

This paper presents a novel mathematical model of a closed-loop layout problem with unequal-sized facilities. This type of problem belongs to a class of combinatorial optimization, and NP-hard problems due to its complexity and high volume of computation. Obtaining an optimal solution for this complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. Thus, a meta-heuristic algorithm based on a genetic algorithm (GA) is proposed to solve the closed-loop layout problem. This proposed GA reports near-optimal and promising solutions in short period of time because of its efficiency. In this paper, a local search, based on 2-Opt algorithm, is also employed to improve the solutions obtained by the proposed GA. Finally, the computational results obtained by this algorithm are analyzed and compared with the results reported by the Lingo 8.0 software package.

Published in:

Industrial Engineering and Engineering Management, 2007 IEEE International Conference on

Date of Conference:

2-4 Dec. 2007