Search results

1 – 6 of 6
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 9 August 2019

Mohd Fadzil Faisae Ab. Rashid, Ahmad Nasser Mohd Rose, Nik Mohd Zuki Nik Mohamed and Fadhlur Rahman Mohd Romlay

This paper aims to propose an improved Moth Flame Optimization (I-MFO) algorithm to optimize the cost-oriented two-sided assembly line balancing (2S-ALB). Prior to the decision to…

174

Abstract

Purpose

This paper aims to propose an improved Moth Flame Optimization (I-MFO) algorithm to optimize the cost-oriented two-sided assembly line balancing (2S-ALB). Prior to the decision to assemble a new product, the manufacturer will carefully study and optimize the related cost to set up and run the assembly line. For the first time in ALB, the power cost is modeled together with the equipment, set up and labor costs.

Design/methodology/approach

I-MFO was proposed by introducing a global reference flame mechanism to guide the global search direction. A set of benchmark problems was used to test the I-MFO performance. Apart from the benchmark problems, a case study from a body shop assembly was also presented.

Findings

The computational experiment indicated that the I-MFO obtained promising results compared to comparison algorithms, which included the particle swarm optimization, Cuckoo Search and ant colony optimization. Meanwhile, the results from the case study showed that the proposed cost-oriented 2S-ALB model was able to assist the manufacturer in making better decisions for different planning periods.

Originality/value

The main contribution of this work is the global reference flame mechanism for MFO algorithm. Furthermore, this research introduced a new cost-oriented model that considered power consumption in the assembly line design.

Details

Engineering Computations, vol. 37 no. 2
Type: Research Article
ISSN: 0264-4401

Keywords

Access Restricted. View access options
Article
Publication date: 20 April 2023

Mohd Fadzil Faisae Ab. Rashid and Ariff Nijay Ramli

This study aims to propose a new multiobjective optimization metaheuristic based on the tiki-taka algorithm (TTA). The proposed multiobjective TTA (MOTTA) was implemented for a…

198

Abstract

Purpose

This study aims to propose a new multiobjective optimization metaheuristic based on the tiki-taka algorithm (TTA). The proposed multiobjective TTA (MOTTA) was implemented for a simple assembly line balancing type E (SALB-E), which aimed to minimize the cycle time and workstation number simultaneously.

Design/methodology/approach

TTA is a new metaheuristic inspired by the tiki-taka playing style in a football match. The TTA is previously designed for a single-objective optimization, but this study extends TTA into a multiobjective optimization. The MOTTA mimics the short passing and player movement in tiki-taka to control the game. The algorithm also utilizes unsuccessful ball pass and multiple key players to enhance the exploration. MOTTA was tested against popular CEC09 benchmark functions.

Findings

The computational experiments indicated that MOTTA had better results in 82% of the cases from the CEC09 benchmark functions. In addition, MOTTA successfully found 83.3% of the Pareto optimal solution in the SALB-E optimization and showed tremendous performance in the spread and distribution indicators, which were associated with the multiple key players in the algorithm.

Originality/value

MOTTA exploits the information from all players to move to a new position. The algorithm makes all solution candidates have contributions to the algorithm convergence.

Details

Engineering Computations, vol. 40 no. 3
Type: Research Article
ISSN: 0264-4401

Keywords

Access Restricted. View access options
Article
Publication date: 16 January 2019

Muhamad Magffierah Razali, Nur Hairunnisa Kamarudin, Mohd Fadzil Faisae Ab. Rashid and Ahmad Nasser Mohd Rose

This paper aims to review and discuss four aspects of mixed-model assembly line balancing (MMALB) problem mainly on the optimization angle. MMALB is a non-deterministic…

563

Abstract

Purpose

This paper aims to review and discuss four aspects of mixed-model assembly line balancing (MMALB) problem mainly on the optimization angle. MMALB is a non-deterministic polynomial-time hard problem which requires an effective algorithm for solution. This problem has attracted a number of research fields: manufacturing, mathematics and computer science.

Design/methodology/approach

This paper review 59 published research works on MMALB from indexed journal. The review includes MMALB problem varieties, optimization algorithm, objective function and constraints in the problem.

Findings

Based on research trend, this topic is still growing with the highest publication number observed in 2016 and 2017. The review indicated that the future research direction should focus on human factors and sustainable issues in the problem modeling. As the assembly cost becomes crucial, resource utilization in the assembly line should also be considered. Apart from that, the growth of new optimization algorithms is predicted to influence the MMALB optimization, which currently relies on well-established algorithms.

Originality/value

The originality of this paper is on the research trend in MMALB. It provides the future direction for the researchers in this field.

Details

