A modified ant colony optimization algorithm for multi-objective assembly line balancing

Yuguang Zhong

doi:10.1007/s00500-016-2240-9

Return

A modified ant colony optimization algorithm for multi-objective assembly line balancing

2016-07-01

PRE

钟

钟宇光 (Yuguang Zhong) *

艾

艾渤 (Bo Ai)

DOI：10.1007/s00500-016-2240-9

Original

Original request for help

Save

Abstract

En 中文

In this paper, a novel ant colony optimization algorithm called modified ant colony optimization algorithm (MACO) is proposed for multi-objective single-model assembly line balancing problem (SALBP). The proposed MACO presents a novel heuristic information combined with subsequent task number and deviation time that can guide ants to find better solutions for SALBP. The proposed MACO also adopts three assignment methods (i.e., forward, backward and local rebalancing assignment methods) and stratified sequential algorithm combined with Pareto-optimal front as multi-objective decision. The objectives of SALBP are to minimize the number of workstations, maximize assembly line efficiency and minimize workload variation among workstations. In the latter part of the paper, the proposed MACO has been applied to solve Scholl benchmark problems which include both small-size and large-size problems. The performance of the proposed MACO has been compared with the multi-objective genetic algorithm and the multiple assignment genetic algorithm and has obtained improved results in many test problems.

Keywords:

Ant colony optimization algorithm

Assembly line balancing

Multi-objective

Heuristic information

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.