An ant colony optimization based hyper-heuristic for the mixed model assembly line balancing problem with setups

被引：0

作者：

Akpinar, Şener ^{[1
]}

机构：

[1] Department of Industrial Engineering, Dokuz Eylul University, Izmir

来源：

Soft Computing | 2024年 / 28卷 / 21期

关键词：

Ant colony optimization; Hyper-heuristic; Mixed model assembly line balancing; Sequence-dependent setup times;

D O I：

10.1007/s00500-024-10299-9

中图分类号：

学科分类号：

摘要：

The assembly line balancing problems get turn into a hierarchical nature, which refers that the assignment problem must be solved simultaneously with a sequencing problem, in the presence of setup times that depend on the task execution sequences. This paper tries to design a hyper-heuristic, which tries to explore a search space of heuristics rather than a search space of solutions, to solve the mixed model assembly line balancing problem with setups. In line with this purpose, the ant colony optimization algorithm is employed to explore the search space composed of several assembly line balancing heuristics. Namely, this paper proposes an effective ant colony optimization based hyper-heuristic to tackle the assembly line balancing problems with sequence-dependent setup times. The performance evaluation tests of the designed hyper-heuristic are done on the benchmark instances taken from the related literature. The obtained results indicate the effectiveness of the designed algorithm. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

引用

页码：12587 / 12602

页数：15

共 54 条

[1]

Aghajani M., Ghodsi R., Javadi B., Balancing of robotic mixed-model two-sided assembly line with robot setup times, Int J Adv Manuf Technol, 74, 5-8, pp. 1005-1016, (2014)

[2]

Akpinar S., Bayhan G.M., Baykasoglu A., Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks, Appl Soft Comput, 13, 1, pp. 574-589, (2013)

[3]

Akpinar S., Elmi A., Bektas T., Combinatorial Benders cuts for assembly line balancing problems with setups, Eur J Oper Res, 259, 2, pp. 527-537, (2017)

[4]

Akpinar S., Baykasoglu A., Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model, J Manuf Syst, 33, 1, pp. 177-187, (2014)

[5]

Akpinar S., Baykasoglu A., Modeling and solving mixed-model assembly line balancing problem with setups. Part II: A multiple colony hybrid bees algorithm, J Manuf Syst, 33, 4, pp. 445-461, (2014)

[6]

Andres C., Miralles C., Pastor R., Balancing and scheduling tasks in assem- bly lines with sequence-dependent setup times, Eur J Oper Res, 187, 3, pp. 1212-1223, (2008)

[7]

Aslan S., Mathematical model and a variable neighborhood search algorithm for mixed-model robotic two-sided assembly line balancing problems with sequence-dependent setup times, Optim Eng, 24, 2, pp. 989-1016, (2023)

[8]

Battaia O., Dolgui A., Reduction approaches for a generalized line balancing problem, Comput Oper Res, 39, 10, pp. 2337-2345, (2012)

[9]

Baydar C.M., Saitou K., Automated generation of robust error recovery logic in assembly systems using genetic programming, J Manuf Syst, 20, 1, pp. 55-68, (2001)

[10]

Baykasoglu A., Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems, J Intell Manuf, 17, 2, pp. 217-232, (2006)

← 1 2 3 4 5 6 →