Search results

Simulation-based optimisation (SO) is a popular optimisation approach for building and civil engineering construction planning. However, in the framework of SO, the simulation is continuously invoked during the optimisation trajectory, which increases the computational loads to levels unrealistic for timely construction decisions. Modification on the optimisation settings such as reducing searching ability is a popular method to address this challenge, but the quality measurement of the obtained optimal decisions, also termed as optimisation quality, is also reduced by this setting. Therefore, this study aims to develop an optimisation approach for construction planning that reduces the high computational loads of SO and provides reliable optimisation quality simultaneously.

This study proposes the optimisation approach by modifying the SO framework through establishing an embedded connection between simulation and optimisation technologies. This approach reduces the computational loads and ensures the optimisation quality associated with the conventional SO approach by accurately learning the knowledge from construction simulations using embedded ensemble learning algorithms, which automatically provides efficient and reliable fitness evaluations for optimisation iterations.

A large-scale project application shows that the proposed approach was able to reduce computational loads of SO by approximately 90%. Meanwhile, the proposed approach outperformed SO in terms of optimisation quality when the optimisation has limited searching ability.

The core contribution of this research is to provide an innovative method that improves efficiency and ensures effectiveness, simultaneously, of the well-known SO approach in construction applications. The proposed method is an alternative approach to SO that can run on standard computing platforms and support nearly real-time construction on-site decision-making.

This paper aims to propose a simulation-based performance evaluation model for the drone-based delivery of aid items to disaster-affected areas. The objective of the model is to perform analytical studies, evaluate the performance of drone delivery systems for humanitarian logistics and can support the decision-making on the operational design of the system – on where to locate drone take-off points and on assignment and scheduling of delivery tasks to drones.

This simulation model captures the dynamics and variabilities of the drone-based delivery system, including demand rates, location of demand points, time-dependent parameters and possible failures of drones’ operations. An optimization model integrated with the simulation system can update the optimality of drones’ schedules and delivery assignments.

An extensive set of experiments was performed to evaluate alternative strategies to demonstrate the effectiveness for the proposed optimization/simulation system. In the first set of experiments, the authors use the simulation-based evaluation tool for a case study for Central Florida. The goal of this set of experiments is to show how the proposed system can be used for decision-making and decision-support. The second set of experiments presents a series of numerical studies for a set of randomly generated instances.

The goal is to develop a simulation system that can allow one to evaluate performance of drone-based delivery systems, accounting for the uncertainties through simulations of real-life drone delivery flights. The proposed simulation model captures the variations in different system parameters, including interval of updating the system after receiving new information, demand parameters: the demand rate and their spatial distribution (i.e. their locations), service time parameters: travel times, setup and loading times, payload drop-off times and repair times and drone energy level: battery’s energy is impacted and requires battery change/recharging while flying.

This study aims to propose a computationally efficient framework for multi-objective optimization (MO) of antennas involving nested kriging modeling technology. The technique is demonstrated through a two-objective optimization of a planar Yagi antenna and three-objective design of a compact wideband antenna.

The keystone of the proposed approach is the usage of recently introduced nested kriging modeling for identifying the design space region containing the Pareto front and constructing fast surrogate model for the MO algorithm. Surrogate-assisted design refinement is applied to improve the accuracy of Pareto set determination. Consequently, the Pareto set is obtained cost-efficiently, even though the optimization process uses solely high-fidelity electromagnetic (EM) analysis.

The optimization cost is dramatically reduced for the proposed framework as compared to other state-of-the-art frameworks. The initial Pareto set is identified more precisely (its span is wider and of better quality), which is a result of a considerably smaller domain of the nested kriging model and better predictive power of the surrogate.

The proposed technique can be generalized to accommodate low- and high-fidelity EM simulations in a straightforward manner. The future work will incorporate variable-fidelity simulations to further reduce the cost of the training data acquisition.

The fast MO optimization procedure with the use of the nested kriging modeling technology for approximation of the Pareto set has been proposed and its superiority over state-of-the-art surrogate-assisted procedures has been proved. To the best of the authors’ knowledge, this approach to multi-objective antenna optimization is novel and enables obtaining optimal designs cost-effectively even in relatively high-dimensional spaces (considering typical antenna design setups) within wide parameter ranges.

