In this paper we consider an extended version of the classical capacitated single allocation hub location problem in which the size of the hubs must be chosen from a finite and discrete set of allowable capacities. We develop a Lagrangian relaxation approach that exploits the problem structure and decomposes the problem into a set of smaller subproblems that can be solved efficiently. Upper bou...

Most of supply chain and Hub location problems involve several conflicting objectives hence requiring a multi-objective formulation. Normally, Multi-objective approaches lead to the maximization of a weighted sum of score functions. Since normalizing these functions and quantifying the weights is not a straightforward process, such approaches are poor in practice. In this research, this difficu...

The efficient design/redesign of the logistics network is essential for companies to maintain their competitive advantage. This paper presents a novel non-linear mixedinteger programming model for the multi-product capacitated location routing inventory problem (MPCLRIP), where a two-layer distribution system consisting of depots and customers was studied. The supply decisions such as location ...

This paper presents a hybrid genetic algorithm to solve the uncapacitated location allocation problems as a combinatorial optimization problem. The proposed method incorporates a modified K-means algorithm that clusters the customers into groups based on the rectilinear distance, and then the initial population of solutions is calculated according to the derived centers of clusters. The hybrid ...

7.

In this paper we propose a nonlinear Generalized Disjunctive Programming (GDP) model to optimize the 2-dimensional continuous location and allocation of the potential facilities based on their maximum capacity and the given coordinates of the suppliers and customer points. The model belongs to the class of Capacitated Multi-facility Weber Problem. We propose a bilevel decomposition algorithm th...

The bat algorithm is a recently proposed meta-heuristic algorithm. Usually in solving the problem of optimization, the position of virtual bats is updated by flying speed, which decreases efficiency of the algorithm and accuracy of the solution. This paper has improved the location update strategy and individual selection strategy of bat algorithm, then puts forward an improved bat algorithm. T...

The integration of Distributed Energy Resources (DER) in the distribution network has plenty of advantages if their allocation and Penetration Level (PL) are done appropriately. Hence, the challenge of finding the best allocation and PL of DERs in large distribution networks is an important but intricate problem. This paper proposes a novel methodology to simultaneously determine the optimal lo...

Flexible AC Transmission Systems (FACTS) devices have shown satisfactory performance in alleviating the problems of electrical transmission systems. Optimal FACTS allocation problem, which includes finding optimal type and location of these devices, have been widely studied by researchers for improving variety of power system technical parameters. In this paper, a DIgSILENT-based Discrete Parti...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.