Search results

This paper aims to improve the computational efficiency of higher-order accurate Noye–Hayman [NH (9,9)] implicit finite difference scheme for the solution of electromagnetic scattering problems in tunnel environments.

The proposed method consists of two major steps: First, the higher-order NH (9,9) scheme is numerically discretized using the finite-difference method. The second step is to use an algorithm based on hierarchical interpolative factorization (HIF) to accelerate the solution of this scheme.

It is observed that the simulation results obtained from the numerical tests illustrate very high accuracy of the NH (9,9) method in typical tunnel environments. HIF algorithm makes the NH (9,9) method computationally efficient for two-dimensional (2D) or three-dimensional (3D) problems. The proposed method could help in reducing the computational cost of the NH (9,9) method very close to O(n) usual O(n3) for a full matrix.

For simplicity, in this study, perfect electric conductor boundary conditions are considered. Future research may also include the utilization of meteorological techniques, including the effects of backward traveling waves, and make comparisons with the experimental data.

This study is directly applicable to typical problems in the field of tunnel propagation modeling for both national commercial and military applications.

Uncertainty is inevitable in real-world engineering optimization. With an outer-inner optimization structure, most previous robust optimization (RO) approaches under interval uncertainty can become computationally intractable because the inner level must perform robust evaluation for each design alternative delivered from the outer level. This paper aims to propose an on-line Kriging metamodel-assisted variable adjustment robust optimization (OLK-VARO) to ease the computational burden of previous VARO approach.

In OLK-VARO, Kriging metamodels are constructed for replacing robust evaluations of the design alternative delivered from the outer level, reducing the nested optimization structure of previous VARO approach into a single loop optimization structure. An on-line updating mechanism is introduced in OLK-VARO to exploit the obtained data from previous iterations.

One nonlinear numerical example and two engineering cases have been used to demonstrate the applicability and efficiency of the proposed OLK-VARO approach. Results illustrate that OLK-VARO is able to obtain comparable robust optimums as to that obtained by previous VARO, while at the same time significantly reducing computational cost.

The proposed approach exhibits great capability for practical engineering design optimization problems under interval uncertainty.

The main contribution of this paper lies in the following: an OLK-VARO approach under interval uncertainty is proposed, which can significantly ease the computational burden of previous VARO approach.

Engineering system design and optimization problems are usually multi-objective and constrained and have uncertainties in the inputs. These uncertainties might significantly degrade the overall performance of engineering systems and change the feasibility of the obtained solutions. This paper aims to propose a multi-objective robust optimization approach based on Kriging metamodel (K-MORO) to obtain the robust Pareto set under the interval uncertainty.

In K-MORO, the nested optimization structure is reduced into a single loop optimization structure to ease the computational burden. Considering the interpolation uncertainty from the Kriging metamodel may affect the robustness of the Pareto optima, an objective switching and sequential updating strategy is introduced in K-MORO to determine (1) whether the robust analysis or the Kriging metamodel should be used to evaluate the robustness of design alternatives, and (2) which design alternatives are selected to improve the prediction accuracy of the Kriging metamodel during the robust optimization process.

Five numerical and engineering cases are used to demonstrate the applicability of the proposed approach. The results illustrate that K-MORO is able to obtain robust Pareto frontier, while significantly reducing computational cost.

The proposed approach exhibits great capability for practical engineering design optimization problems that are multi-objective and constrained and have uncertainties.

A K-MORO approach is proposed, which can obtain the robust Pareto set under the interval uncertainty and ease the computational burden of the robust optimization process.

The purpose of this paper is to review, evaluate and classify the academic research that has been published in facility layout problems (FLPs) and to analyse how researches and practices on FLPs are.

The review is based on 166 papers published from 1953 to 2021 in international peer-reviewed journals. The literature review on FLPs is presented under broader headings of discrete space and continuous space FLPs. The important formulations of FLPs under static and dynamic environments represented in the discrete and continuous space are presented. The articles reported in the literature on various representations of facilities for the continuous space Unequal Area Facility Layout Problems (UA-FLPs) are summarized. Discussed and commented on adaptive and robust approaches for dynamic environment FLPs. Highlighted the application of meta-heuristic solution methods for FLPs of a larger size.

