An Experimental Comparison of Hybrid Algorithms for Facility Rearrangement Problem  

Oleh:

Suzuki, Atsushi ; Yamamoto, Hisashi

Jenis: Article from Proceeding
Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-8.
Topik: Evolutionary Algorithms; Facility Planning; Optimization; Meta-heuristics; Genetic Algorithm; Tabu Search
Fulltext: 1101.pdf (501.99KB)

Isi artikel

The facility rearrangement problem (FRP) is a decision-making of stopping/running of each facility and shifting of operation in stopped facilities to any running facility in a multiple production system. This problem can be represented as a mixed-integer programming model. If the number of facilities is more than 18, it is difficult to solve exactly. To find excellent alternatives of facility rearrangement, hybrid evolutionary algorithms are proposed in previous studies, for example genetic algorithm (GA) and enumeration, two-step GA, GA and heuristic local search, GA and Simulated Annealing, and others. In this study, a hybrid GA/TS (tabu search) algorithm is developed and an experimental comparison with other hybrid genetic algorithms is carried out by solving example problems of FRP from 20 to 28 facilities.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali