Logo

Comparing between Simulated Annealing Neighborhood Generation with the Combination of Simulated Annealing and Genetic Algorithm in Facility Layout Problem

Octavia, Tanti and Palit, Herri Christian and Putra, Victor Khoesnadi Mandala (2014) Comparing between Simulated Annealing Neighborhood Generation with the Combination of Simulated Annealing and Genetic Algorithm in Facility Layout Problem. Australian Journal of Basic and Applied Sciences, 8 (4). pp. 78-84. ISSN 1991-8178

[img] PDF
Download (634Kb)
    [img]
    Preview
    PDF (cek plagiasi)
    Download (1395Kb) | Preview
      [img]
      Preview
      PDF (peerreview)
      Download (991Kb) | Preview

        Abstract

        We present the comparison of the Simulated Annealing Neighborhood Generation (SANG) algorithm with the combination of Genetic Algorithm-Simulated Annealing Algorithm (GA-SA II). It is applied to a facility layout problem. We simulate two algorithms using Microsoft Visual Basic 6.0 and data is generated from a case study. The result shows SANG algorithm gives a better result in terms of moment. It occurs since SANG algorithm exchanges eight chosen facilities, simultaneously. Therefore, the best moment can be found faster.

        Item Type: Article
        Uncontrolled Keywords: Simulated Annealing Neighborhood Generation, Genetic Algorithm, Facility Layout
        Subjects: T Technology > TS Manufactures
        Divisions: Faculty of Industrial Technology > Industrial Engineering Department
        Depositing User: Admin
        Date Deposited: 27 Nov 2014 21:28
        Last Modified: 27 Nov 2020 05:30
        URI: http://repository.petra.ac.id/id/eprint/16821

        Actions (login required)

        View Item