A Metaheuristic Approach to Solve the Alternative Subgraphs Assembly Line Balancing Problem

Capacho, Liliana; Pastor, Rafael

doi:10.5772/22990

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After putting forward the satisfactory performance of the proposed HFABA algorithm in solving ASALBP-1 instances, now it is turn to come to compare the HFABA algorithm against he formerly developed solution procedures in the related literature. In line with this purpose, the HFABA algorithm is comparable against 14 heuristics methods (Capacho et al, 2006c) and GRASP (Capacho & Pastor, 2011), since the benchmark set was also been solved within the context of this two studies. However, unfortunately, among these two studies, results of the GRASP algorithm is not available for us.…”

Section: Benchmark Problemsmentioning

confidence: 98%

“…Constraint set (6), ( 7), (8), ( 9) and (10) guarantee that a task can only be assigned to station if all its predecessors have already been assigned to a preceding station of on the line or to station . Constraint set (11) constructs a unique assembly route by selecting exactly one route for each subassembly among the possible routes. Finally, constraint set (12) ensures assigning the tasks belonging to a particular subgraph to the same route.…”

Section: Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

A Hybrid Metaheuristic based on the Firefly and Bat Algorithms to Solve the Alternative Subgraphs Assembly Line Balancing Problem

Akpınar

Palamut

2023

Preprint

View full text Add to dashboard Cite

Assembly line balancing problem is the process of assigning a set of tasks to a group of stations, considering the precedence relations between tasks. Precedence relations are commonly definite, however, tasks may have alternative precedence relations due to different mounting alternatives. In the presence of alternative precedence relations, the classical balancing problem becomes more complicated given that two interdependent problems, namely selection and balancing, must be solved hierarchically. This type of balancing problem is named as the Alternative Subgraph Assembly Line Balancing Problem (ASALBP). This current paper concerns itself to develop an efficient solution procedure for the ASALBP by hybridizing the firefly and bat algorithms. The proposed hybrid algorithm is evaluated on a set of benchmark problems and numerically compared against the standard firefly and bat algorithms, and some formerly developed heuristic methods. Computational results reveal the satisfactory performance of the proposed algorithm in solving ASALBP instances.

show abstract

Section: Benchmark Problemsmentioning

confidence: 98%