IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v142y2013i2p362-371.html
   My bibliography  Save this article

A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems

Author

Listed:
  • Yu-Hsin Chen, Gary

Abstract

A dynamic facility layout problem (DFLP) is concerned with finding a set of facility layouts across multiple time periods that minimizes the total cost of material flows and rearrangement costs. Unlike other heuristic approaches that focus mainly on the searching aspect, this research takes another approach by streamlining the data structure of solution representation to improve the solution swapping and storing activities within a meta-heuristic framework. The experimental results from testing the data encoding and decoding schemes on a DFLP data set have been quite promising in terms of solution quality and computational time.

Suggested Citation

  • Yu-Hsin Chen, Gary, 2013. "A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems," International Journal of Production Economics, Elsevier, vol. 142(2), pages 362-371.
  • Handle: RePEc:eee:proeco:v:142:y:2013:i:2:p:362-371
    DOI: 10.1016/j.ijpe.2012.12.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S092552731200504X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2012.12.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Moncayo-Martínez, Luis A. & Zhang, David Z., 2011. "Multi-objective ant colony optimisation: A meta-heuristic approach to supply chain design," International Journal of Production Economics, Elsevier, vol. 131(1), pages 407-420, May.
    2. L M Gambardella & É D Taillard & M Dorigo, 1999. "Ant colonies for the quadratic assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 167-176, February.
    3. Meir J. Rosenblatt, 1986. "The Dynamics of Plant Layout," Management Science, INFORMS, vol. 32(1), pages 76-86, January.
    4. Balakrishnan, Jaydeep & Cheng, Chun Hung, 2006. "A note on "a hybrid genetic algorithm for the dynamic plant layout problem"," International Journal of Production Economics, Elsevier, vol. 103(1), pages 87-89, September.
    5. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    6. Balakrishnan, Jaydeep & Cheng, Chun Hung & Conway, Daniel G. & Lau, Chun Ming, 2003. "A hybrid genetic algorithm for the dynamic plant layout problem," International Journal of Production Economics, Elsevier, vol. 86(2), pages 107-120, November.
    7. Baykasoglu, Adil & Dereli, Turkay & Sabuncu, Ibrahim, 2006. "An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems," Omega, Elsevier, vol. 34(4), pages 385-396, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pablo Pérez-Gosende & Josefa Mula & Manuel Díaz-Madroñero, 2020. "Overview of Dynamic Facility Layout Planning as a Sustainability Strategy," Sustainability, MDPI, vol. 12(19), pages 1-16, October.
    2. Vitayasak, Srisatja & Pongcharoen, Pupong & Hicks, Chris, 2017. "A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm," International Journal of Production Economics, Elsevier, vol. 190(C), pages 146-157.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.
    2. Balakrishnan, Jaydeep & Hung Cheng, Chun, 2009. "The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty," Omega, Elsevier, vol. 37(1), pages 165-177, February.
    3. Balakrishnan, Jaydeep & Cheng, Chun Hung, 2006. "A note on "a hybrid genetic algorithm for the dynamic plant layout problem"," International Journal of Production Economics, Elsevier, vol. 103(1), pages 87-89, September.
    4. Scott, James & Ho, William & Dey, Prasanta K. & Talluri, Srinivas, 2015. "A decision support system for supplier selection and order allocation in stochastic, multi-stakeholder and multi-criteria environments," International Journal of Production Economics, Elsevier, vol. 166(C), pages 226-237.
    5. Ioannou, George, 2006. "Time-phased creation of hybrid manufacturing systems," International Journal of Production Economics, Elsevier, vol. 102(2), pages 183-198, August.
    6. Dunker, Thomas & Radons, Gunter & Westkamper, Engelbert, 2005. "Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 55-69, August.
    7. Jean-François Cordeau & Manlio Gaudioso & Gilbert Laporte & Luigi Moccia, 2006. "A Memetic Heuristic for the Generalized Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 433-443, November.
    8. Maria Albareda-Sambola & Antonio Alonso-Ayuso & Laureano Escudero & Elena Fernández & Yolanda Hinojosa & Celeste Pizarro-Romero, 2010. "A computational comparison of several formulations for the multi-period incremental service facility location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 62-80, July.
    9. Boxuan Zhao & Jianmin Gao & Kun Chen & Ke Guo, 2018. "Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines," Journal of Intelligent Manufacturing, Springer, vol. 29(1), pages 93-108, January.
    10. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    11. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    12. Yifei Zhao & Stein W. Wallace, 2016. "Appraising redundancy in facility layout," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 665-679, February.
    13. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    14. Balakrishnan, Jaydeep & Cheng, Chun Hung & Conway, Daniel G. & Lau, Chun Ming, 2003. "A hybrid genetic algorithm for the dynamic plant layout problem," International Journal of Production Economics, Elsevier, vol. 86(2), pages 107-120, November.
    15. Vitayasak, Srisatja & Pongcharoen, Pupong & Hicks, Chris, 2017. "A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm," International Journal of Production Economics, Elsevier, vol. 190(C), pages 146-157.
    16. Olivares-Benitez, Elias & Ríos-Mercado, Roger Z. & González-Velarde, José Luis, 2013. "A metaheuristic algorithm to solve the selection of transportation channels in supply chain design," International Journal of Production Economics, Elsevier, vol. 145(1), pages 161-172.
    17. O’Neill, Sam & Wrigley, Paul & Bagdasar, Ovidiu, 2022. "A mixed-integer linear programming formulation for the modular layout of three-dimensional connected systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 201(C), pages 739-754.
    18. Solnon, Christine, 2008. "Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1043-1055, December.
    19. K A Dowsland & J M Thompson, 2005. "Ant colony optimization for the examination scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 426-438, April.
    20. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:142:y:2013:i:2:p:362-371. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.