Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic beten the origin-destination pairs such that the maximum cost beten origin-destination pairs is minimum. It is assumed that transportation beten non-hub nodes is possible only via chosen hub nodes.   propose a basic variable neighborhood search (VNS) heuristic for solving this NP hard problem. In addition  apply two mathematical formulations of the UMApHCP in order to detect limitations of the current state-of-the-art solver used for this problem. The heuristics are tested on benchmark instances for p-hub problems. The obtained results reveal the superiority of the proposed basic VNS over the state-of-the-art as ll as over a multi-start local search heuristic developed by us in this paper.
['Jack Brimberg', 'Nenad Mladenović', 'Raca Todosijević', 'Dragan Urošević']
I am writing a research paper on a idea A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem
[{"from": "human", "value": "I am writing a research paper on a idea A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic beten the origin-destination pairs such that the maximum cost beten origin-destination pairs is minimum. It is assumed that transportation beten non-hub nodes is possible only via chosen hub nodes.   propose a basic variable neighborhood search (VNS) heuristic for solving this NP hard problem. In addition  apply two mathematical formulations of the UMApHCP in order to detect limitations of the current state-of-the-art solver used for this problem. The heuristics are tested on benchmark instances for p-hub problems. The obtained results reveal the superiority of the proposed basic VNS over the state-of-the-art as ll as over a multi-start local search heuristic developed by us in this paper."}]