This study aims to improve the passenger accessibility of passenger demands in the end-of-operation period.

A mixed integer nonlinear programming model for last train timetable optimization of the metro was proposed considering the constraints such as the maximum headway, the minimum headway and the latest end-of-operation time. The objective of the model is to maximize the number of reachable passengers in the end-of-operation period. A solution method based on a preset train service is proposed, which significantly reduces the variables of deciding train services in the original model and reformulates it into a mixed integer linear programming model.

The results of the case study of Wuhan Metro show that the solution method can obtain high-quality solutions in a shorter time; and the shorter the time interval of passenger flow data, the more obvious the advantage of solution speed; after optimization, the number of passengers reaching the destination among the passengers who need to take the last train during the end-of-operation period can be increased by 10%.

Existing research results only consider the passengers who take the last train. Compared with previous research, considering the overall passenger demand during the end-of-operation period can make more passengers arrive at their destination. Appropriately delaying the end-of-operation time can increase the proportion of passengers who can reach the destination in the metro network, but due to the decrease in passenger demand, postponing the end-of-operation time has a bottleneck in increasing the proportion of passengers who can reach the destination.

The purpose of this study is to develop an optimization method for charging plans with the implementation of time-of-day (TOD) electricity tariff, to reduce electricity bill.

Two optimization models for charging plans respectively with fixed and stochastic trip travel times are developed, to minimize the electricity costs of daily operation of an electric bus. The charging time is taken as the optimization variable. The TOD electricity tariff is considered, and the energy consumption model is developed based on real operation data. An optimal charging plan provides charging times at bus idle times in operation hours during the whole day (charging time is 0 if the bus is not get charged at idle time) which ensure the regular operation of every trip served by this bus.

The electricity costs of the bus route can be reduced by applying the optimal charging plans.

This paper produces a viable option for transit agencies to reduce their operation costs.

Transportation infrastructure asset management has long been an active but challenging problem for agencies, which urges to maintain a good state of their assets but faces budgetary limitations. Managing a network of transportation infrastructure assets, especially when the number is large, is a multifaceted challenge. This paper aims to develop a life-cycle cost analysis (LCCA) based transportation infrastructure asset management analytical framework to study the impacts of a few key parameters/factors on deterioration and life-cycle cost. Using the bridge as an example infrastructure type, the framework incorporates an optimization model for optimizing maintenance, repair, rehabilitation (MR&R) and replacement decisions in a finite planning horizon.

The analytical framework is further developed through a series of model variations, scenario and sensitivity analysis, simulation processes and numerical experiments to show the impacts of various parameters/factors and draw managerial insights. One notable analysis is to explicitly model the epistemic uncertainties of infrastructure deterioration models, which have been overlooked in previous research. The proposed methodology can be adapted to different types of assets for solving general asset management and capital planning problems.

The experiments and case studies revealed several findings. First, the authors showed the importance of the deterioration model parameter (i.e. Markov transition probability). Inaccurate information of p will lead to suboptimal solutions and results in excessive total cost. Second, both agency cost and user cost of a single facility will have significant impacts on the system cost and correlation between them also influences the system cost. Third, the optimal budget can be found and the system cost is tolerant to budge variations within a certain range. Four, the model minimizes the total cost by optimizing the allocation of funds to bridges weighing the trade-off between user and agency costs.

On the path forward to develop the next generation of bridge management systems methodologies, the authors make an exploration of incorporating the epistemic uncertainties of the stochastic deterioration models into bridge MR&R capital planning and decision-making. The authors propose an optimization approach that does not only incorporate the inherent stochasticity of bridge deterioration but also considers the epistemic uncertainties and variances of the model parameters of Markovian transition probabilities due to data errors or modeling processes.

Under the constraints of given passenger service level and coupling travel demand with train departure time, this study optimizes the train operational plan in an urban rail corridor to minimize the numbers of train trips and rolling stocks considering the time-varying demand of urban rail passenger flow.

