A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC)
[chapter]
2010
Lecture Notes in Computer Science
In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte. In this work an experimental study was performed to evaluate the intensification and diversification balance between these phases. The results show that the heuristic construction phase has a major impact on the tabu search algorithm performance, which tends to diminish with large instances. Then to evaluate the diversification
doi:10.1007/978-3-642-15390-7_19
fatcat:pb66x7pmbbes3apawgngu6dcam