Jianping Dou, Jun Li and Xia Zhao
The purpose of this paper is to develop a feasible sequence-oriented new discrete particle swarm optimization (NDPSO) algorithm with novel particles’ updating mechanism for…
Abstract
Purpose
The purpose of this paper is to develop a feasible sequence-oriented new discrete particle swarm optimization (NDPSO) algorithm with novel particles’ updating mechanism for solving simple assembly line balancing problems (SALBPs).
Design/methodology/approach
In the NDPSO, a task-oriented representation is adopted to solve type I and type II SALBPs, and a particle directly represents a feasible task sequence (FTS) as a permutation. Then, the particle (permutation) is updated as a whole using the geometric crossover based on the edit distance with swaps for two permutations. Furthermore, the fragment mutation with adaptive mutation probability is incorporated into the NDPSO to improve exploration ability.
Findings
Case study illustrates the effectiveness of the NDPSO. Comparative results between the NDPSO and existing real-encoded PSO (CPSO) and direct discrete PSO (DDPSO) against benchmark instances of type I SALBP and type II SALBP show promising higher performance of the proposed NDPSO.
Originality/value
A novel particles’ updating mechanism for FTS-encoded particle is proposed to solve the SALBPs. The comparative results indicate that updating of FTS as a whole seems superior to existing updating of FTS by fragment with respect to exploration ability for solving SALBPs. The novel particles’ updating mechanism is also applicable to generalized assembly line balancing problems.
Details
Keywords
Canran Zhang, Jianping Dou, Shuai Wang and Pingyuan Wang
The cost-oriented robotic assembly line balancing problem (cRALBP) has practical importance in real-life manufacturing scenarios. However, only a few studies tackle the cRALBP…
Abstract
Purpose
The cost-oriented robotic assembly line balancing problem (cRALBP) has practical importance in real-life manufacturing scenarios. However, only a few studies tackle the cRALBP using exact methods or metaheuristics. This paper aims to propose a hybrid particle swarm optimization (PSO) combined with dynamic programming (DPPSO) to solve cRALBP type-I.
Design/methodology/approach
Two different encoding schemes are presented for comparison. In the frequently used Scheme 1, a full encoding of task permutations and robot allocations is adopted, and a relatively large search space is generated. DPSO1 and DPSO2 with the full encoding scheme are developed. To reduce the search space and concern promising solution regions, in Scheme 2, only task permutations are encoded, and DP is used to obtain the optimal robot sequence for a given task permutation in a polynomial time. DPPSO is proposed.
Findings
A set of instances is generated, and the numerical experiments indicate that DPPSO achieves a tradeoff between solution quality and computation time and outperforms existing algorithms in solution quality.
Originality/value
The contributions of this paper are three aspects. First, two different schemes of encoding are presented, and three PSO algorithms are developed for the purpose of comparison. Second, a novel updating mechanism of discrete PSO is adjusted to generate feasible task permutations for cRALBP. Finally, a set of instances is generated based on two cost parameters, then the performances of algorithms are systematically compared.
Details
Keywords
The inclusion of esports as an official event in the Hangzhou Asian Games is an important step towards the institutionalisation of esports. The significance of this event marks…
Abstract
The inclusion of esports as an official event in the Hangzhou Asian Games is an important step towards the institutionalisation of esports. The significance of this event marks that Asia once again takes a lead in the global esportisation. This chapter investigates a series of history events in the inclusion process of esports into the comprehensive Games in Asia using process sociology and actor network theory (ANT). This study will analyse the type characteristics of esports events in Hangzhou Asian Games, whilst examining how key stakeholders' interact and balance in the network composed of international sports organisations, host of the event, emerging esports organisations and esports game companies. The chapter also examines the functions of global game industrial economic geography, local cultural politics, esports geopolitics and Olympic values in esports sportization, aiming to reveal the implications of esports inclusion in the Asian Games on the debate of whether esports meets the criteria to be classified as a ‘sport’ and its enlightenment of digital strategy to the inclusion esports in the Olympics.
Details
Keywords
Derya Deliktaş and Dogan Aydin
Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the…
Abstract
Purpose
Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.
Design/methodology/approach
This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.
Findings
The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.
Originality/value
This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.