This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not cove...

• A location-allocation problem under uncertainty is investigated. two-stage stochastic programming model proposed. The mode solved by sample average approximation. Emergencies, especially those considered routine (i.e., occurring on a daily basis), pose great threats to health, life, and property. Immediate response treatment can greatly mitigate these threats. This research conducted optimize...

We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...

In this paper, a two-stage robust optimisation is presented for an uncapacitated hub location problem in which demand uncertain and the level of conservatism controlled by uncertainty budget. first stage, locations establishing facilities were determined, allocation decisions made second stage. An accelerated Benders decomposition algorithm was used to solve problem. Computational experiments s...