Search results

This paper aims to describe the use of optimization approaches to increase the range of near-future howitzer ammunition.

The performance of a gliding projectile concept is assessed using an aeroballistic workflow, comprising aerodynamic characterization and flight trajectory computation. First, a single-objective optimization is run with genetic algorithms to find the maximal attainable range for this type of projectile. Then, a multi-objective formulation of the problem is proposed to consider the compromise between range and time of flight. Finally, the aerodynamic model used for the gliding ammunition is evaluated, in comparison with direct computational fluid dynamics (CFD) computations.

Applying single-objective range maximization results in a great improvement of the reachable distance of the projectile, at the expense of the flight duration. Therefore, a multi-objective optimization is implemented in a second time, to search sets of parameters resulting in an optimal compromise between fire range and flight time. The resulting Pareto front can be directly interpreted and has the advantage of being useful for tactical decisions.

The main limitation of the work concerns the aerodynamic model of the gliding ammunition, which was initially proposed as an alternative to reduce significantly the computational cost of aerodynamic characterization and enable optimizations. When compared with direct CFD computations, this method appears to induce an overestimation of the range. This suggests future evolution to improve the accuracy of this approach.

To the best of the authors’ knowledge, this paper presents an original ammunition concept for howitzers, aiming at extending the range of fire by using lifting surfaces and guidance. In addition, optimization techniques are used to improve the range of such projectile configuration.

There are few reports that evolutional topology optimization methods are applied to the conductor geometry design problems. This paper aims to propose an evolutional topology optimization method is applied to the conductor design problems of an on-chip inductor model.

This paper presents a topology optimization method for conductor shape designs. This method is based on the normalized Gaussian network-based evolutional on/off topology optimization method and the covariance matrix adaptation evolution strategy. As a target device, an on-chip planer inductor is used, and single- and multi-objective optimization problems are defined. These optimization problems are solved by the proposed method.

Through the single- and multi-objective optimizations of the on-chip inductor, it is shown that the conductor shapes of the inductor can be optimized based on the proposed methods.

The proposed topology optimization method is applicable to the conductor design problems in that the connectivity of the shapes is strongly required.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.

The target of this research is to develop a mathematical model which combines the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and the Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP). Due to the importance of resource management, the proposed formulation comprises resource leveling considerations as well. The model aims to simultaneously optimize: (1) the total time to accomplish all projects and (2) the total deviation of resource consumptions from the uniform utilization levels.

The K-Means (KM) and Fuzzy C-Means (FCM) clustering methods have been separately applied to discover the clusters of activities which have the most similar resource demands. The discovered clusters are given to the scheduling process as priori knowledge. Consequently, the execution times of the activities with the most common resource requests will not overlap. The intricacy of the problem led us to incorporate the KM and FCM techniques into a meta-heuristic called the Bi-objective Symbiosis Organisms Search (BSOS) algorithm so that the real-life samples of this problem could be solved. Therefore, two clustering-based algorithms, namely, the BSOS-KM and BSOS-FCM have been developed.

Comparisons between the BSOS-KM, BSOS-FCM and the BSOS method without any clustering approach show that the clustering techniques could enhance the optimization process. Another hybrid clustering-based methodology called the NSGA-II-SPE has been added to the comparisons to evaluate the developed resource leveling framework.

The practical importance of the model and the clustering-based algorithms have been demonstrated in planning several construction projects, where multiple water supply systems are concurrently constructed.

Reviewing the literature revealed that there was a need for a hybrid formulation that embraces the characteristics of the RCMPSP and MSRCPSP with resource leveling considerations. Moreover, the application of clustering algorithms as resource leveling techniques was not studied sufficiently in the literature.

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

Exact solution of time–cost trade-off problem (TCTP) by the state-of-the-art meta-heuristic algorithms can be obtained for small- and medium-scale problems, while satisfactory results cannot be obtained for large construction projects. In this study, a hybrid heuristic meta-heuristic algorithm that adapts the search domain is developed to solve the large-scale discrete TCTP more efficiently.

Minimum cost slope–based heuristic network analysis algorithm (NAA), which eliminates the unfeasible search domain, is embedded into differential evolution meta-heuristic algorithm. Heuristic NAA narrows the search domain at the initial phase of the optimization. Moreover, activities with float durations higher than the predetermined threshold value are eliminated and then the meta-heuristic algorithm starts and searches the global optimum through the narrowed search space. However, narrowing the search space may increase the probability of obtaining a local optimum. Therefore, adaptive search domain approach is employed to make reintroduction of the eliminated activities to the design variable set possible, which reduces the possibility of converging into local minima.

The developed algorithm is compared with plain meta-heuristic algorithm with two separate analyses. In the first analysis, both algorithms have the same computational demand, and in the latter analysis, the meta-heuristic algorithm has fivefold computational demand. The tests on case study problems reveal that the developed algorithm presents lower total project costs according to the dependent t-test for paired samples with α = 0.0005.

In this study, TCTP is solved without considering quality or restrictions on the resources.

