his.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Nourmohammadi, Amir
Publications (5 of 5) Show all publications
Nourmohammadi, A., Fathi, M., Ruiz Zúñiga, E. & Ng, A. H. C. (2019). A Genetic Algorithm for Bi-Objective Assembly Line Balancing Problem. In: Yan Jin, Mark Price (Ed.), Advances in Manufacturing Technology XXXIII: Proceedings of the 17th International Conference on Manufacturing Research, incorporating the 34th National Conference on Manufacturing Research, September 10–12, 2019, Queen’s University Belfast, UK. Paper presented at 17th International Conference on Manufacturing Research, incorporating the 34th National Conference on Manufacturing Research, September 10–12, 2019, Queen’s University Belfast, UK (pp. 519-524). Amsterdam: IOS Press, 9
Open this publication in new window or tab >>A Genetic Algorithm for Bi-Objective Assembly Line Balancing Problem
2019 (English)In: Advances in Manufacturing Technology XXXIII: Proceedings of the 17th International Conference on Manufacturing Research, incorporating the 34th National Conference on Manufacturing Research, September 10–12, 2019, Queen’s University Belfast, UK / [ed] Yan Jin, Mark Price, Amsterdam: IOS Press, 2019, Vol. 9, p. 519-524Conference paper, Published paper (Refereed)
Abstract [en]

Assembly line designs in manufacturing commonly face the key problem of dividing the assembly tasks among the working stations so that the efficiency of the line is optimized. This problem is known as the assembly line balancing problem which is known to be NP-hard. This study, proposes a bi-objective genetic algorithm to cope with the assembly line balancing problem where the considered objectives are the utilization of the assembly line and the workload smoothness measured as the line efficiency and the variation of workload, respectively. The performance of the proposed genetic algorithm is tested through solving a set of standard problems existing in the literature. The computational results show that the genetic algorithm is promising in providing good solutions to the assembly line balancing problem.

Place, publisher, year, edition, pages
Amsterdam: IOS Press, 2019
Series
Advances in Transdisciplinary Engineering, ISSN 2352-751X, E-ISSN 2352-7528 ; 9
Keywords
Assembly line balancing, bi-objectives, Genetic Algorithm
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Production and Automation Engineering
Identifiers
urn:nbn:se:his:diva-17679 (URN)10.3233/ATDE190091 (DOI)978-1-64368-008-8 (ISBN)978-1-64368-009-5 (ISBN)
Conference
17th International Conference on Manufacturing Research, incorporating the 34th National Conference on Manufacturing Research, September 10–12, 2019, Queen’s University Belfast, UK
Projects
This study is supported by the European Union’s Horizon 2020 research and innovation program under grant agreement no. 723711 through the MANUWORK project.
Funder
EU, Horizon 2020, 723711
Available from: 2019-09-13 Created: 2019-09-13 Last updated: 2019-11-05Bibliographically approved
Nourmohammadi, A., Fathi, M., Zandieh, M. & Ghobakhloo, M. (2019). A water-flow like algorithm for solving U-shaped assembly line balancing problems. IEEE Access, 7, 129824-129833
Open this publication in new window or tab >>A water-flow like algorithm for solving U-shaped assembly line balancing problems
2019 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 7, p. 129824-129833Article in journal (Refereed) Published
Abstract [en]

The problem of assigning assembly tasks to the stations arranged along a material handling device is known as assembly line balancing. This paper aims to address the U-shaped assembly line balancing problem (UALBP) which arises when a U-shaped assembly line has to be configured. It is widely known that this problem is NP-hard. Accordingly, different meta-heuristics based on a single solution (such as Simulated Annealing) or a population of solutions (such as Genetic Algorithms) have been proposed in the literature. Meanwhile, it has been argued that either of these meta-heuristics with a fixed number of solutions cannot maintain efficient search progress and thus can lead to premature convergence. Thus, this study aims at adopting a novel meta-heuristic algorithm with dynamic population sizes, namely Water Flow-like Algorithm (WFA), inspired by the behaviour of water flows in nature, to address the UALBP. The line efficiency and variation of workload are considered as the primary and the secondary objective, to be optimized, respectively. To verify the efficiency and robustness of the proposed WFA, a real case study taken from an automobile manufacturer as well as a set of standard problems are solved and the results compared with the existing approaches in the literature. The computational results demonstrate the superiority of the WFA, particularly in addressing medium to large-sized problems.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers, 2019
Keywords
U-shaped, assembly line balancing, water flow-like algorithm
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Production and Automation Engineering
Identifiers
urn:nbn:se:his:diva-17656 (URN)10.1109/ACCESS.2019.2939724 (DOI)000487236000016 ()
Available from: 2019-09-07 Created: 2019-09-07 Last updated: 2019-11-21Bibliographically approved
Fathi, M., Nourmohammadi, A., Ng, A. H. C., Syberfeldt, A. & Eskandari, H. (2019). An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem. Engineering computations
Open this publication in new window or tab >>An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
Show others...
2019 (English)In: Engineering computations, ISSN 0264-4401, E-ISSN 1758-7077Article in journal (Refereed) Epub ahead of print
Abstract [en]
  • Purpose – This study aims to propose an efficient optimization algorithm to solve the assembly line balancing problem (ALBP). The ALBP arises in high-volume, lean production systems when decision makers aim to design an efficient assembly line while satisfying a set of constraints.
  • Design/methodology/approach – An improved genetic algorithm (IGA) is proposed in this study to deal with ALBP in order to optimize the number of stations and the workload smoothness.
  • Findings – To evaluate the performance of the IGA, it is used to solve a set of well-known benchmark problems and a real-life problem faced by an automobile manufacturer. The solutions obtained are compared against two existing algorithms in the literature and the basic genetic algorithm. The comparisons show the high efficiency and effectiveness of the IGA in dealing with ALBPs.
  • Originality/value – The proposed IGA benefits from a novel generation transfer mechanism that improves the diversification capability of the algorithm by allowing population transfer between different generations. In addition, an effective variable neighborhood search is employed in the IGA to enhance its local search capability.
