Hybrid and Hyper Meta-Heuristics Algorithms for Cost-Based U-Shaped Assembly Line Balancing Problem with Multi-Mode Equipment Possibility

Authors

  • Shabnam Zhagharian Department of Mathematics, Shiraz University of Technology, Shiraz, Iran.
  • Hamid Reza Maleki
  • Sadegh Niroomand

Keywords:

Hybrid meta-heuristic algorithm, Assembly line balancing, U-shaped assembly line, NP-hard, Equipment selection

Abstract

AU-shaped assembly line (UAL) is an assembly line (AL) effective type that offers many advantages over straight AL. It can be installed in a smaller physical space with less number of stations. This study investigates a bi-objective model that incorporates station installation costs, variable operating costs, and equipment purchasing costs into a typical cost-based UAL balancing problem. For the first time, the possibility of selecting equipment types is considered in such AL, where task operating duration is determined by the sort of equipment needed for that task. As the problem has a high degree of complexity, some classical meta-heuristics and hyper-heuristics are used and some logics are added to them and hybridized as solution approach. The Taguchi approach is used to tune the parameters of each algorithm. According to the obtained outcomes, the GD, VNS, and their hybrid version obtain better results than other algorithms.

Published

2025-10-05

Issue

Vol. 19

Section

Vol. 19, No. 5, (2025)

License

Upon acceptance of an article, authors will be asked to complete a 'Journal Publishing Agreement'. An e-mail will be sent to the corresponding author confirming receipt of the manuscript together with a "Journal Publishing Agreement" form or a link to the online version of this agreement.

Journal author rights

Authors have copyright but license exclusive rights in their article to the publisher. In this case authors have the right to:

  • Share their article in the same ways permitted to third parties under the relevant user license (together with Personal use rights) so long as it contains a link to the version of record on this website.
  • Retain patent, trademark and other intellectual property rights (including raw research data).
  • Proper attribution and credit for the published work.

Rights granted to this journal

The Journal of Mathematical Extension is granted the following rights:

  • This journal will apply the relevant third party user license where this journal publishes the article on its online platforms.
  • The right to provide the article in all forms and media so the article can be used on the latest technology even after publication.
  • The authority to enforce the rights in the article, on behalf of an author, against third parties, for example in the case of plagiarism or copyright infringement.

Protecting author right

Copyright aims to protect the specific way the article has been written to describe an experiment and the results. This journal is committed to its authors to protect and defend their work and their reputation and takes allegations of infringement, plagiarism, ethic disputes and fraud very seriously.

If an author becomes aware of a possible plagiarism, fraud or infringement we recommend contacting the editorial office immediately.

Personal use

Authors can use their articles, in full or in part, for a wide range of scholarly, non-commercial purposes as outlined below:

  • Use by an author in the author’s classroom teaching (including distribution of copies, paper or electronic)
  • Distribution of copies (including through e-mail) to known research colleagues for their personal use (but not for Commercial Use)
  • Inclusion in a thesis or dissertation (provided that this is not to be published commercially)
  • Use in a subsequent compilation of the author’s works
  • Extending the Article to book-length form
  • Preparation of other derivative works (but not for Commercial Use)
  • Otherwise using or re-using portions or excerpts in other works

These rights apply for all authors who publish their article in this journal. In all cases we require that all authors always include a full acknowledgement and, if appropriate, a link to the final published version hosted on this website.