The proposed method enables to adapt the number of parameters, that is, the search domain and provides the opportunity of obtaining significant improvements on the meta-heuristic algorithms for other engineering optimization problems, which is the theoretical contribution of this study. The proposed approach reduces the total construction cost of the large-scale projects, which can be the practical benefit of this study.

This paper aims to introduce a novel structure for the physical internet (PI)–enabled sustainable supplier selection and inventory management problem under uncertain environments.

To address hybrid uncertainty both in the objective function and constraints, a novel interactive hybrid multi-objective optimization solution approach combining Me-based fuzzy possibilistic programming and interval programming approaches is tailored.

Various numerical experiments are introduced to validate the feasibility of the established model and the proposed solution method.

Due to its interconnectedness, the PI has the opportunity to support firms in addressing sustainability challenges and reducing initial impact. The sustainable supplier selection and inventory management have become critical operational challenges in PI-enabled supply chain problems. This is the first attempt on this issue, which uses the presented novel interactive possibilistic programming method.

The purpose of this study is to develop an integrated model for the stochastic multiproject scheduling and material ordering problems, where some of the prominent features of offshore projects and their environmental-degrading effects have been embraced as well. The durations of activities are uncertain in this model. The developed formulation is tri-objective that seeks to minimize the expected time, total cost and CO₂ emission of all projects.

A new version of the multiobjective multiagent optimization (MOMAO) algorithm has been proposed to solve the amalgamated model. To empower the MOMAO, various procedures of this algorithm have been modified based on the multiattribute utility theory (MAUT) technique. Along with the MOMAO, this study has employed four other meta-heuristic methodologies to solve the model as well.

The outputs of the MOMAO have been put to test against four other optimizers in terms of convergence, diversity, uniformity and computation times. The results of the Mean Ideal Distance (MID) metric have revealed that the MOMAO has strongly prevailed its rival optimizers. In terms of diversity of the acquired solutions, the MOMAO has ranked the first among all employed optimizers since this algorithm has offered the best solutions in 56.66 and 63.33% of the test problems regarding the diversification metric and hyper-volume metrics. Regarding the uniformity of results, which is measured through the spacing metric (SP), the MOMAO has presented the best SP values in more than 96% of the test problems. The MOMAO has needed more computation times in comparison to its rivals.

A real case study comprising two concurrent offshore projects has been offered. The proposed formulation and the MOMAO have been implemented for this case study, and their effectiveness has been appraised.

Very few studies have focused on presenting an integrated formulation for the stochastic multiproject scheduling and material ordering problems. The model embraces some of the characteristics of the offshore projects which have not been adequately studied in the literature. Limited capacities of the offshore platforms and cargo vessels have been embedded in the proposed model. The offshore platforms have spatial limitations in storing the required materials. The vessels are also capacitated and they also have limited shipment capacities. Some of the required materials need to be transported from the base to the offshore platform via a fleet of cargo vessels. The workforces and equipment can become idle on the offshore platform due to material shortage. Various offshore-related costs have been integrated as a minimization objective function in the model. The cargo vessels release CO₂ detrimental emissions to the environment which are sought to be minimized in the developed formulation. To the best of the authors' knowledge, the MOMAO has not been sufficiently employed as a solution methodology for the stochastic multiproject scheduling and material ordering problems.

Project managers bear the responsibility of selecting and developing resource scheduling methods that align with project requirements and organizational circumstances. This study focuses on resource-constrained project scheduling in multi-project environments. The research simplifies the problem by adopting a single-project perspective using gain coefficients.

It employs uncertainty theory and multi-objective programming to construct a model. The optimal solution is identified using Matlab, while LINGO determines satisfactory alternatives. By combining these methods and considering actual construction project situations, a compromise solution closely approximating the optimal one is derived.

The study provides fresh insights into modeling and resolving resource-constrained project scheduling issues, supported by real-world examples that effectively illustrate its practical significance.

The research highlights three main contributions: effective resource utilization, project prioritization and conflict management, and addressing uncertainty. It offers decision support for project managers to balance resource allocation, resolve conflicts, and adapt to changing project demands.

This study aims to propose an efficient dual-robot task collaboration strategy to address the issue of low work efficiency and inability to meet the production needs of a single robot during construction operations.

A hybrid task allocation method based on integer programming and auction algorithms, with the aim of achieving a balanced workload between two robots has been proposed. In addition, while ensuring reasonable workload allocation between the two robots, an improved dual ant colony algorithm was used to solve the dual traveling salesman problem, and the global path planning of the two robots was determined, resulting in an efficient and collision-free path for the dual robots to operate. Meanwhile, an improved fast Random tree rapidly-exploring random tree algorithm is introduced as a local obstacle avoidance strategy.

The proposed method combines randomization and iteration techniques to achieve an efficient task allocation strategy for two robots, ensuring the relative optimal global path of the two robots in cooperation and solving complex local obstacle avoidance problems.

This method is applied to the scene of steel bar tying in construction work, with the workload allocation and collaborative work between two robots as evaluation indicators. The experimental results show that this method can efficiently complete the steel bar banding operation, effectively reduce the interference between the two robots and minimize the interference of obstacles in the environment.