Engineering Computations, vol. 36 no. 2
Type: Research Article
ISSN: 0264-4401

Keywords

Access Restricted. View access options
Article
Publication date: 23 June 2020

Mohd Fadzil Faisae Ab. Rashid

Metaheuristic algorithms have been commonly used as an optimisation tool in various fields. However, optimisation of real-world problems has become increasingly challenging with…

558

Abstract

Purpose

Metaheuristic algorithms have been commonly used as an optimisation tool in various fields. However, optimisation of real-world problems has become increasingly challenging with to increase in system complexity. This situation has become a pull factor to introduce an efficient metaheuristic. This study aims to propose a novel sport-inspired algorithm based on a football playing style called tiki-taka.

Design/methodology/approach

The tiki-taka football style is characterised by short passing, player positioning and maintaining possession. This style aims to dominate the ball possession and defeat opponents using its tactical superiority. The proposed tiki-taka algorithm (TTA) simulates the short passing and player positioning behaviour for optimisation. The algorithm was tested using 19 benchmark functions and five engineering design problems. The performance of the proposed algorithm was compared with 11 other metaheuristics from sport-based, highly cited and recent algorithms.

Findings

The results showed that the TTA is extremely competitive, ranking first and second on 84% of benchmark problems. The proposed algorithm performs best in two engineering design problems and ranks second in the three remaining problems.

Originality/value

The originality of the proposed algorithm is the short passing strategy that exploits a nearby player to move to a better position.

Details

Engineering Computations, vol. 38 no. 1
Type: Research Article
ISSN: 0264-4401

Keywords

Access Restricted. View access options
Article
Publication date: 3 June 2019

Arif Abdullah, Mohd Fadzil Faisae Ab Rashid, S.G. Ponnambalam and Zakri Ghazalli

Environmental problems in manufacturing industries are a global issue owing to severe lack fossil resources. In assembly sequence planning (ASP), the research effort mainly aims…

184

Abstract

Purpose

Environmental problems in manufacturing industries are a global issue owing to severe lack fossil resources. In assembly sequence planning (ASP), the research effort mainly aims to improve profit and human-related factors, but it still lacks in the consideration of the environmental issue. This paper aims to present an energy-efficient model for the ASP problem.

Design/methodology/approach

The proposed model considered energy utilization during the assembly process, particularly idle energy utilization. The problem was then optimized using moth flame optimization (MFO) and compared with well-established algorithms such as genetic algorithm (GA), particle swarm optimization (PSO) and ant colony optimization (ACO). A computational test was conducted using five assembly problems ranging from 12 to 40 components.

Findings

The results of the computational experiments indicated that the proposed model was capable of generating an energy-efficient assembly sequence. At the same time, the results also showed that MFO consistently performed better in terms of the best and mean fitness, with acceptable computational time.

Originality/value

This paper proposed a new energy-efficient ASP model that can be a guideline to design assembly station. Furthermore, this is the first attempt to implement MFO for the ASP problem.

Details

Assembly Automation, vol. 39 no. 2
Type: Research Article
ISSN: 0144-5154

Keywords

Access Restricted. View access options
Article
Publication date: 3 April 2017

Mohd Fadzil Faisae Ab Rashid

This paper aims to optimize the assembly sequence planning (ASP) problem using a proposed hybrid algorithm based on Ant Colony Optimization (ACO) and Gray Wolf Optimizer (GWO)…

397

Abstract

Purpose

This paper aims to optimize the assembly sequence planning (ASP) problem using a proposed hybrid algorithm based on Ant Colony Optimization (ACO) and Gray Wolf Optimizer (GWO). The proposed Hybrid Ant-Wolf Algorithm (HAWA) is designed to overcome premature convergence in ACO.

Design/methodology/approach

The ASP problem is formulated by using task-based representation. The HAWA adopts a global pheromone-updating procedure using the leadership hierarchy concept from the GWO into the ACO to enhance the algorithm performance. In GWO, three leaders are assigned to guide the search direction, instead of a single leader in most of the metaheuristic algorithms. Three assembly case studies used to test the algorithm performance.

Findings

The proposed HAWA performed better in comparison to the Genetic Algorithm, ACO and GWO because of the balance between exploration and exploitation. The best solution guides the search direction, while the neighboring solutions from leadership hierarchy concept avoid the algorithm trapped in a local optimum.

Originality/value

The originality of this research is on the proposed HAWA. In addition to the standard pheromone-updating procedure, a global pheromone-updating procedure is introduced, which adopted leadership hierarchy concept from GWO.

Details

Assembly Automation, vol. 37 no. 2
Type: Research Article
ISSN: 0144-5154

Keywords

1 – 6 of 6
Per page
102050