Iterated Local Search Algorithm for the Linear Ordering Problem with Cumulative Costs (LOPCC)
Soft Computing for Intelligent Control and Mobile Robotics, pp. 395-404, 2011.
In this article we approach the linear ordering problem with cumulative costs (LOPCC). Bertacco developed this problem  and propose two exact algorithms, due to the complexity of the problem Duarte propose a Tabu algorithm for LOPCC  and until now that algorithm is the state of the art. In this ongoing research we propose a set ...More
Full Text (Upload PDF)
PPT (Upload PPT)