Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Electric Power Plants (2)
- Meta-heuristic (2)
- Outage Planning (2)
- Simulated Annealing (2)
- Artificial Intelligence (1)
-
- Boundary search (1)
- Context-awareness (1)
- Crane Sequencing Problem (1)
- Crane Sequencing Problem; diversification; heuristic; intensification; Tabu Search. (1)
- Crane sequencing problem; hybrid ant systems; integer programming; meta-heuristics; simulated annealing (1)
- Design methodBiologically inspired design (1)
- Dynamic facility layout problem; Hybrid ant system; Ant colonies; Simulated annealing; Heuristics (1)
- Dynamic facility layout problem; Simulated annealing; Heuristics; Look-ahead/back strategy (1)
- Dynamic facility layout problem; tabu search; probabilistic tabu search; diversification and intensification strategies; meta-heuristics (1)
- Dynamic space allocation problem; Simulated annealing; Integer programming model; Outage planning; Electric power plants (1)
- Dynamic space allocation problem; Tabu search; Clustering algorithms; Randomized storage policy (1)
- Dynamic space allocation problem; Tabu search; Probabilistic tabu search; Diversification and intensification strategies; Metaheuristics (1)
- Engineering (1)
- Facilities planning and design; Dynamic facility layout problem; Unequal-area departments; Tabu search; Boundary search; Meta-heuristic (1)
- Fixed dimension facilities (1)
- Generalized quadratic assignment problem; tabu search; metaheuristic; construction algorithms (1)
- Genetic algorithm (1)
- Integrated Machine Allocation and Layout Problem; IMALP; Memetic Algorithms; MA; metaheuristics; multicommodity flow problem; quadratic assignment problem; Tabu Search; TS. (1)
- Intelligent design (1)
- Machine Learning (1)
- Numerical Simulation (1)
- Optimisation; operational research; meta-heuristics; logistics; facility layout; supply chain management (1)
- Reservoir Engineering (1)
- Reservoir Management (1)
- Reservoir Modeling (1)
Articles 1 - 21 of 21
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
An Application Of An Unequal-Area Facilities Layout Problem With Fixed-Shape Facilities, Alan Mckendall, Artak Hakobyan
An Application Of An Unequal-Area Facilities Layout Problem With Fixed-Shape Facilities, Alan Mckendall, Artak Hakobyan
Faculty & Staff Scholarship
The unequal-area facility layout problem (UA-FLP) is the problem of locating rectangular facilities on a rectangular floor space such that facilities do not overlap while optimizing some objective. The objective considered in this paper is minimizing the total distance materials travel between facilities. The UA-FLP considered in this paper considers facilities with fixed dimension and was motivated by the investigation of layout options for a production area at the Toyota Motor Manufacturing West Virginia (TMMWV) plant in Buffalo, WV, USA. This paper presents a mathematical model and a genetic algorithm for locating facilities on a continuous plant floor. More specifically, …
An Application Of An Unequal-Area Facilities Layout Problem With Fixed-Shape Facilities, Alan Mckendall, Artak Hakobyan
An Application Of An Unequal-Area Facilities Layout Problem With Fixed-Shape Facilities, Alan Mckendall, Artak Hakobyan
Faculty & Staff Scholarship
The unequal-area facility layout problem (UA-FLP) is the problem of locating rectangular facilities on a rectangular floor space such that facilities do not overlap while optimizing some objective. The objective considered in this paper is minimizing the total distance materials travel between facilities. The UA-FLP considered in this paper considers facilities with fixed dimension and was motivated by the investigation of layout options for a production area at the Toyota Motor Manufacturing West Virginia (TMMWV) plant in Buffalo, WV, USA. This paper presents a mathematical model and a genetic algorithm for locating facilities on a continuous plant floor. More specifically, …
Subsurface Analytics: Contribution Of Artificial Intelligence And Machine Learning To Reservoir Engineering, Reservoir Modeling, And Reservoir Management, Shahab D. Mohaghegh
Subsurface Analytics: Contribution Of Artificial Intelligence And Machine Learning To Reservoir Engineering, Reservoir Modeling, And Reservoir Management, Shahab D. Mohaghegh
Faculty & Staff Scholarship
Subsurface Analytics is a new technology that changes the way reservoir simulation and modeling is performed. Instead of starting with the construction of mathematical equations to model the physics of the fluid flow through porous media and then modification of the geological models in order to achieve history match, Subsurface Analytics that is a completely AI-based reservoir simulation and modeling technology takes a completely different approach. In AI-based reservoir modeling, field measurements form the foundation of the reservoir model. Using data-driven, pattern recognition technologies; the physics of the fluid flow through porous media is modeled through discovering the best, most …
Biologically Inspired Design Of Context-Aware Smart Products, Ang Liu, Ivan Teo, Diandi Chen, Stephen Lu, Thorsten Wuest, Zhinan Zhang, Fei Tao
Biologically Inspired Design Of Context-Aware Smart Products, Ang Liu, Ivan Teo, Diandi Chen, Stephen Lu, Thorsten Wuest, Zhinan Zhang, Fei Tao
Faculty & Staff Scholarship
The rapid development of information and communication technologies (ICTs) and cyber–physical sys-tems (CPSs) has paved the way for the increasing popularity of smart products. Context-awareness isan important facet of product smartness. Unlike artifacts, various bio-systems are naturally characterizedby their extraordinary context-awareness. Biologically inspired design (BID) is one of the most commonlyemployed design strategies. However, few studies have examined the BID of context-aware smart prod-ucts to date. This paper presents a structured design framework to support the BID of context-awaresmart products. The meaning of context-awareness is defined from the perspective of product design.The framework is developed based on the theoretical foundations …
Predictive Models For Charitable Giving Using Machine Learning Techniques, Leily Farrokhvar, Azadeh Ansari, Behrooz Kamali
Predictive Models For Charitable Giving Using Machine Learning Techniques, Leily Farrokhvar, Azadeh Ansari, Behrooz Kamali
Faculty & Staff Scholarship
Private giving represents more than three fourths of all U.S. charitable donations, about 2% of total Gross Domestic Product (GDP). Private giving is a significant factor in funding the nonprofit sector of the U.S. economy, which accounts for more than 10% of total GDP. Despite the abundance of data available through tax forms and other sources, it is unclear which factors influence private donation, and a reliable predictive mechanism remains elu- sive. This study aims to develop predictive models to accurately estimate future charitable giving based on a set of potentially influential factors. We have selected several factors, including unemployment …
A Tabu Search Heuristic For A Generalized Quadratic Assignment Problem, Alan Mckendall, Chihui Li
A Tabu Search Heuristic For A Generalized Quadratic Assignment Problem, Alan Mckendall, Chihui Li
Faculty & Staff Scholarship
The generalized quadratic assignment problem (GQAP) is the task of assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized. The facilities may have different space requirements, and the locations may have varying space capacities. Also, multiple facilities may be assigned to each location such that space capacity is not exceeded. In this paper, an application of the GQAP is presented for assigning a set of machines to a set of locations on the plant floor. Construction algorithms and a simple tabu search heuristic are developed for the …
Changing States Of Multistage Process Chains, Thorsten Wuest, Christopher Irgens, Klaus-Dieter Thoben
Changing States Of Multistage Process Chains, Thorsten Wuest, Christopher Irgens, Klaus-Dieter Thoben
Faculty & Staff Scholarship
Generally, a process describes a change of state of some kind (state transformation). This state change occurs from an initial state to a concluding state. Here, the authors take a step back and take a holistic look at generic processes and process sequences from a state perspective. The novel perspective this concept introduces is that the processes and their parameters are not the priority; they are rather included in the analysis by implication. A supervised machine learning based feature ranking method is used to identify and rank relevant state characteristics and thereby the processes’ inter- and intrarelationships. This is elaborated …
New Tabu Search Heuristics For The Dynamic Facility Layout Problem, Alan Mckendall, Wen-Hsing Liu
New Tabu Search Heuristics For The Dynamic Facility Layout Problem, Alan Mckendall, Wen-Hsing Liu
Faculty & Staff Scholarship
A manufacturing facility is a dynamic system that constantly evolves due to changes such as changes in product demands, product designs, or replacement of production equipment. As a result, the dynamic facility layout problem (DFLP) considers these changes and is defined as the problem of assigning departments to locations during a multi-period planning horizon such that the sum of the material handling and re-arrangement costs is minimised. In this paper, three tabu search (TS) heuristics are presented for this problem. The first heuristic is a simple TS heuristic. The second heuristic adds diversification and intensification strategies to the first, and …
The Generalised Machine Layout Problem, Juan Jaramillo, Alan Mckendall
The Generalised Machine Layout Problem, Juan Jaramillo, Alan Mckendall
Faculty & Staff Scholarship
The Generalised MAchine Layout Problem (GMALP) is a generalisation of the integrated machine and layout problem, which is an extension of the machine layout problem. More specifically, the GMALP is the designing of a facility layout by defining the product mix, selecting the number of machines to be used, assigning these machines to the plant floor, and assigning products to machines such that total profit is maximised. Moreover, the GMALP integrates the quadratic assignment problem with a multicommodity flow problem. Therefore, the GMALP is a computationally intractable problem. Consequently, a mixed integer nonlinear programming model was developed and used to …
Heuristics For The Dynamic Facility Layout Problem With Unequal-Area Departments, Alan Mckendall, Artak Hakobyan
Heuristics For The Dynamic Facility Layout Problem With Unequal-Area Departments, Alan Mckendall, Artak Hakobyan
Faculty & Staff Scholarship
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on the plant floor for multiple periods (material flows between departments change during the planning horizon) such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimized. In this paper, the departments may have unequal-areas and free orientations, and the layout for each period is generated on the continuous plant floor. Because of the complexity of the problem, only small-size problems can be solved in reasonable time using exact techniques. As a result, a boundary search (construction) technique, which …
Metaheuristics For The Integrated Machine Allocation And Layout Problem, Juan Jaramillo, Alan Mckendall
Metaheuristics For The Integrated Machine Allocation And Layout Problem, Juan Jaramillo, Alan Mckendall
Faculty & Staff Scholarship
The Integrated Machine Allocation and Layout Problem (IMALP) is the problem of assigning a set of machines (including machine replicas) to locations while assigning product flows to machines such that Material Handling Cost is minimised. A new mathematical formulation, a Tabu Search (TS) heuristic, and a Memetic Algorithm (MA) are presented for the IMALP. The algorithms were evaluated using a set of test problems available in the literature. TS and the MA obtained equal or better solutions for the dataset than previous techniques presented in the literature. More specifically, TS obtained better solutions in 47% of the instances, and MA …
Solution Techniques For A Crane Sequencing Problem, Jin Shang, Alan Mckendall
Solution Techniques For A Crane Sequencing Problem, Jin Shang, Alan Mckendall
Faculty & Staff Scholarship
In the areas of power plant maintenance, shipyard and warehouse management, resources (items) assigned to locations need to be relocated. It is essential to develop efficient techniques for relocating items to new locations using a crane such that the sum of the cost of moving the items and the cost of loading/unloading the items is minimised. This problem is defined as the crane sequencing problem (CSP). Since the CSP determines the routes for a crane to relocate items, it is closely related to some variants of the travelling salesman problem. However, the CSP considers the capacities of locations and intermediate …
Improved Tabu Search Heuristics For The Dynamic Space Allocation Problem, Alan Mckendall
Improved Tabu Search Heuristics For The Dynamic Space Allocation Problem, Alan Mckendall
Faculty & Staff Scholarship
The dynamic space allocation problem(DSAP) presented in this paper considers the task of assigning items(resources) to locations during a multi-period planning horizon such that the cost of rearranging the items is minimized. Three tabu search heuristics are presented for this problem. The first heuristic is a simple basic tabu search heuristic. The second heuristic adds diversification and intensification strategies to the first, and the third heuristic is a probabilistic tabu search heuristic. To test the performances of the heuristics, a set of test problems from the literature is used in the analysis. The results show that the tabu search heuristics …
Scheduling Maintenance Activities During Planned Outages At Nuclear Power Plants, Alan Mckendall, James Noble, Cerry Klein
Scheduling Maintenance Activities During Planned Outages At Nuclear Power Plants, Alan Mckendall, James Noble, Cerry Klein
Faculty & Staff Scholarship
In order to maintain high production rates, electric power as well as manufacturing plants shut down so that maintenance activities can be performed on machines/equipment. These planned shut downs (outages) usually occur at least once a year and are more frequent for plants with older machines/equipment. The major costs associated with outages are cost of materials, labor cost, and loss of production cost. Due to high cost incurred from loss of production, the objective is to schedule maintenance activities such that outage duration is minimized. Since the resources required to perform maintenance activities are very limited, the problem of scheduling …
Tabu Search Heuristics For The Crane Sequencing Problem, Alan Mckendall
Tabu Search Heuristics For The Crane Sequencing Problem, Alan Mckendall
Faculty & Staff Scholarship
Determining the sequence of relocating items (or resources) moved by a crane from existing positions to newly assigned locations during a multiperiod planning horizon is a complex combinatorial optimisation problem, which exists in power plants, shipyards, and warehouses. Therefore, it is essential to develop a good crane route technique to ensure efficient utilisation of the crane as well as to minimize the cost of operating the crane. This problem was defined as the Crane Sequencing Problem (CSP). In this paper, three construction and three improvement algorithms are presented for the CSP. The first improvement heuristic is a simple Tabu Search …
Hybrid Ant Systems For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang
Hybrid Ant Systems For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang
Faculty & Staff Scholarship
Today’s consumer market demands that manufacturers must be competitive. This requires the efficient operation of manufacturing plants and their ability to quickly respond to changes in product mix and demand. In addition, studies show that material-handling cost make up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearrangement costs is minimized. This problem is called the dynamic facility layout problem (DFLP). In this paper, hybrid ant systems (HASs) are …
Simulated Annealing Heuristics For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang, Saravanan Kuppusamy
Simulated Annealing Heuristics For The Dynamic Facility Layout Problem, Alan Mckendall, Jin Shang, Saravanan Kuppusamy
Faculty & Staff Scholarship
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the problem of arranging and rearranging (when there are changes between the flows of materials between departments) manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized. This problem is known as the dynamic facility layout problem (DFLP). In this paper, two simulated annealing (SA) heuristics are developed for the DFLP. The first SA heuristic (SAI) is a direct adaptation of SA to the DFLP. The second SA heuristic(SAII) is …
A Simulated Annealing Heuristic For A Crane Sequencing Problem, Alan Mckendall, Jin Shang, James Noble, Cerry Klein
A Simulated Annealing Heuristic For A Crane Sequencing Problem, Alan Mckendall, Jin Shang, James Noble, Cerry Klein
Faculty & Staff Scholarship
When maintenance activities during outages at electric power plants are scheduled using project management software, the locations of the resources required to perform the activities are determined such that the total distance the resources travel during the outage is minimized. This problem is defined as the dynamic space allocation problem (DSAP). Once the DSAP solution (i.e., assignment of activities and their required resources to workspaces and of idle resources to storage spaces) is obtained, the problem then is to determine the sequence in which the crane moves the resources to their required locations at the beginning of each period (i.e., …
A Tabu Search Heuristic For The Dynamic Space Allocation Problem, Alan Mckendall, Juan Jaramillo
A Tabu Search Heuristic For The Dynamic Space Allocation Problem, Alan Mckendall, Juan Jaramillo
Faculty & Staff Scholarship
The dynamic space allocation problem(DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distances the resources travel. In this paper, construction algorithms and a tabu search heuristic are presented for the DSAP, and a set of test problems taken from the literature is used to test the performances of the heuristics. The results show that the proposed …
Simulated Annealing Heuristics For Managing Resources During Planned Outages At Electric Power Plants, Alan Mckendall, James Noble, Cerry Klein
Simulated Annealing Heuristics For Managing Resources During Planned Outages At Electric Power Plants, Alan Mckendall, James Noble, Cerry Klein
Faculty & Staff Scholarship
This paper presents a mathematical model and simulated annealing heuristics for assigning activities to workspaces and resources (e.g., equipment, parts, and toolboxes) to work/storage spaces during planned outages at electric power plants. These assignments are made such that the distance resources (toolboxes) travel throughout the duration of the outage is minimized. This problem is de2ned as the dynamic space allocation problem. To test the performance of the proposed techniques, a data set is generated and used in the analysis. The results show that the simulated annealing heuristics perform well with respect to solution quality and computational time.
Facility Layout Of Irregular-Shaped Departments Using A Nested Approach, Alan Mckendall, James Noble, Cerry Klein
Facility Layout Of Irregular-Shaped Departments Using A Nested Approach, Alan Mckendall, James Noble, Cerry Klein
Faculty & Staff Scholarship
The facility layout problem is a very difficult and widely studied optimization problem. As a result, many facility layout models and techniques have been developed. However, the literature does not fully consider or control irregular-shaped departments. In this paper, the nested facility layout problem is defined whereby irregular-shaped departments(i.e. L-shaped, O-shaped or U-shaped) can be generated and controlled. This is a unique problem that can be used to efficiently layout workstations, storage areas and other departments within departments, while arranging the departments with respect to an objective. The objective considered here is to minimize material handling cost. We present a …