IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i2d10.1007_s10878-015-9959-6.html
   My bibliography  Save this article

Multi-neighborhood based path relinking for two-sided assembly line balancing problem

Author

Listed:
  • Zhaoyang Yang

    (Huazhong University of Science and Technology
    Hubei University of Automotive Technology)

  • Guojun Zhang

    (Huazhong University of Science and Technology)

  • Haiping Zhu

    (Huazhong University of Science and Technology)

Abstract

This paper presents a multi-neighborhood based path relinking algorithm (MN-PR) for solving the two-sided assembly line balancing problem. By incorporating an effective local search into a path relinking framework, the proposed MN-PR algorithm integrates a number of distinguishing features, such as a multi-neighborhood based local search procedure, a dedicated path relinking operator to generate new solutions and a strategy to fix an infeasible solution generated by the path relinking procedure to a feasible one. Our proposed MN-PR algorithm is tested on a set of totally 45 public instances widely used in the literature. Comparisons with other reference algorithms show the efficacy of the proposed algorithm in terms of the solution quality. Particularly, the proposed MN-PR algorithm is able to improve the best upper bounds for one instance with 65 tasks and 326 cycle time. This paper also presents an analysis to show the significance of the main components of the proposed algorithm.

Suggested Citation

  • Zhaoyang Yang & Guojun Zhang & Haiping Zhu, 2016. "Multi-neighborhood based path relinking for two-sided assembly line balancing problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 396-415, August.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-015-9959-6
    DOI: 10.1007/s10878-015-9959-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9959-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9959-6?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. Zhang, G.Q. & Lai, K.K., 2006. "Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 413-425, March.
    2. Hu, Xiaofeng & Wu, Erfei & Jin, Ye, 2008. "A station-oriented enumerative algorithm for two-sided assembly line balancing," European Journal of Operational Research, Elsevier, vol. 186(1), pages 435-440, April.
    3. Bautista, Joaquin & Pereira, Jordi, 2007. "Ant algorithms for a time and space constrained assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2016-2032, March.
    4. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    5. W Q Huang & L Wang, 2006. "A local search method for permutation flow shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1248-1251, October.
    6. Wang, Yang & Lü, Zhipeng & Glover, Fred & Hao, Jin-Kao, 2012. "Path relinking for unconstrained binary quadratic programming," European Journal of Operational Research, Elsevier, vol. 223(3), pages 595-604.
    Full references (including those not matched with items on IDEAS)

    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. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    2. Chica, Manuel & Bautista, Joaquín & Cordón, Óscar & Damas, Sergio, 2016. "A multiobjective model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand," Omega, Elsevier, vol. 58(C), pages 55-68.
    3. Hamta, Nima & Fatemi Ghomi, S.M.T. & Jolai, F. & Akbarpour Shirazi, M., 2013. "A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect," International Journal of Production Economics, Elsevier, vol. 141(1), pages 99-111.
    4. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    5. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    6. Manuel Chica & Joaquín Bautista & Jesica de Armas, 2019. "Benefits of robust multiobjective optimization for flexible automotive assembly line balancing," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 75-103, March.
    7. Scholl, Armin & Fliedner, Malte & Boysen, Nils, 2010. "Absalom: Balancing assembly lines with assignment restrictions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 688-701, February.
    8. Chica, Manuel & Cordón, Óscar & Damas, Sergio & Bautista, Joaquín, 2013. "A robustness information and visualization model for time and space assembly line balancing under uncertain demand," International Journal of Production Economics, Elsevier, vol. 145(2), pages 761-772.
    9. Sternatz, Johannes, 2015. "The joint line balancing and material supply problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 304-318.
    10. Sikora, Celso Gustavo Stall & Lopes, Thiago Cantos & Magatão, Leandro, 2017. "Traveling worker assembly line (re)balancing problem: Model, reduction techniques, and real case studies," European Journal of Operational Research, Elsevier, vol. 259(3), pages 949-971.
    11. Christian Blum, 2008. "Beam-ACO for Simple Assembly Line Balancing," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 618-627, November.
    12. E. C. Sewell & S. H. Jacobson, 2012. "A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 433-442, August.
    13. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    14. Yılmaz Delice & Emel Kızılkaya Aydoğan & Uğur Özcan & Mehmet Sıtkı İlkay, 2017. "Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm," 4OR, Springer, vol. 15(1), pages 37-66, March.
    15. Xiaofeng, Hu & Erfei, Wu & Jinsong, Bao & Ye, Jin, 2010. "A branch-and-bound algorithm to minimize the line length of a two-sided assembly line," European Journal of Operational Research, Elsevier, vol. 206(3), pages 703-707, November.
    16. Bautista, Joaquín & Pereira, Jordi, 2009. "A dynamic programming based heuristic for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 787-794, May.
    17. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    18. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
    19. Pape, Tom, 2015. "Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements," European Journal of Operational Research, Elsevier, vol. 240(1), pages 32-42.
    20. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.

    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:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-015-9959-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.