An optimization method for the facility layout problem using a real-coded genetic algorithm

    Research output: Contribution to journalArticle

    Abstract

    Most of the algorithms for the facility layout problem (FLP) attempt to solve the problem through encoding layout candidates and using combinational optimization techniques to obtain the best encoded candidates. However, since FLP is a continuous optimization problem by nature, layouts exist which cannot be represented by these encoding techniques. Therefore, there is possibility that the opportunity to search for the optimal solution will be missed. Furthermore, some algorithms attempt to solve FLP as a continuous problem; however, since FLP is a non-convex problem, it is known that these algorithms have the problem of being trapped into local optima. To overcome these problems, this paper proposes an algorithm to solve FLP through applying a real coded genetic algorithm (RCGA), which is known to be effective for many types of continuous optimization problems.

    Original languageEnglish
    Pages (from-to)182-189
    Number of pages8
    JournalJournal of Japan Industrial Management Association
    Volume62
    Issue number4
    Publication statusPublished - 2011 Oct 15

    Fingerprint

    Facility Layout
    Real-coded Genetic Algorithm
    Optimization Methods
    Genetic algorithms
    Continuous Optimization
    Layout
    Encoding
    Optimization Problem
    Genetic algorithm
    Facility layout
    Nonconvex Problems
    Optimization Techniques
    Optimal Solution

    Keywords

    • Facility layout problem
    • Facility planning
    • Material handling
    • Optimization
    • Real coded genetic algorithm

    ASJC Scopus subject areas

    • Industrial and Manufacturing Engineering
    • Applied Mathematics
    • Management Science and Operations Research
    • Strategy and Management

    Cite this

    An optimization method for the facility layout problem using a real-coded genetic algorithm. / Ohmori, Shunichi; Mlyoshl, Kanako; Yoshimoto, Kazuho.

    In: Journal of Japan Industrial Management Association, Vol. 62, No. 4, 15.10.2011, p. 182-189.

    Research output: Contribution to journalArticle

    @article{b5be423646834626bad8e7326a4cf7ad,
    title = "An optimization method for the facility layout problem using a real-coded genetic algorithm",
    abstract = "Most of the algorithms for the facility layout problem (FLP) attempt to solve the problem through encoding layout candidates and using combinational optimization techniques to obtain the best encoded candidates. However, since FLP is a continuous optimization problem by nature, layouts exist which cannot be represented by these encoding techniques. Therefore, there is possibility that the opportunity to search for the optimal solution will be missed. Furthermore, some algorithms attempt to solve FLP as a continuous problem; however, since FLP is a non-convex problem, it is known that these algorithms have the problem of being trapped into local optima. To overcome these problems, this paper proposes an algorithm to solve FLP through applying a real coded genetic algorithm (RCGA), which is known to be effective for many types of continuous optimization problems.",
    keywords = "Facility layout problem, Facility planning, Material handling, Optimization, Real coded genetic algorithm",
    author = "Shunichi Ohmori and Kanako Mlyoshl and Kazuho Yoshimoto",
    year = "2011",
    month = "10",
    day = "15",
    language = "English",
    volume = "62",
    pages = "182--189",
    journal = "Journal of Japan Industrial Management Association",
    issn = "0386-4812",
    publisher = "Nihon Keikei Kogakkai",
    number = "4",

    }

    TY - JOUR

    T1 - An optimization method for the facility layout problem using a real-coded genetic algorithm

    AU - Ohmori, Shunichi

    AU - Mlyoshl, Kanako

    AU - Yoshimoto, Kazuho

    PY - 2011/10/15

    Y1 - 2011/10/15

    N2 - Most of the algorithms for the facility layout problem (FLP) attempt to solve the problem through encoding layout candidates and using combinational optimization techniques to obtain the best encoded candidates. However, since FLP is a continuous optimization problem by nature, layouts exist which cannot be represented by these encoding techniques. Therefore, there is possibility that the opportunity to search for the optimal solution will be missed. Furthermore, some algorithms attempt to solve FLP as a continuous problem; however, since FLP is a non-convex problem, it is known that these algorithms have the problem of being trapped into local optima. To overcome these problems, this paper proposes an algorithm to solve FLP through applying a real coded genetic algorithm (RCGA), which is known to be effective for many types of continuous optimization problems.

    AB - Most of the algorithms for the facility layout problem (FLP) attempt to solve the problem through encoding layout candidates and using combinational optimization techniques to obtain the best encoded candidates. However, since FLP is a continuous optimization problem by nature, layouts exist which cannot be represented by these encoding techniques. Therefore, there is possibility that the opportunity to search for the optimal solution will be missed. Furthermore, some algorithms attempt to solve FLP as a continuous problem; however, since FLP is a non-convex problem, it is known that these algorithms have the problem of being trapped into local optima. To overcome these problems, this paper proposes an algorithm to solve FLP through applying a real coded genetic algorithm (RCGA), which is known to be effective for many types of continuous optimization problems.

    KW - Facility layout problem

    KW - Facility planning

    KW - Material handling

    KW - Optimization

    KW - Real coded genetic algorithm

    UR - http://www.scopus.com/inward/record.url?scp=84857264208&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84857264208&partnerID=8YFLogxK

    M3 - Article

    VL - 62

    SP - 182

    EP - 189

    JO - Journal of Japan Industrial Management Association

    JF - Journal of Japan Industrial Management Association

    SN - 0386-4812

    IS - 4

    ER -