hub location problems are among the extensions ofclassical location problems that have numerous applications in designingtransportation, postal, and telecommunication networks. despite the evidentattention of researchers to these problems, there are few studies on designinghub networks under uncertainty and disruption. in this study, the capacitatedsingle allocation hub location problem under d...

We o er a formulation that locates hubs on a network in a competitive environment; that is, customer capture is sought, which happens whenever the location of a new hub results in a reduction of the current cost (time, distance) needed by the tra c that goes from the speci ed origin to the speci ed destination. The formulation presented here reduces the number of variables and constraints as co...

The paper aims to study a multi-period maximal covering location problem with the configuration of different types facilities, as an extension classical (MCLP). proposed model can have applications such locating disaster relief hospitals, and chain supermarkets. facilities are supposed be comprised various units, called modules. modules sizes transfer between during planning horizon according d...

As unmanned aerial vehicle (UAV) technology improves, it will become increasingly efficient to use UAVs as part of package delivery networks. However, while the vehicle routing problem (VRP) is well studied, studying routing on a system of drones that can near-instantaneously transmit information about position, held packages, and destination while also able to near-instantaneously recieve new ...

This paper presents a branch–and–price algorithm for the Capacitated Hub Location Problem with Single Assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the Restricted Master Problem (RPM). It is shown how to solve the pricing problem for finding new columns to be added to the RMP, or for proving that the lower bound of the current RMP is valid. Also, a lower bou...

The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. This problem was introduced by Yaman and Carello in [18] and treated by a branch-and-cut and a tabu search ...

Wepropose a generalization of themulti-depot capacitated vehicle routing problemwhere the assumption of visiting each customer does not hold. In this problem, called the Multi-Depot Covering Tour Vehicle Routing Problem (MDCTVRP), the demand of each customer could be satisfied in two different ways: either by visiting the customer along the tour or by “covering” it. When a customer is visited, ...