Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

Due to the increased competition in manufacturing industries play a driving force towards reducing the manufacturing costs by efficient design of facility layout. The success of manufacturing industries depends on the design of the facility that is able to adapt quickly and effectively for any changes in market requirements, technological changes, etc. The Facility Layout Problem (FLP) is a com...

This paper addresses the design of an assembly system facility consisting of multiple assembly lines of different shapes. In such a design problem there are two conflicting objectives: (i) to minimize the overall area of the facility; and (ii) to maximize the efficiency of the material handling transportation system. We first address the optimization problem of objective (ii) when replacing obj...

Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

Facility layout has considerable effects on the operational productivity and efficiency of a facility because of its direct effect on material handling costs. The objective of this study is to propose newweighted association rule-based data mining approaches for facility layout problem. Classic association rule-based approaches assume that each item has the same level of significance. On the ot...

The unequal-areas facility layout problem is concerned with finding the optimal arrangement of a given number of non-overlapping indivisible departments with unequal area requirements within a facility. We present a convex-optimisation-based framework for efficiently finding competitive solutions for this problem. The framework is based on the combination of two mathematical programming models....