Artificial Bee Colony Algorithm for The Linear Ordering Problem
AbstractLinear Ordering Problem is an NP-hard combinatorial optimization problem. Several metaheuristic algorithms (Tabu Search, Memetic Algorithm, Variable Neighborhood Search, Simulated Annealing, Scatter Search, Greedy randomized adaptive search procedure) present for the linear ordering problem in literature for finding high quality solutions. This paper presents an Artificial Bee Colony algorithm for solving the linear ordering problem. The results are compared between the other implementations of metaheuristics and Artificial Bee Colony algorithm can produce good solutionsfor the linear ordering problem instances.