Abstract
This paper deals with a capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. To solve the problem optimally, we present a 0-1 integer programming model and find an optimal solution using CPLEX. As the CAAHLP has impractically demanding for the large-sized problem, a solution method based on combined ant colony optimization algorithm and genetic algorithm is developed which solve hub location problem and node allocation problem respectively. We investigate performance of the proposed solution method through the comparative study. Key Words: Hub Location, Asymmetric Allocation, Ant Colony Optimization, Genetic Algorithm
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
