Loading...
Search for:
layout
0.007 seconds
Total 94 records
Maximizing the Number of Adjacencies in a Multi Floor Facility Layout Problem with Unequal Rectangular Departments
, Ph.D. Dissertation Sharif University of Technology ; Ghasemi-Taromi, Farhad (Supervisor) ; Hajji, Alireza (Co-Advisor)
Abstract
Facility layout problem (FLP) is one of classical optimization problem in engineering science. The theoretical attractiveness and practical applications of the problem have created a rich literature in the FLP. There are varieties of measure of effectiveness’s for the FLPs, such as minimizing the space cost; minimizing the handing cost; maximizing the adjacencies; maximizing the safety and etc. Maximization of the adjacencies is a common measure of effectiveness, which is addressed in many related literatures especially, in continuous process facility layout. Using of the classical definition of the adjacency usually impose some restrictions on the layout designs. Due to these restrictions...
Safety of Plant Layout by Risk Assessment
, M.Sc. Thesis Sharif University of Technology ; Rashtchian, Davood (Supervisor)
Abstract
One of the most important stages to designing a process plant is layout of equipment in unit area. There are plenty of routine procedures to find out equipment arrangement and their separation distances based on process and cost criteria. One of this Procedures is the use of codes and standards. Although some studies have been carried out to enter safety parameters to conventional procedures, the problem complexity because of the number of involved equipment is still of concern. To clear these ambiguities, the new approach presented in this thesis is aimed at quantifying the effects of adjacent equipment on each other. In this way, fire radiation and explosion have been selected as the major...
Room Layout Estimation and Perception through Cross-task Consistency and Knowledge Fusion
, M.Sc. Thesis Sharif University of Technology ; Bagheri Shouraki, Saeed (Supervisor)
Abstract
Wall detection, as a part of scene understanding and indoor 3D modeling, can be used in robotic, architecture, and augmented reality. In robotic, scene analysis and understanding is knows as one of the main steps in robot navigation and simultaneous localization and mapping and walls need to be detected to form a 3D map of indoor environment. Ceiling and floor are also important elements of an indoor environment, therefore we can see our problem as a room layout estimation if we consider ceiling and floor. Using a deep learning structure, we estimate room layout in a semantic segmentation manner. Our approach is real-time. Our proposed method uses a deep fully-convolutional network, layout...
A robust mathematical model and ACO solution for multi-floor discrete layout problem with uncertain locations and demands
, Article Computers and Industrial Engineering ; Volume 96 , 2016 , Pages 237-248 ; 03608352 (ISSN) ; Eshghi, K ; Sharif University of Technology
Elsevier Ltd
2016
Abstract
The Multi-Floor Layout Problem (MFLP) is the problem of finding the position of each department in a plant floor in a multi-floor building without any overlapping between departments in order to optimize a particular objective function, more commonly the sum of the material handling costs. In this paper, a special class of MFLP, called Uncertain Multi-Floor Discrete Layout Problem (UMFDLP), is defined. In this problem, a multi-floor building is considered in which an underground store is utilized to contain main storages, and different departments can be located in the other floors in potential pre-determined locations. Furthermore, all material flows are not constant. Moreover, the...
Efficient VLSI layout of WK-recursive and WK-pyramid interconnection networks
, Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 123-129 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) ; Sarbazi Azad, H ; Sharif University of Technology
2008
Abstract
The WK-recursive mesh and WK-pyramid networks are recursively-defined hierarchical interconnection networks with excellent properties which well idealize them as alternatives for mesh and traditional pyramid interconnection topologies. They have received much attention due to their favorable attributes such as small diameter, large connectivity, and high degree of scalability and expandability. In this paper, we deal with packagibility and layout area of these networks. These properties are of great importance in the implementation of interconnection networks on chips. We show that WK-recursive, mesh-pyramid and WK-pyramid networks can be laid out in an area of O(N2) which is the optimal...
Plant Layout Problem by Considering Aisle Structure
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
Abstract
The layout problem is directly related to the material handling system; therefore, these two concepts are always being considered together. The main criterion for evaluating the layout in the objective function, is the cost of controlling and moving the materials. In order to calculate the material handling cost, it is necessary to provide an accurate information on the distance between departments, number of goods transported, and the cost of moving a unit of goods per unit of distance; therefore, accurate calculation of the distance between departments is an issue of paramount importance. In the literature, the distance between the departments is measured in three ways: Euclidean distance,...
Topological properties of necklace networks
, Article 8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005, Las Vegas, NV, 7 December 2005 through 9 December 2005 ; Volume 2005 , 2005 , Pages 40-45 ; 0769525091 (ISBN); 9780769525099 (ISBN) ; Sarbazi Azad, H ; Sharif University of Technology
2005
Abstract
We study a class of interconnection networks for multiprocessors, called the Necklace-G network that is based on the base graph G by attaching an array of processors to each two adjacent nodes of G. One of the interesting features of the proposed topology is its scalability while preserving most of the desirable properties of the underlying base network G. We conduct a general study on the topological properties of necklace networks. We first obtain their basic topological parameters, and then present optimal routing and broadcasting algorithms. We also present a unified approach to obtain the topological properties and the VLSI-layout of an arbitrary necklace network based on the properties...
An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
, Article Applied Mathematical Modelling ; Volume 40, Issue 9-10 , 2016 , Pages 5605-5620 ; 0307904X (ISSN) ; Akbari Jokar, M. R ; Sharif University of Technology
Elsevier Inc
2016
Abstract
Single floor facility layout problem (FLP) is related to finding the arrangement of a given number of departments within a facility; while in multi-floor FLP, the departments should be imbedded in some floors inside the facility. The significant influence of layout design on the effectiveness of any organization has turned FLP into an important issue. This paper presents a three- (two-) stage mathematical programming method to find competitive solutions for multi- (single-) floor problems. At the first stage, the departments are assigned to the floors through a mixed integer programming model (the single floor version does not require this stage). At the second stage, a nonlinear programming...
Offshore wind farm layout optimization using particle swarm optimization
, Article Journal of Ocean Engineering and Marine Energy ; Volume 4, Issue 1 , 2018 , Pages 73-88 ; 21986444 (ISSN) ; Chick, J ; Johanning, L ; Khorasanchi, M ; Sharif University of Technology
Springer International Publishing
2018
Abstract
This article explores the application of a wind farm layout optimization framework using a particle swarm optimizer to three benchmark test cases. The developed framework introduces an increased level of detail characterizing the impact that the wind farm layout can have on the levelized cost of energy by modelling the wind farm’s electrical infrastructure, annual energy production, and cost as functions of the wind farm layout. Using this framework, this paper explores the application of a particle swarm optimizer to the wind farm layout optimization problem considering three different levels of wind farm constraint faced by modern wind farm developers. The particle swarm optimizer is found...
Cellular layout design using Tabu search, a case study
, Article RAIRO - Operations Research ; Volume 53, Issue 5 , 2019 , Pages 1475-1488 ; 03990559 (ISSN) ; Ahadi, K ; Sharif University of Technology
EDP Sciences
2019
Abstract
This paper presents a facility layout design for a cellular manufacturing system (CMS), with the automated guided vehicles (AGVs) as the transportation device, to minimize the total material handling costs. A new concept of assigning the workstations to the non-overlapping closed zones, by which independent AGVs are allocated for internal transfer of materials/parts in each zone, is proposed. To handle this problem, a mathematical programming model is developed. The problem has been shown to be NP-hard. This computational difficulty has led us to consider suboptimal solutions generated by a Tabu search with three algorithmic variants. To evaluate the efficiencies of these algorithms, an...
Robust facility layout design for flexible manufacturing: a doe-based heuristic
, Article International Journal of Production Research ; Volume 60, Issue 18 , 2022 , Pages 5633-5654 ; 00207543 (ISSN) ; Salimpour, S ; Akhavan Niaki, S. T ; Azab, A ; Sharif University of Technology
Taylor and Francis Ltd
2022
Abstract
Flexible manufacturing systems (FMS) should be able to respond to changing manufacturing requirements and environments. From the layout point of view, FMS need to be rearranged to fit the new requirements. However, rearranging the layout is often undesirable due to its unpredicted high costs and production disruption. This paper proposes a practical approach to mitigate the effects and repercussions of changing environments and avoid rearranging the layout. A robust layout approach is presented, where changes in product demand and mix are absorbed by altering product routes and not rearranging the layout. In this approach, the problem is decomposed into two sub-problems: sub-problem 1 (SP1)...
Robust Optimization of Integrated Model of Facility Location and Scheduling
,
M.Sc. Thesis
Sharif University of Technology
;
Modarres Yazdi, Mohammad
(Supervisor)
Abstract
In facility location problem with uncertain data, some model parameters such as demand or transportation time are not known in advance and in many cases, no historical information exists to derive their probability distribution functions. In this situation, robust optimization is a prevalent approach. In this study, to apply robust optimization in our model, first we review its concepts and methods. Then, a mathematical model for a new facility location problem, as well as its robust counterpart is developed. Furthermore, we also develop a model for simultaneous decision making regarding facility location problem and sequencing. In this model, it is also assumed the process times are...
Integrated Location-Allocation and Scheduling Model
, M.Sc. Thesis Sharif University of Technology ; Modarres Yazdi, Mohammad (Supervisor)
Abstract
Location-allocation problem is known as one of the classical problems in industrial engineering. The goals of these problems are finding optimal location of facilities and assigning these facilities to service demands from a given set of point. Location-allocation decisions are widespread through all organization in the world concerning private and public businesses. Therefore, in this study, a practical mathematical model is formulated and solved.In this paper we present a new approach for a budgeted constraint capacitated location-allocation problem integrated with cellular layout approach containing cell formation and group scheduling. Main decisions are composed of formation of...
An Algorithm for Solving Generalized Single Row Facility Layout Problem
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
Abstract
Layout design problem is to determine a suitable arrangement for the departments, so that the total costs associated with the flow among departments become least. Single Row Facility Layout Problem which is called SRFLP, is one of layout problems that has many practical applications. This problem and its specific scenarios is often used to model many of the raised issues. This is arrangements of n departments with a specified length in a straight line, so that the sum of the weighted distances between pairs of departments is minimized. We can say that SRFLP is one-dimensional version of the layout design problem and it tries to minimize the cost of communication between rectangular...
Design of Optimum Robust Layout
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
Abstract
Facility Layout Problem (FLP) is known as one of the classical problems in industrial engineering which have acquired high attractiveness to researchers. Therefore, in this study, a practical mathematical model is formulated and solved
In order to have a real and practical model, robust optimization is applied to FLP. Therefore, it is supposed to have dynamic values for departments' dimensions. This assumption is very critical to generate an effective and acceptable layout. We consider that each dimension of a department can be changed in a given interval. Due to this assumption, we introduce two new parameters which are called width and length deviation coefficients, respectively....
In order to have a real and practical model, robust optimization is applied to FLP. Therefore, it is supposed to have dynamic values for departments' dimensions. This assumption is very critical to generate an effective and acceptable layout. We consider that each dimension of a department can be changed in a given interval. Due to this assumption, we introduce two new parameters which are called width and length deviation coefficients, respectively....
Modeling and Solving the Multi-Player Competitive Location Problem in a Continuous Facility Layout
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
Abstract
As time has passed, the cost of maintaining expert human resources has been increasing worldwide; as a result, factories and stakeholder has sought ways to exploit the expertise of their human resources as much as possible so they can reduce their costs and, of course, raise their profits. To achieve this, managers decided to assign their human resources to tasks that demands their expertise and knowledge and therefore provides added value for their companies; nevertheless, this decision needs proper alternatives to do routine and predetermined jobs as substitutions for expert human resources.As the technology and the science has been growing day by day, the use of robots has been extremely...
Robust Facility Layout
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Koorosh (Supervisor)
Abstract
Facility layout problem (FLP) is one of the classical problems that concern with planning for the placement of facilities. Two dimensional layout problem is one of the special layout problems that involves with the arrangement of facilities in non predefined shape. For solving the FLP, a number of information such as dimensions of facilities, relations between facilities, governing constrains etc., are required. But in the most research works, it has been assumed that the required information is precisely known. In this thesis, we challenge this assumption considering the size (length and width) of facilities as bounded variable parameters. In order to make the problem solvable in the sense...
Scale-up of Saturation Function in Composite Cores
, M.Sc. Thesis Sharif University of Technology ; Ghazanfari, Mohammad Hossein (Supervisor) ; Masihi, Mohsen (Co-Advisor)
Abstract
Water injection is one of the main methods of enhanced oil recovery that its success depends on exact study of main effective parameters. Saturation functions including relative permeability function and capillary pressure function are one of the effective parameters on the success of water injection projects. In many reservoirs there is wide heterogeneity and various layering that have different absolute permeability. These features result in uncertainty to measurement of curves of saturation function. Experimental studies on this field are carried out on the composite cores that show heterogeneity and layering media of reservoir. By Scaling up the saturation functions from single cores to...
An optimal time algorithm for minimum linear arrangement of chord graphs
, Article Information Sciences ; Volume 238 , 2013 , Pages 212-220 ; 00200255 (ISSN) ; Rostami, H ; Bagherinezhad, H ; Sharif University of Technology
2013
Abstract
A linear arrangement φ of an undirected graph G = (V, E) with |V| = n nodes is a bijective function φ:V → {0, ..., n - 1}. The cost function is cost(G,φ)=∑uv∈E|(φ(u)-φ(v))| and opt(G) = min∀φcost(G, φ). The problem of finding opt(G) is called minimum linear arrangement (MINLA). The Minimum Linear Arrangement is an NP-hard problem in general. But there are some classes of graphs optimally solvable in polynomial time. In this paper, we show that the label of each node equals to the reverse of binary representation of its id in the optimal arrangement. Then, we design an O(n) algorithm to solve the minimum linear arrangement problem of Chord graphs
One-dimensional adiabatic circuits with inherent charge recycling
, Article Electronics Letters ; Volume 51, Issue 14 , July , 2015 , Pages 1056-1058 ; 00135194 (ISSN) ; Sharifkhani, M ; Sharif University of Technology
Institution of Engineering and Technology
2015
Abstract
A new switching method for the stabilisation of a one-dimensional capacitor array tank for the stepwise charging of a load capacitor is presented. In this method, the tank capacitor configuration is rearranged in a circular manner once the charging process of a load capacitor finishes and before the charging process of a new load capacitor begins. Unlike previously reported methods, this method does not require backward switching for the stabilisation of tank capacitor voltages. Hence, the proposed method reduces the number of charging process steps by a factor of up to 2 compared with the conventional method. Moreover, since the tank recycles its charge inherently, the capacitive load can...