Place, publisher, year, edition, pages
Emerald Group Publishing Limited, 2019
Keywords
assembly line balancing, genetic algorithm, variable neighborhood search, generation transfer
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Production and Automation Engineering
Identifiers
urn:nbn:se:his:diva-17157 (URN)10.1108/EC-02-2019-0053 (DOI)2-s2.0-85071617279 (Scopus ID)
Projects
This study is supported by the European Union’s Horizon 2020 research and innovation program under grant agreement no. 723711 through the MANUWORK project.
Funder
EU, Horizon 2020, 723711
Available from: 2019-06-18 Created: 2019-06-18 Last updated: 2019-09-24Bibliographically approved
Fathi, M., Nourmohammadi, A., Ng, A. H. C. & Syberfeldt, A. (2019). An optimization model for balancing assembly lines with stochastic task times and zoning constraints. IEEE Access, 7, 32537-32550, Article ID 8663269.
Open this publication in new window or tab >>An optimization model for balancing assembly lines with stochastic task times and zoning constraints
2019 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 7, p. 32537-32550, article id 8663269Article in journal (Refereed) Published
Abstract [en]

This study aims to bridge the gap between theory and practice by addressing a real-world assembly line balancing problem (ALBP) where task times are stochastic and there are zoning constraints in addition to the commonly known ALBP constraints. A mixed integer programming (MIP) model is proposed for each of the straight and U-shaped assembly line configurations. The primary objective in both cases is to minimize the number of stations; minimizing the maximum of stations’ mean time and the stations’ time variance are considered secondary objectives. Four different scenarios are discussed for each model, with differences in the objective function. The models are validated by solving a real case taken from an automobile manufacturing company and some standard test problems available in the literature. The results indicate that both models are able to provide optimum solutions for problems of different sizes. The technique for order preference by similarity to ideal solution (TOPSIS) is used to create reliable comparisons of the different scenarios and valid analysis of the results. Finally, some insights regarding the selection of straight and U-shaped layouts are provided.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers, 2019
Keywords
assembly line balancing, mathematical programming, stochastic, zoning constraints
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Production and Automation Engineering
Identifiers
urn:nbn:se:his:diva-16689 (URN)10.1109/ACCESS.2019.2903738 (DOI)000463040400001 ()2-s2.0-85063577558 (Scopus ID)
Projects
This study is supported by the European Union’s Horizon 2020 research and innovation program under grant agreement no. 723711 through the MANUWORK project.
Funder
EU, Horizon 2020, 723711
Available from: 2019-03-09 Created: 2019-03-09 Last updated: 2019-11-21Bibliographically approved
Nourmohammadi, A., Fathi, M. & Ng, A. H. C. (2019). Choosing efficient meta-heuristics to solve the assembly line balancing problem: A landscape analysis approach. Paper presented at 52nd CIRP Conference on Manufacturing Systems, Ljubljana, Slovenia, June 12-14, 2019. Procedia CIRP, 81, 1248-1253
Open this publication in new window or tab >>Choosing efficient meta-heuristics to solve the assembly line balancing problem: A landscape analysis approach
2019 (English)In: Procedia CIRP, ISSN 2212-8271, E-ISSN 2212-8271, Vol. 81, p. 1248-1253Article in journal (Refereed) Published
Abstract [en]

It is widely known that the assembly line balancing problem (ALBP) is an NP-hard optimization problem. Although different meta-heuristics have been proposed for solving this problem so far, there is no convincing support that what type of algorithms can perform more efficiently than the others. Thus, using some statistical measures, the landscape of the simple ALBP is studied for the first time in the literature. The results indicate a flat landscape for the problem where the local optima are uniformly scattered over the search space. Accordingly, the efficiency of population-based algorithms in addressing the considered problem is statistically validated.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Assembly line balancing, fitness landscape analysis, meta-heuristic algorithms
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Production and Automation Engineering
Identifiers
urn:nbn:se:his:diva-17280 (URN)10.1016/j.procir.2019.03.302 (DOI)2-s2.0-85068480053 (Scopus ID)
Conference
52nd CIRP Conference on Manufacturing Systems, Ljubljana, Slovenia, June 12-14, 2019
Projects
This study is supported by the European Union’s Horizon 2020 research and innovation program under grant agreement no. 723711 through the MANUWORK project
Funder
EU, Horizon 2020, 723711
Available from: 2019-06-24 Created: 2019-06-24 Last updated: 2019-08-19Bibliographically approved
Organisations

Search in DiVA

Show all publications