Multi-objective capacitated multiple allocation hub location problem (MOCMAHLP) is a variation of classic problem, which deals with network design, considering both the number and hubs connections between spokes, as well routing flow on network. In this study, we offer two meta-heuristic approaches based non-dominated sorting genetic algorithm (NSGA-II) archived multi-objective simulated anneal...

This study proposes six novel techniques on the customer’s priority while addressing conventional hub location issue. Each strategy assigns a value to every customer based distance and demand parameters, in which customers are prioritized this value. Then, vehicle fleet is scheduled according priority. A new mixed-integer linear programming model presented applied for each location-scheduling p...

This paper describes an exact algorithm capable of solving large-scale instances of an important hub location problem called the Uncapacitated Hub Location Problem with Multiple Assignments. The algorithm applies Benders decomposition to a strong path-based formulation of the problem. The standard decomposition algorithm is enhanced through the inclusion of several features such as the use of a...

In this paper, we propose a set of two-stage robust optimization models to design reliable p-median facility location networks subject to disruptions. A customized column-and-constraint generation approach is implemented and shown to be more effective than Benders cutting plane method. Numerical experiments are performed on real data and management insights on system design are presented. Our s...

This paper introduces a special kind of multi-depot pickup and delivery problem. In contrast to the general pickup and delivery problem (GPDP, see e.g. [19, 31]) all requests have to be picked up at or delivered to one central location which has the function of a hub or consolidation point. In hub transportation networks routes between customers and the hub are often short, i.e. involve only on...