It is found that most of the earlier research adopted the discrete space for the formulation of FLPs. This type of space representation for FLPs mostly assumes an equal area for all facilities. UA-FLPs represented in discrete space yield irregular shape facilities. It is also observed that the recent works consider the UA-FLPs in continuous space. The solution of continuous space UA-FLPs is more accurate and realistic. Some of the recent works on UA-FLPs consider the flexible bay structure (FBS) due to its advantages over the other representations. FBS helps the proper design of aisle structure in the detailed layout plan. Further, the recent articles reported in the literature consider the dynamic environment for both equal and unequal area FLPs to cope with the changing market environment. It is also found that FLPs are Non-deterministic Polynomial-complete problems, and hence, they set the challenges to researchers to develop efficient meta-heuristic methods to solve the bigger size FLPs in a reasonable time.

Due to the extremely large number of papers on FLPs, a few papers may have inadvertently been missed. The facility layout design research domain is extremely vast which covers other areas such as cellular layouts, pick and drop points and aisle structure design. This research review on FLPs did not consider the papers published on cellular layouts, pick and drop points and aisle structure design. Despite the possibility of not being all-inclusive, the authors firmly believe that most of the papers published on FLPs are covered and the general picture presented on various approaches and parameters of FLPs in this paper are precise and trustworthy.

To the best of the authors’ knowledge, this paper reviews and classifies the literature on FLPs for the first time under the broader headings of discrete space and continuous space representations. Many important formulations of FLPs under static and dynamic environments represented in the discrete and continuous space are presented. This paper also provides the observations from the literature review and identifies the prospective future directions.

The facility layout problem aims to assign machines/departments to locations and modeled as a quadratic assignment problem (QAP). Multi period facility layout is a special case of this problem where the sum of material handling and re‐layout costs are minimized. Since the problem is proved to be NP‐hard, several exact and heuristic methods are proposed in the literature. The purpose of this paper is to solve the multi period layout problem by using the modified sub‐gradient (MSG) algorithm for the first time and to determine its parameters.

The MSG algorithm can solve a large‐scale of optimization problems that also includes multi period facility layout. Since the performance of the algorithm depends on parameters, a design of experiment is made to determine the appropriate parameter values.

The proposed method evaluates the parameters of the MSG algorithm and most suitable general algebraic modeling solvers. It is observed that the parameter α value and solver type have main effects for small and large size test problems. Further, the results stated that solver type has more influence on large size test problem.

This study is limited with the determination of the MSG algorithm parameters and solver types on the well known small and large size test problems. Further studies may include other test problem results obtained from the presented MSG algorithm parameters and compare them with best known results in the literature.

The paper determines the parameters of the MSG algorithm that is used to solve the multi period layout problem, for the first time in the literature.

This study explored use of big data analytics (BDA) to analyse data of a large number of construction firms to develop a construction business failure prediction model (CB-FPM). Careful analysis of literature revealed financial ratios as the best form of variable for this problem. Because of MapReduce’s unsuitability for iteration problems involved in developing CB-FPMs, various BDA initiatives for iteration problems were identified. A BDA framework for developing CB-FPM was proposed. It was validated by using 150,000 datacells of 30,000 construction firms, artificial neural network, Amazon Elastic Compute Cloud, Apache Spark and the R software. The BDA CB-FPM was developed in eight seconds while the same process without BDA was aborted after nine hours without success. This shows the issue of not wanting to use large dataset to develop CB-FPM due to tedious duration is resolvable by applying BDA technique. The BDA CB-FPM largely outperformed an ordinary CB-FPM developed with a dataset of 200 construction firms, proving that use of larger sample size with the aid of BDA, leads to better performing CB-FPMs. The high financial and social cost associated with misclassifications (i.e. model error) thus makes adoption of BDA CB-FPMs very important for, among others, financiers, clients and policy makers.