Coopetition in Solving Combinatorial Optimization Problem: Application to the Industrial Assembly Line Balancing Problem

Authors

  • Yuexian Gao
  • Mohd Nor Akmal Khalid
  • Hiroyuki Iida
  • Umi Kalsom Yusof

Abstract

Optimization problem, specifically combinatorial optimization problem, has been investigated for decades. While a variety of computational approaches have been introduced, little works had adopted the concept of coopetition in solving the complex combinatorial optimization problem. This paper introduces coopetition strategy, adopted in an approximate approach inspired from biological system to effectively address the underlying problem. Also, problem-specific information was also incorporated to improve the approach quality. The proposed approach was justified by applying to 242 data set instances of assembly line balancing problems. The approach had obtained the optimal results for all data sets instances, with new optimal was found in some data instances. In addition, the approach also obtained statistically significant results in three out of five approaches up to 99.5% confidence interval. This shows that coopetition strategy may be the key to improving the performance of an approximate approach.

Downloads

Published

2020-02-21

Issue

Section

Articles