The authors optimize the train operational plan in a special network layout, i.e. an urban rail corridor with dead-end terminal yard, by decomposing it into two sub-problems: train timetable optimization and rolling stock circulation optimization. As for train timetable optimization, the authors propose a schedule-based passenger flow assignment method, construct the corresponding timetabling optimization model and design the bi-directional coordinated sequential optimization algorithm. For the optimization of rolling stock circulation, the authors construct the corresponding optimization assignment model and adopt the Hungary algorithm for solving the model.

The case study shows that the train operational plan developed by the study's approach meets requirements on the passenger service quality and reduces the operational cost to the maximum by minimizing the numbers of train trips and rolling stocks.

The example verifies the efficiency of the model and algorithm.

Surface roughness has a serious impact on the fatigue strength, wear resistance and life of mechanical products. Realizing the evolution of surface quality through theoretical modeling takes a lot of effort. To predict the surface roughness of milling processing, this paper aims to construct a neural network based on deep learning and data augmentation.

This study proposes a method consisting of three steps. Firstly, the machine tool multisource data acquisition platform is established, which combines sensor monitoring with machine tool communication to collect processing signals. Secondly, the feature parameters are extracted to reduce the interference and improve the model generalization ability. Thirdly, for different expectations, the parameters of the deep belief network (DBN) model are optimized by the tent-SSA algorithm to achieve more accurate roughness classification and regression prediction.

The adaptive synthetic sampling (ADASYN) algorithm can improve the classification prediction accuracy of DBN from 80.67% to 94.23%. After the DBN parameters were optimized by Tent-SSA, the roughness prediction accuracy was significantly improved. For the classification model, the prediction accuracy is improved by 5.77% based on ADASYN optimization. For regression models, different objective functions can be set according to production requirements, such as root-mean-square error (RMSE) or MaxAE, and the error is reduced by more than 40% compared to the original model.

A roughness prediction model based on multiple monitoring signals is proposed, which reduces the dependence on the acquisition of environmental variables and enhances the model's applicability. Furthermore, with the ADASYN algorithm, the Tent-SSA intelligent optimization algorithm is introduced to optimize the hyperparameters of the DBN model and improve the optimization performance.

Truck appointment systems have been applied in critical container ports in the United States due to their potential to improve handling operations. This paper aims to develop a truck appointment system to optimise the total cost experiencing at the entrance of container terminals by managing truck arrivals and the number of service gates satisfying a given level of service.

The approximation of M_t/G/n_t queuing model is applied and integrated into a cost optimisation model to identify (1) the number of arrival trucks allowed at each time slot and (2) the number of service gates operating at each time slot that ensure the average waiting time is less than a designated time threshold. The optimisation model is solved by the Genetic Algorithm and tested with a case study. Its effectiveness is identified by comparing the model's outcomes with observed data and other recent studies.

The results indicate that the developed truck appointment system can provide more than threefold and twofold reductions of the total cost experiencing at the terminal entrance compared to the actual data and results from previous research, respectively.

The proposed approach provides applicably coordinated truck plans and operating service gates efficiently to decrease congestion, emission and expenses.

The purpose of this study is to develop a novel general mathematical model to find the optimal product mix of commercial graphite products, which has a complex production process with alternative sub-processes in the graphite mining production process.

The network optimization was adopted to model the complex graphite mining production process through the optimal allocation of raw graphite, byproducts, and saleable products with comparable sub-processes, which has different processing capacities and costs. The model was tested on a selected graphite manufacturing company, and the optimal graphite product mix was determined through the selection of the optimal production process. In addition, sensitivity and scenario analyses were carried out to accommodate uncertainties and to facilitate further managerial decisions.

The selected graphite mining company mines approximately 400 metric tons of raw graphite per month to produce ten types of graphite products. According to the optimum solution obtained, the company should produce only six graphite products to maximize its total profit. In addition, the study demonstrated how to reveal optimum managerial decisions based on optimum solutions.

This study has made a significant contribution to the graphite manufacturing industry by modeling the complex graphite mining production process with a network optimization technique that has yet to be addressed at this level of detail. The sensitivity and scenario analyses support for further managerial decisions.