Abstract. We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are located in a cycle, which is called a cycle-star hub network design problem. The problem is essentially equivalent to a cycle-metric labeling problem....

In this article, we consider the set covering problem with conflict constraints, i.e., from each conflicting pair of columns at most one column can appear in feasible solution. For problem, propose appropriate pre-processing techniques and several families Valid Inequalities (VIs) for corresponding integer programming model that result simultaneous presence constraints stable (conflict) constra...

the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...

The airlines reorganization will accelerate the switch of the Chinese mainland civil aviation system from a former point-to-point (PP) structure to a hub-and-spoke (HS) network. In such a context, the major efforts of our paper are put into identifying hub airports in mainland China. We first analyze the HS network’s competitive advantages and find four desirable hub characteristics. A three-le...