190 research outputs found
SIMAID: a rapid development methodology for the design of acyclic, bufferless, multi-process and mixed model agile production facilities for spaceframe vehicles
The facility layout problem (FL) is a non-linear, NP-complete problem whose complexity is derived from the vast solution space generated by multiple variables and interdependent factors. For reconfigurable, agile facilities the problem is compounded by parallelism (simultaneity of operations) and scheduling issues. Previous work has either concentrated on conventional (linear or branched) facility layout design, or has not considered the issues of agile, reconfigurable facilities and scheduling. This work is the first comprehensive methodology incorporating the design and scheduling of parallel cellular facilities for the purpose of easy and rapid reconfiguration in the increasingly demanding world of agile manufacturing. A novel three-stage algorithm is described for the design of acyclic (asynchronous), bufferless, parallel, multi-process and mixed-model production facilities for spaceframe-based vehicles. Data input begins with vehicle part processing and volume requirements from multiple models and includes time, budget and space constraints. The algorithm consists of a powerful combination of a guided cell formation stage, iterative solution improvement searches and design stage scheduling. The improvement iterations utilise a modified (rules-based) Tabu search applied to a constant-flow group technology, while the design stage scheduling is done by the use of genetic algorithms. The objective-based solution optimisation direction is not random but guided, based on measurement criteria from simulation. The end product is the selection and graphic presentation of the best solution out of a database of feasible ones. The case is presented in the form of an executable program and three real world industrial examples are included. The results provide evidence that good solutions can be found to this new type and size of heavily constrained problem within a reasonable amount of time
Integrated quadratic assignment and continuous facility layout problem
In this paper, an integrated layout model has been considered to incorporate intra and inter-department layout. In the proposed model, the arrangement of facilities within the departments is obtained through the QAP and from the other side the continuous layout problem is implemented to find the position and orientation of rectangular shape departments on the planar area. First, a modified version of QAP with fewer binary variables is presented. Afterward the integrated model is formulated based on the developed QAP. In order to evaluate material handling cost precisely, the actual position of machines within the departments (instead of center of departments) is considered. Moreover, other design factors such as aisle distance, single or multi row intra-department layout and orientation of departments have been considered. The mathematical model is formulated as mixed-integer programming (MIP) to minimize total material handling cost. Also due to the complexity of integrated model a heuristic method has been developed to solve large scale problems in a reasonable computational time. Finally, several illustrative numerical examples are selected from the literature to test the model and evaluate the heuristic
Planning Wireless Cellular Networks of Future: Outlook, Challenges and Opportunities
Cell planning (CP) is the most important phase in the life cycle of a cellular system as it determines the operational expenditure, capital expenditure, as well as the long-term performance of the system. Therefore, it is not surprising that CP problems have been studied extensively for the past three decades for all four generations of cellular systems. However, the fact that small cells, a major component of future networks, are anticipated to be deployed in an impromptu fashion makes CP for future networks vis-a-vis 5G a conundrum. Furthermore, in emerging cellular systems that incorporate a variety of different cell sizes and types, heterogeneous networks (HetNets), energy efficiency, self-organizing network features, control and data plane split architectures (CDSA), massive multiple input multiple out (MIMO), coordinated multipoint (CoMP), cloud radio access network, and millimetre-wave-based cells plus the need to support Internet of Things (IoT) and device-to-device (D2D) communication require a major paradigm shift in the way cellular networks have been planned in the past. The objective of this paper is to characterize this paradigm shift by concisely reviewing past developments, analyzing the state-of-the-art challenges, and identifying future trends, challenges, and opportunities in CP in the wake of 5G. More specifically, in this paper, we investigate the problem of planning future cellular networks in detail. To this end, we first provide a brief tutorial on the CP process to identify the peculiarities that make CP one of the most challenging problems in wireless communications. This tutorial is followed by a concise recap of past research in CP. We then review key findings from recent studies that have attempted to address the aforementioned challenges in planning emerging networks. Finally, we discuss the range of technical factors that need to be taken into account while planning future networks and the promising research directions that necessitates the paradigm shift to do so
Genetic programming for manufacturing optimisation.
A considerable number of optimisation techniques have been proposed for the solution of problems associated with the manufacturing process. Evolutionary computation methods, a group of non-deterministic search algorithms that employ the concept of Darwinian strife for survival to guide the search for optimal solutions, have been extensively used for this purpose.
Genetic programming is an evolutionary algorithm that evolves variable-length solution representations in the form of computer programs. While genetic programming has produced successful applications in a variety of optimisation fields, genetic programming methodologies for the solution of manufacturing optimisation problems have rarely been reported. The applicability of genetic programming in the field of manufacturing optimisation is investigated in this thesis. Three well-known problems were used for this purpose: the one-machine total tardiness problem, the cell-formation problem and the multiobjective process planning selection problem. The main contribution of this thesis is the introduction of novel genetic programming frameworks for the solution of these problems.
In the case of the one-machine total tardiness problem genetic programming employed combinations of dispatching rules for the indirect representation of job schedules. The hybridisation of genetic programming with alternative search algorithms was proposed for the solution of more difficult problem instances. In addition, genetic programming was used for the evolution of new dispatching rules that challenged the efficiency of man-made dispatching rules for the solution of the problem.
An integrated genetic programming - hierarchical clustering approach was proposed for the solution of simple and advanced formulations of the cell-formation problem. The proposed framework produced competitive results to alternative methodologies that have been proposed for the solution of the same problem. The evolution of similarity coefficients that can be used in combination with clustering techniques for the solution of cell-formation problems was also investigated.
Finally, genetic programming was combined with a number of evolutionary multiobjective techniques for the solution of the multiobjective process planning selection problem. Results on test problems illustrated the ability of the proposed methodology to provide a wealth of potential solutions to the decision-maker
Algorithms and Methods for Designing and Scheduling Smart Manufacturing Systems
This book, as a Special Issue, is a collection of some of the latest advancements in designing and scheduling smart manufacturing systems. The smart manufacturing concept is undoubtedly considered a paradigm shift in manufacturing technology. This conception is part of the Industry 4.0 strategy, or equivalent national policies, and brings new challenges and opportunities for the companies that are facing tough global competition. Industry 4.0 should not only be perceived as one of many possible strategies for manufacturing companies, but also as an important practice within organizations. The main focus of Industry 4.0 implementation is to combine production, information technology, and the internet. The presented Special Issue consists of ten research papers presenting the latest works in the field. The papers include various topics, which can be divided into three categories—(i) designing and scheduling manufacturing systems (seven articles), (ii) machining process optimization (two articles), (iii) digital insurance platforms (one article). Most of the mentioned research problems are solved in these articles by using genetic algorithms, the harmony search algorithm, the hybrid bat algorithm, the combined whale optimization algorithm, and other optimization and decision-making methods. The above-mentioned groups of articles are briefly described in this order in this book
Efficient and flexible algorithm for plant layout generation
A facilities layout, also called plant layout, consists of the production areas, production related or support areas and personnel areas within the building. Plant layout design is one of the strategic fields that determine the long run efficiency of operation.;This dissertation proposes an efficient and flexible plant layout algorithm to minimize the material handling cost and deal with change in future. A material flow forecasting tool, a scheduling module related to layout design and an evaluation method of flexible layouts are also proposed by this dissertation. A computer-based system will be developed to integrate all of the functions.;The first chapter of this paper introduces the issues in plant layout design. Because the volume and the mix of products to be produced are typically not known with certainty nor are they static over time, it is desirable to design a flexible layout to accommodate these changes. Chapter two gives a brief review of various algorithms and programs of layout design. Chapter three provides insight into the approach taken for the proposed flexible layout design. Then it presents all major algorithms involved in forecasting, pair exchange layout design, flexible layout design and evaluation. Chapter four is concerned with the computer-based system analysis and design. Chapter five uses several case studies to validate the algorithms and computer system. Chapter six explains the contributions of this research. Chapter seven gives the conclusions and future work
Recommended from our members
Distributed Logic Memory computer for process control
An instruction set and programming examples are described for
a Distributed Logic Memory computer organization. The computer is
designed to take advantage of the economies of very large-scale circuit
integration. In addition, the computer can grow in an orderly
way. As it grows there is increased parallelism possible so that the
amount of spare real time in a control application is not greatly reduced.
Finally, such an organization should permit stored program
control in relatively small applications where up to now control by a
conventionally organized computer has been prohibitively expensive.
The computer consists of a linear array of identical, small, sequential
machines, or cells. The structure is similar to that of the
Distributed Logic Memory originally proposed by C. Y. Lee. It was
demonstrated by J. N. Sturman that the addition of sequential logic to
each cell permits the memory to become a self-contained computing
system.
It is the purpose of this thesis to produce an application-oriented
process control computer design based on the concepts of Lee and
Sturman. It was found necessary to increase the length of the memory
word in each cell. The ability to store instructions and data in cells
is retained. Increasing the memory word length of each cell permits
an expanded instruction repertoire. The low-ordered three bits of
every memory word are arranged to identify a cell as one of eight
possible types. A program instruction includes modifier bits which
specify the types of cells on which the instruction is to operate. This
facility enhances the efficiency of programs.
The logic design of the cell is complete enough to permit estimating
gate count per cell. An analysis of the sensitivity of gate
count to changes in the instruction set is included. A program simulation
of the Distributed Logic Memory computer assisted in its development
and later permitted verification of programs written for the
computer. The existence of a compiler permitted such programs to
be written in a convenient, symbolic form.
A data multiplexer is developed as a practical application for
the Distributed Logic Memory computer structure. The necessary
data multiplexer program, which consists of about 100 instructions,
is shown
- …