Search results

Many practical problems in engineering require fast, accurate numerical results. In particular, in cyclic plasticity or fatigue simulations, the high number of loading cycles increases the computation effort and time. The purpose of this study is to show that the return mapping technique in the framework of unconventional plasticity theories is a good compromise between efficiency and accuracy in finite element analyses.

The accuracy of the closest point projection method and the cutting plane method implementations for the subloading surface model are discussed under different loading conditions by analyzing the error as a function of the input step size and the efficiency of the algorithms.

Monotonic tests show that the two different implicit integration schemes have the same accuracy and are in good agreement with the solution obtained using an explicit forward Euler scheme, even for large input steps. However, the closest point projection method seems to describe better the evolution of the similarity centre in the cyclic loading analyses.

The purpose of this work is to show two alternative implicit integration schemes of the extended subloading surface method for metallic materials. The backward Euler integrations can guarantee a good description of the material behaviour and, at the same time, reduce the computational cost. This aspect is particularly important in the field of low or high cycle fatigue, because of the large number of cycles involved.

A detailed description of both the cutting plane and closest point projection methods is offered in this work. In particular, the two integrations schemes are compared in terms of accuracy and computation time for monotonic and cyclic loading tests.

The purpose of this paper is to introduce a computational time dependent modeling to investigate propagation of elastic-viscoplastic zones in the shock wave loaded circular plates.

Constitutive equations are implemented incrementally by the Von-Kármán finite deflection system which is coupled with a mixed strain hardening rule and physical-base viscoplastic models. Time integrations of the equations are done by the return mapping technique through the cutting-plane algorithm. An integrated solution is established by pseudo-spectral collocation methodology. The Chebyshev basis functions are utilized to evaluate the coefficients of displacement fields. Temporal terms are discretized by the Houbolt marching method. Spatial linearizations are accomplished by the quadratic extrapolation technique.

Results of the center point deflections, effective plastic strain and stress (dynamic flow stress) and temperature rise are compared for three features of the Von-Kármán system. Identifying time history of resultant stresses, propagations of the viscoplastic plastic zones are illustrated for two circumstances; with considering strain rate and hardening effects, and without them. Some of modeling and computation aspects are discussed, carefully. When the results are compared with experimental data of shock wave loadings and finite element simulations, good agreements between them are observed.

This computational approach makes coupling the structural equations with the physical descriptions of the high rate deformation through step-by-step spectral solution of the constitutive equations.

Several constitutive models are available in the literature to describe the mechanical behaviour of cement stabilized soils. However, difficulties in implementing such models within commercial finite element programs have hindered their application to solve related boundary value problems. Therefore, the aim of this study is to implement a constitutive model, which has the capability to simulate cement stabilized soil behaviour, into the finite element program ABAQUS through the user material subroutine UMAT.

After a detailed review of existing constitutive models for cement stabilized soils, a model based on the elasto‐plastic theory and the extended critical state concept with an associated flow rule is selected for the finite element implementation. A semi‐implicit integration method (cutting plane algorithm) with a continuum elasto‐plastic modulus and path dependent stress prediction strategy has been used in the implementation. The performance of the new finite element formulation of the constitutive model is verified by simulating triaxial test data using the finite element program with the new implementation and predictions from constitutive equations as well as experimental data.

The paper provides the implementation procedure of the constitutive model into ABAQUS but this method is useful for the implementation of any other constitutive model into ABAQUS or any other finite element program. Simulated results for the volumetric deformation of cement stabilized soils show that the cement stabilized soils do not obey the associated flow rule at high confining pressures. The parametric study shows that the influence of cementation increases the brittle nature and the bearing capacity of treated clay. In addition the results show that proposed finite element implementation has the ability to illustrate key features of the cement stabilized clay.

This paper presents an implementation of an elasto‐plastic constitutive model, based on the extended critical state concept, for cement stabilized soils into a finite element programme, which has been identified as an important and challenging topic in computational geomechanics. This implementation is useful in solving boundary value problems in geomechanics involving cement stabilized soils, incorporating key characteristics of these soils.

To have all the required components of batches of product orders ready for timely assembly and delivery, the real time wood strip cutting patterns in a major solid wood furniture manufacturing plant has to be dynamically generated based on both the order priority and the minimum wood waste.

An adaptive fuzzy ranking method and a recursive function for pattern generation were integrated into an optimization procedure to solve the real time one‐dimensional multiple‐grade cutting stock problem when orders are prioritized.

The simulation results illustrate that the optimization algorithm produce considerably less waste than the current approach. If implemented in the industry, the saving in raw material could be in the range of 5‐10 percent.

The optimization algorithm is for the cut‐to‐size decisions only with the consideration of the order priorities. The overall scheduling of the production shop floor is not addressed.

The algorithm can be used on the cutting machines as an online patterns generator and cutting optimizer.

There is no literature available for the real time one‐dimensional multiple‐grade cutting stock problem when orders are prioritized. The few commercial optimizers have unknown algorithms with unpredictable waste.

The purpose of this study, which is designed for the implementation of models in the implicit finite element framework, is to propose a robust, stable and efficient explicit integration algorithm for rate-independent elasto-plastic constitutive models.

The proposed automatic substepping algorithm is founded on an explicit integration scheme. The estimation of the maximal subincrement size is based on the stability analysis.

In contrast to other explicit substepping schemes, the algorithm is self-correcting by definition and generates no cumulative drift. Although the integration proceeds with maximal possible subincrements, high level of accuracy is attained. Algorithmic tangent stiffness is calculated in explicit form and optionally no analytical second-order derivatives are needed.

