The design of hub-and-spoke transport networks is a strategic planning problem, as the choice of hub locations has to remain unchanged for long time periods. However, strikes, disasters or traffic breakdown can lead to the unavailability of a hub for a short period of time. Therefore it is important to consider such events already in the planning phase, so that a proper reaction is possible; on...

centralizing and using proper transportation facilities cut down costs and traffic. hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. a distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

Hub location problem (HLP) is one of the most important problems in the areas of logistics and telecommunication network design. In this paper we address the bi-objective non-strict single allocation hub location problem (BONSSAHLP). The non-strict property of this problem which allows establishment of direct links between pairs of non-hub nodes makes it somehow different from the conventional ...

In this paper, we consider k-level hard capacitated facility location problem.

It is well known that choosing a good formulation for a mixed-integer optimization model can drastically reduce its solution time with a linear-programming based branch-and-bound algorithm. Integer optimization software such as CPLEX and XPRESS-MP has progressed rapidly in recent years and implements powerful branchand-cut algorithms, combining branch-and-bound with cutting plane generation. In...

This paper presents a multi-objective mixed-integer non-linear programming model for congested multiple-server discrete facility location problem with uniformly distributed demands along the network edges. Regarding capacity of each and maximum waiting time threshold, developed aims to determine number locations established facilities their corresponding assigned servers such that traveling dis...

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot...