Developing a feasible neighbourhood search for solving hub location problem in a communication network

4th International Conference on Operational Research

Rakhmawati, Fibri^1 ; Mawengkang, Herman^2 ; Buulolo, F.^2 ; Mardiningsih^2

Graduate School of Mathematics, University of Sumatera Utara, Indonesia^1

Department of Mathematics, University of Sumatera Utara, Indonesia^2

关键词: Capacity restriction;    Hub location;    Hub location problems;    MILP;    Neighborhood search;    Neighbourhood search;    Terminal nodes;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/300/1/012064/pdf
DOI  :  10.1088/1757-899X/300/1/012064

来源: IOP

【 摘 要 】

The hub location with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. This paper discusses how to model the polyhedral properties of the problems and develop a feasible neighbourhood search method to solve the model.