IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v27y2016i4d10.1007_s10845-014-0919-2.html
   My bibliography  Save this article

A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints

Author

Listed:
  • Dashuang Li

    (Huazhong University of Science and Technology (HUST))

  • Chaoyong Zhang

    () (Huazhong University of Science and Technology (HUST))

  • Xinyu Shao

    (Huazhong University of Science and Technology (HUST))

  • Wenwen Lin

    (Huazhong University of Science and Technology (HUST))

Abstract

Abstract Two-sided assembly line is often designed to produce large-sized high-volume products such as cars, trucks and engineering machinery. However, in real-life production process, besides the elementary constraints in the one-sided assembly line, additional constraints, such as zoning constraints, positional constraints and synchronous constraints, may occur in the two-sided assembly line. In this paper, mathematical formulation of balancing multi-objective two-sided assembly line with multiple constraints is established, and some practical objectives, including maximization of the line efficiency, minimization of the smoothness index and minimization of the total relevant costs per product unit (Tcost), have been considered. A novel multi-objective optimization algorithm based on improved teaching–learning-based optimization (ITLBO) algorithm is proposed to obtain the Pareto-optimal set. In the ITLBO algorithm, teacher and learner phases are modified for the discrete problem, and late acceptance hill-climbing is integrated into a novel self-learning phase. A novel merging method is proposed to construct a new population according to the ordering relation between the original and evolutionary population. The proposed algorithm is tested on the benchmark instances and a practical case. Experimental results, compared with the ones computed by other algorithm and in current literature, validate the effectiveness of the proposed algorithm.

Suggested Citation

  • Dashuang Li & Chaoyong Zhang & Xinyu Shao & Wenwen Lin, 2016. "A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints," Journal of Intelligent Manufacturing, Springer, vol. 27(4), pages 725-739, August.
  • Handle: RePEc:spr:joinma:v:27:y:2016:i:4:d:10.1007_s10845-014-0919-2
    DOI: 10.1007/s10845-014-0919-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-014-0919-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    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. Scholl, Armin & Becker, Christian, 2005. "A note on "An exact method for cost-oriented assembly line balancing"," International Journal of Production Economics, Elsevier, vol. 97(3), pages 343-352, September.
    2. Amen, Matthias, 2000. "An exact method for cost-oriented assembly line balancing," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 187-195, March.
    3. Amen, Matthias, 2006. "Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds," European Journal of Operational Research, Elsevier, vol. 168(3), pages 747-770, February.
    4. Amen, Matthias, 2000. "Heuristic methods for cost-oriented assembly line balancing: A survey," International Journal of Production Economics, Elsevier, vol. 68(1), pages 1-14, October.
    5. 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.
    6. Ö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.
    7. Amen, Matthias, 2001. "Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time," International Journal of Production Economics, Elsevier, vol. 69(3), pages 255-264, February.
    8. Scholl, Armin & Boysen, Nils, 2009. "Designing parallel assembly lines with split workplaces: Model and optimization procedure," International Journal of Production Economics, Elsevier, vol. 119(1), pages 90-100, May.
    Full references (including those not matched with items on IDEAS)

    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:joinma:v:27:y:2016:i:4:d:10.1007_s10845-014-0919-2. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.