Improved genetic algorithm for minimum latency problem
Ha-Bang Ban, Nguyễn Đức Nghĩa · 2010
Minimum Latency Problem (MLP), also known as traveling repairman problem, in general case, is proved to be NP--hard. This paper presents several new techniques based on the scheme of the genetic algorithm for solving MLP. The experimental results on the proposed algorithm show that it gives the approximation ratio which is about 1.9 times higher than the lower bound on the optimal solution.