tailieunhanh - Solving uncapacitated multiple allocation p-hub center problem by Dijkstra’s algorithm-based genetic algorithm and simulated annealing

In this study, after presenting a complete definition of the uncapacitated multiple allocation p-hub center problem (UMApHCP) two well-known metaheuristic algorithms are proposed to solve the problem for small scale and large scale standard data sets. | Solving uncapacitated multiple allocation p-hub center problem by Dijkstra s algorithm-based genetic algorithm and simulated annealing