Simulations of PCB Assembly Optimisation Based on the Bees Algorithm with TRIZ-Inspired Operators

Ang, Mei Choo; Ng, Kok Weng; Pham, Duc Truong; Soroka, Anthony John

doi:10.1007/978-3-319-02958-0_31

Cited by 14 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the customised Bees Algorithm the total number of fitness evaluations executed in one run is equal to the bee colony size (݊ = 2000, Table 3) times the duration of the algorithm ‫ݎݐ݅(‬ = 3000 optimisation cycles, Table 3), namely 6 • 10 evaluations. As a term of comparison, Ang et al (2013) obtained a solution of 23.58 s total assembly time, only slightly worse than the solution obtained by the proposed method (23.46 s assembly time). However, their TRIZ-enhanced Bees Algorithm needed nearly 12 • 10 evaluations to find the optimal solution, and the algorithm ran for a total of more than 23 • 10 evaluations.…”

Section: Experimental Results (Mbtd Benchmark)mentioning

confidence: 86%

“…It is therefore impossible to ascertain whether the figures reported in the literature are the expected values of the distribution of results, or the maxima of several attempts (and hence potential outliers to said distribution). Moreover, the methods that used a seeding procedure (Ho and Ji, 2007, Ang et al 2013 started the search relatively close to the optimum (see third row of Table 6). In this case, it is difficult to distinguish the merits of the optimisation technique from those of the seeding procedure.…”

Section: Experimental Results (Mbtd Benchmark)mentioning

confidence: 99%

“…Average solution n/a n/a n/a n/a n/a n/a n/a 24.96 1: (Leu et al 1993) 2: (Nelson and Wille, 1995) 3: (Ong and Tan, 2002) 4: (Ho and Ji, 2007) 5: (Pham, Otri. et al 2007) 6: (Ang et al 2013)…”

Section: Discussionmentioning

confidence: 96%

“…In the following sections of the paper, the performance of the new Bees Algorithm implementation will be compared with the performance of three different kinds of EAs (Leu et al 1993;Nelson and Wille, 1995;Ong and Tan, 2002), one hybrid GA (Ho and Ji, 2007), two implementations of the standard Bees Algorithm (Pham, Otri. et al 2007), and one Bees Algorithm implementation enhanced with TRIZ operators (Ang et al 2013).…”

Section: Literature Reviewmentioning

confidence: 99%

See 3 more Smart Citations

Printed circuit board assembly time minimisation using a novel Bees Algorithm

Castellani

Otri

2019

Computers & Industrial Engineering

Self Cite

View full text Add to dashboard Cite

Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document. When citing, please reference the published version. Take down policy While the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.

show abstract

Section: Experimental Results (Mbtd Benchmark)mentioning

confidence: 86%

Section: Experimental Results (Mbtd Benchmark)mentioning

confidence: 99%

Section: Discussionmentioning

confidence: 96%

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

Printed circuit board assembly time minimisation using a novel Bees Algorithm

Castellani

Otri

2019

Computers & Industrial Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…TRIZ has been applied to help engineers in solving engineering problems for many years and has been used to solve many issues faced by enterprises [12][13][14]. The application of TRIZ has also been extended into other areas including computer science [15,16], social sciences [17], energy efficiency [18], and manufacturing [14,19,20]. With TRIZ, many leading multi-national and innovative companies are able to record tremendous growth and achievements to enhance their global competitiveness [21,22].…”

Section: Trizmentioning

confidence: 99%

Improving Queuing System with Limited Resources Using TRIZ and Arena Simulation

Ahmad¹,

Kok²,

Airdzaman³

et al. 2018

Preprint

Self Cite

View full text Add to dashboard Cite

A university canteen is a queueing system characterised by non-stationary time of arrival with limited resources where the arrival rate is time dependent and has different pattern of arrival for different time interval. This means at certain time of the day, the arrival rate is much higher than other time and for a university canteen, the arrival rate of customer during the lunchtime is much higher and the food (resources) is limited. Non-stationary time dependent queueing system is not easily modelled mathematically hence such queueing systems are modelled using simulation tools such as ARENA. In order to model a non-stationary time dependent queueing system with limited resources and solve queueing problems using ARENA, researchers have to depend on their knowledge and experience in identifying the appropriate and relevant parameters for the system and make modifications to these parameters of the system to solve queueing problems by means of trial and error. Hence, this research work explores the potentials of applying a systematic problem solving tool, TRIZ to help users to make better decisions in deriving solutions to improve a non-stationary time dependent queueing system with limited resources. A case study was carried out to minimize the waiting time of the customers at the cafeteria of the Faculty of Engineering, Universiti Putra Malaysia (UPM), which has queueing problems for years during lunchtime. TRIZ was applied in this case study and the results showed that TRIZ can assist researchers to derive a solution model that lead to shorter waiting time without incurring additional cost and resources.

show abstract