Evolutionary Algorithms for Multiple Allocation Hub Set Covering Problem

We consider the multiple allocation hub set covering problem (MAHSCP): requiring all O-D flow to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate hubs at minimal cost. Based on a new model of MAHSCP, the paper provides two evolutionary approaches by scatter search (SS) and genetic algorithm (GA). The computational experience shows both heuristics work well for MAHSCP. But GA get a better computing performance than SS both in terms of quality of solutions and of the required times.