Path relinking approach for multiple allocation hub maximal covering problem

Authors:
Bo Qu;Kerui Weng
Affiliations:
Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou, 450002, China;School of Economics & Management, China University of Geosciences, Wuhan, 430074, China
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 5
Cited 3

Lower bounds for the hub location problem

Management Science
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
The Latest Arrival Hub Location Problem

Management Science
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
A hybrid GRASP-path relinking algorithm for the capacitated p – hub median problem

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics

Integer linear programming model for multidimensional two-way number partitioning problem

Computers & Mathematics with Applications
Maximal covering location problem (MCLP) with fuzzy travel times

Expert Systems with Applications: An International Journal
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.09

Visualization

Abstract

We consider the multiple allocation hub maximal covering problem (MAHMCP): Considering a serviced O-D flow was required 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 p hubs to maximize the serviced flows? By designing a new model for the MAHMCP, we provide an evolutionary approach based on path relinking. The Computational experience of an AP data set was presented. And a special application on hub airports location of Chinese aerial freight flows between 82 cities in 2002 was introduced.