18 research outputs found

    The Incremental Cooperative Design of Preventive Healthcare Networks

    Get PDF
    This document is the Accepted Manuscript version of the following article: Soheil Davari, 'The incremental cooperative design of preventive healthcare networks', Annals of Operations Research, first published online 27 June 2017. Under embargo. Embargo end date: 27 June 2018. The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-017-2569-1.In the Preventive Healthcare Network Design Problem (PHNDP), one seeks to locate facilities in a way that the uptake of services is maximised given certain constraints such as congestion considerations. We introduce the incremental and cooperative version of the problem, IC-PHNDP for short, in which facilities are added incrementally to the network (one at a time), contributing to the service levels. We first develop a general non-linear model of this problem and then present a method to make it linear. As the problem is of a combinatorial nature, an efficient Variable Neighbourhood Search (VNS) algorithm is proposed to solve it. In order to gain insight into the problem, the computational studies were performed with randomly generated instances of different settings. Results clearly show that VNS performs well in solving IC-PHNDP with errors not more than 1.54%.Peer reviewe

    Formulating and Solving Sustainable Stochastic Dynamic Facility Layout Problem: A Key to Sustainable Operations

    Get PDF
    Facility layout design, a NP Hard problem, is associated with the arrangement of facilities in a manufacturing shop floor, which impacts the performance, and cost of system. Efficient design of facility layout is a key to the sustainable operations in a manufacturing shop floor. An efficient layout design not only optimizes the cost and energy due to proficient handling but also increase flexibility and easy accessibility. Traditionally, it is solved using meta-heuristic techniques. But these algorithmic or procedural methodologies do not generate effective and efficient layout design from sustainable point of view, where design should consider multiple criteria such as demand fluctuations, material handling cost, accessibility, maintenance, waste and more. In this paper, to capture the sustainability in the layout design these parameters are considered, and a new Sustainable Stochastic Dynamic Facility Layout Problem (SDFLP) is formulated and solved. SDFLP is optimized for material handling cost and rearrangement cost using various meta-heuristic techniques. The pool of layouts thus generated is then analyzed by Data Envelopment Analysis (DEA) to identify efficient layouts. A novel hierarchical methodology of consensus ranking of layouts is proposed which combines the multiple attributes/criteria. Multi Attribute decision-making (MADM) Techniques such as Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), Interpretive Ranking Process (IRP) and Analytic hierarchy process (AHP), Borda-Kendall and Integer Linear Programming based rank aggregation techniques are applied. To validate the proposed methodology data sets for facility size N=12 for time period T=5 having Gaussian demand are considered

    A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems

    No full text
    Facility layout problem is associated with the arrangement of facilities in a plant. It is a critical issue in the early stages of designing a manufacturing system because it affects the total manufacturing cost significantly. Dynamic and robust layouts are flexible enough to cope with fluctuations and uncertainties in product demands in volatile environment of flexible manufacturing systems. Since the facility layout is a hard combinatorial optimization problem, intelligent approaches are the most appropriate methods for solving the large size of this problem in reasonable computational time. In this paper, first of all, dynamic and robust layouts are surveyed. After a quick look of different mathematical models, including quadratic assignment, quadratic set covering, mixed integer programming, and graph theoretic models, the various solution methods especially intelligent approaches along with their advantages and disadvantages are surveyed. Finally, after review of hybrid algorithms, the conclusion of this paper is reported
    corecore