Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
The proposed approach is based on a modified genetic algorithm, which generates an initial population with heuristic solutions obtained from the well-known (LKH) heuristic algorithm for the TSP together with the solution of a mathematical model for the shortest path problem. In addition, two recombination methods and a mutation operator are considered. Computational experiments on benchmark instances show that the proposed algorithm can obtain high-quality solutions within short computing times. | A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet
