A continuous representation and chaos theory based algorithm for solving Facility Layout Problem

    研究成果: Conference contribution

    2 引用 (Scopus)

    抄録

    This paper proposes the algorithm for solving Facility Layout Problem (FLP), which is the problem of discovering the best locations of departments within the facility in order to maximize its efficiency. In FLP research, there are two choices of representation of layout candidates: discrete-representation and continuous-representation. In recent years, the continuous-representation has become the representation of choice, as it can consider all feasible solutions. Most of continuous-representation-based methods are based on Mixed-Integer-Programming (MIP) or Non Linear Programming (NLP). However, MIP-based-approach has weak searching capability in large-scale problem due to the large number of combinations of the binary variables used in the models to maintain feasibility with respect to departments overlapping. Further, NLP-based-approach has possibility to miss the searching opportunity for the optimal solution, as it can only seek one of local solutions. In order to overcome these difficulties, this paper proposes the chaos-theory-based algorithm that controls the intensification and diversification of searching capability. In numerical experiments, different sized problems from both the literature and industrial applications are tested and the solutions are compared with the solutions from other methods to show the effectiveness of the proposed algorithm.

    元の言語English
    ホスト出版物のタイトル21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings
    出版者Fraunhofer-Verlag
    ISBN(印刷物)9783839602935
    出版物ステータスPublished - 2011
    イベント21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Stuttgart
    継続期間: 2011 7 312011 8 4

    Other

    Other21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011
    Stuttgart
    期間11/7/3111/8/4

    Fingerprint

    Chaos theory
    Integer programming
    Nonlinear programming
    Industrial applications
    Experiments

    ASJC Scopus subject areas

    • Control and Systems Engineering
    • Computer Science Applications
    • Industrial and Manufacturing Engineering

    これを引用

    Ohmori, S., Yoshimoto, K., & Ogawa, K. (2011). A continuous representation and chaos theory based algorithm for solving Facility Layout Problem. : 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings Fraunhofer-Verlag.

    A continuous representation and chaos theory based algorithm for solving Facility Layout Problem. / Ohmori, Shunichi; Yoshimoto, Kazuho; Ogawa, Kenshu.

    21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 2011.

    研究成果: Conference contribution

    Ohmori, S, Yoshimoto, K & Ogawa, K 2011, A continuous representation and chaos theory based algorithm for solving Facility Layout Problem. : 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011, Stuttgart, 11/7/31.
    Ohmori S, Yoshimoto K, Ogawa K. A continuous representation and chaos theory based algorithm for solving Facility Layout Problem. : 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag. 2011
    Ohmori, Shunichi ; Yoshimoto, Kazuho ; Ogawa, Kenshu. / A continuous representation and chaos theory based algorithm for solving Facility Layout Problem. 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 2011.
    @inproceedings{f4491f4c8363466d86025a751fc71264,
    title = "A continuous representation and chaos theory based algorithm for solving Facility Layout Problem",
    abstract = "This paper proposes the algorithm for solving Facility Layout Problem (FLP), which is the problem of discovering the best locations of departments within the facility in order to maximize its efficiency. In FLP research, there are two choices of representation of layout candidates: discrete-representation and continuous-representation. In recent years, the continuous-representation has become the representation of choice, as it can consider all feasible solutions. Most of continuous-representation-based methods are based on Mixed-Integer-Programming (MIP) or Non Linear Programming (NLP). However, MIP-based-approach has weak searching capability in large-scale problem due to the large number of combinations of the binary variables used in the models to maintain feasibility with respect to departments overlapping. Further, NLP-based-approach has possibility to miss the searching opportunity for the optimal solution, as it can only seek one of local solutions. In order to overcome these difficulties, this paper proposes the chaos-theory-based algorithm that controls the intensification and diversification of searching capability. In numerical experiments, different sized problems from both the literature and industrial applications are tested and the solutions are compared with the solutions from other methods to show the effectiveness of the proposed algorithm.",
    keywords = "Chaos-theory, Facility Layout Problem, Facility planning, Material handling, Meta-heuristics",
    author = "Shunichi Ohmori and Kazuho Yoshimoto and Kenshu Ogawa",
    year = "2011",
    language = "English",
    isbn = "9783839602935",
    booktitle = "21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings",
    publisher = "Fraunhofer-Verlag",

    }

    TY - GEN

    T1 - A continuous representation and chaos theory based algorithm for solving Facility Layout Problem

    AU - Ohmori, Shunichi

    AU - Yoshimoto, Kazuho

    AU - Ogawa, Kenshu

    PY - 2011

    Y1 - 2011

    N2 - This paper proposes the algorithm for solving Facility Layout Problem (FLP), which is the problem of discovering the best locations of departments within the facility in order to maximize its efficiency. In FLP research, there are two choices of representation of layout candidates: discrete-representation and continuous-representation. In recent years, the continuous-representation has become the representation of choice, as it can consider all feasible solutions. Most of continuous-representation-based methods are based on Mixed-Integer-Programming (MIP) or Non Linear Programming (NLP). However, MIP-based-approach has weak searching capability in large-scale problem due to the large number of combinations of the binary variables used in the models to maintain feasibility with respect to departments overlapping. Further, NLP-based-approach has possibility to miss the searching opportunity for the optimal solution, as it can only seek one of local solutions. In order to overcome these difficulties, this paper proposes the chaos-theory-based algorithm that controls the intensification and diversification of searching capability. In numerical experiments, different sized problems from both the literature and industrial applications are tested and the solutions are compared with the solutions from other methods to show the effectiveness of the proposed algorithm.

    AB - This paper proposes the algorithm for solving Facility Layout Problem (FLP), which is the problem of discovering the best locations of departments within the facility in order to maximize its efficiency. In FLP research, there are two choices of representation of layout candidates: discrete-representation and continuous-representation. In recent years, the continuous-representation has become the representation of choice, as it can consider all feasible solutions. Most of continuous-representation-based methods are based on Mixed-Integer-Programming (MIP) or Non Linear Programming (NLP). However, MIP-based-approach has weak searching capability in large-scale problem due to the large number of combinations of the binary variables used in the models to maintain feasibility with respect to departments overlapping. Further, NLP-based-approach has possibility to miss the searching opportunity for the optimal solution, as it can only seek one of local solutions. In order to overcome these difficulties, this paper proposes the chaos-theory-based algorithm that controls the intensification and diversification of searching capability. In numerical experiments, different sized problems from both the literature and industrial applications are tested and the solutions are compared with the solutions from other methods to show the effectiveness of the proposed algorithm.

    KW - Chaos-theory

    KW - Facility Layout Problem

    KW - Facility planning

    KW - Material handling

    KW - Meta-heuristics

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

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

    M3 - Conference contribution

    AN - SCOPUS:84923461342

    SN - 9783839602935

    BT - 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings

    PB - Fraunhofer-Verlag

    ER -