Comparing Three Proposed Meta-Heuristics To Solve A New P-Hub Location-Allocation Problem

This paper presents a sophisticated mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. in order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. to come up with solutions, we propose to use three meta-heuristic algorithms, namely, genetic algorithm (ga), particle swarm optimization (pso), and simulated annealing (sa). the efficiency and computational results of these algorithms are compared with one another.