The algorithm is convenient for elasto-plastic constitutive models, described with an algebraic constraint and a set of differential equations. This covers a large family of materials in the field of metal plasticity, damage mechanics, etc. However, it cannot be directly used for a general material model, because the presented algorithm is convenient for solving a set of equations of a particular type.

The estimation of the maximal stable subincrement size is computationally cheap. All expressions in the algorithm are in explicit form, thus the implementation is simple and straightforward. The overall performance of the approach (i.e. accuracy, time consumption) is fully comparable with a default (built-in) ABAQUS/Standard algorithm.

The estimated maximal subincrement size enables the algorithm to be stable by definition. Subincrements are much larger than those in conventional substepping algorithms. No error control, error correction or local iterations are required even in the case of large increments.

Fortification-interdiction models provide system designers with a broader perspective to identify and protect vital components. Based on this concept, the authors examine how disruptions impact critical supply systems and propose the most effective protection strategies based on three levels of decision-makers. This paper aims to investigate location and fortification decisions at the first level. Moreover, a redesign problem is presented in the third level to locate backup facilities and reallocate undisrupted facilities following the realization of the disruptive agent decisions at the second level.

To address this problem, the authors develop a tri-level planner-attacker-defender optimization model. The model minimizes investment and demand satisfaction costs and alleviates maximal post-disruption costs. While decisions are decentralized at different levels, the authors develop an integrated solution algorithm to solve the model using the column-and-constraint generation (CCG) method.

The model and the solution approach are tested on a real supply system consisting of several hospitals and demand areas in a region in Iran. Results indicate that incorporating redesign decisions at the third level reduces maximum disruption costs.

The paper makes the following contributions: presenting a novel tri-level optimization model to formulate facility location and interdiction problems simultaneously, considering corrective measures at the third level to reconfigure the system after interdiction, creating a resilient supply system that can fulfill all demands after disruptions, employing a nested CCG method to solve the model.

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.

This study proposed a mathematical model for decision-making in the pre- and post-disaster phases. This research aims to develop a mathematical model for three important fields in the context of humanitarian logistics; stock prepositioning, facility location and evacuation planning in the humanitarian supply chain (HSC) network design.

This study applied three optimization techniques; classical approach (CA), pattern search algorithm (PSA) and Genetic Algorithm (GA) to solve the proposed mathematical model. The proposed mathematical model attempts to minimize the total relief items supply chain cost and evacuation chain cost of the HSC. A real case study of cyclone Fani, 2019 in Orissa, India is applied to validate the proposed mathematical model and to show the performance of the model.

The results demonstrate that heuristic approach; PSA performs better and optimal solutions are obtained in almost all the cases as compared to the GA and CA.

This study is limited to deterministic demands in the affected regions, and different scenarios of the disaster events are not considered.

The finding reveals that the proposed model can help the humanitarian stakeholders in making decisions on facility location, relief distribution and evacuation planning in disaster relief operations.

The results of this study may offer managerial insights to practitioners and humanitarian logisticians who are engaged in HSC implementation.

This paper aims to propose the new incremental and parallel training algorithm of proximal support vector machines (Inc-Par-PSVM) tailored on the edge device (i.e. the Jetson Nano) to handle the large-scale ImageNet challenging problem.

The Inc-Par-PSVM trains in the incremental and parallel manner ensemble binary PSVM classifiers used for the One-Versus-All multiclass strategy on the Jetson Nano. The binary PSVM model is the average in bagged binary PSVM models built in undersampling training data block.

The empirical test results on the ImageNet data set show that the Inc-Par-PSVM algorithm with the Jetson Nano (Quad-core ARM A57 @ 1.43 GHz, 128-core NVIDIA Maxwell architecture-based graphics processing unit, 4 GB RAM) is faster and more accurate than the state-of-the-art linear SVM algorithm run on a PC [Intel(R) Core i7-4790 CPU, 3.6 GHz, 4 cores, 32 GB RAM].

The new incremental and parallel PSVM algorithm tailored on the Jetson Nano is able to efficiently handle the large-scale ImageNet challenge with 1.2 million images and 1,000 classes.

This paper aims to analyze and provide insight on the algorithms for the optimization of construction site layout planning (CSLP). It resolves problems, such as the selection of suitable algorithms, considering the optimality, optimization objectives and representation of layout solutions. The approaches for the better utilization of optimization algorithms are also presented.

To achieve the above, existing records (results = 200) were selected from three databases: Web of Science, ScienceDirect and Scopus. By implementing a systematic protocol, the articles related to the optimization algorithms for the CLSP (results = 75) were identified. Moreover, various related themes were collated and analyzed according to a coding structure.

The results indicate the consistent and increasing interest on the optimization algorithms for the CLSP, revealing that the trend in shifting to smart approaches in the construction industry is significant. Moreover, the interest in metaheuristic algorithms is dominant because 65.3% of the selected articles focus on these algorithms. The optimality, optimization objectives and solution representations are also important in algorithm selection. With the employment of other algorithms, self-developed applications and commercial software, optimization algorithms can be better utilized for solving CSLP problems. The findings also identify the gaps and directions for future research.

The selection of articles in this review does not consider the industrial perspective and practical applications of commercial software. Further comparative analyses of major algorithms are necessary because this review only focuses on algorithm types.

This paper presents a comprehensive systematic review of articles published in the recent decade. It significantly contributes to the demonstration of the status and selection of CLSP algorithms and the benefit of using these algorithms. It also identifies the research gaps in knowledge and reveals potential improvements for future research.