Search results

The volumes of international containerized trade substantially increased over the past years. In the meantime, marine container terminal (MCT) operators are facing congestion issues at their terminals because of the increasing number of large-size vessels, the lack of innovative technologies and advanced handling equipment and the inability of proper scheduling of the available resources. This study aims to propose a novel memetic algorithm with a deterministic parameter control to facilitate the berth scheduling at MCTs and minimize the total vessel service cost.

A local search heuristic, which is based on the first-come-first-served policy, is applied at the chromosomes and population initialization stage within the developed memetic algorithm (MA). The deterministic parameter control strategy is implemented for a custom mutation operator, which alters the mutation rate values based on the piecewise function throughout the evolution of the algorithm. Performance of the proposed MA is compared with that of the alternative solution algorithms widely used in the berth scheduling literature, including a MA that does not apply the deterministic parameter control strategy, typical evolutionary algorithm, simulated annealing and variable neighborhood search.

Results demonstrate that the developed MA with a deterministic parameter control can obtain superior berth schedules in terms of the total vessel service cost within a reasonable computational time. Furthermore, greater cost savings are observed for the cases with high demand and low berthing capacity at the terminal. A comprehensive analysis of the convergence patterns indicates that introduction of the custom mutation operator with a deterministic control for the mutation rate value would provide more efficient exploration and exploitation of the search space.

This study does not account for uncertainty in vessel arrivals. Furthermore, potential changes in the vessel handling times owing to terminal disruptions are not captured.

The developed solution algorithm can serve as an efficient planning tool for MCT operators and assist with efficient berth scheduling for both discrete and continuous berthing layout cases.

The majority of studies on berth scheduling rely on the stochastic search algorithms without considering the specific problem properties and applying the guided search heuristics. Unlike canonical evolutionary algorithms, the developed algorithm uses a local search heuristic for the chromosomes and population initialization and adjusts the mutation rate values based on a deterministic parameter control strategy for more efficient exploration and exploitation of the search space.

Marine transportation has been faced with an increasing demand for containerized cargo during the past decade. Marine container terminals (MCTs), as the facilities for connecting seaborne and inland transportation, are expected to handle the increasing amount of containers, delivered by vessels. Berth scheduling plays an important role for the total throughput of MCTs as well as the overall effectiveness of the MCT operations. This study aims to propose a novel island-based metaheuristic algorithm to solve the berth scheduling problem and minimize the total cost of serving the arriving vessels at the MCT.

A universal island-based metaheuristic algorithm (UIMA) was proposed in this study, aiming to solve the spatially constrained berth scheduling problem. The UIMA population was divided into four sub-populations (i.e. islands). Unlike the canonical island-based algorithms that execute the same metaheuristic on each island, four different population-based metaheuristics are adopted within the developed algorithm to search the islands, including the following: evolutionary algorithm (EA), particle swarm optimization (PSO), estimation of distribution algorithm (EDA) and differential evolution (DE). The adopted population-based metaheuristic algorithms rely on different operators, which facilitate the search process for superior solutions on the UIMA islands.

The conducted numerical experiments demonstrated that the developed UIMA algorithm returned near-optimal solutions for the small-size problem instances. As for the large-size problem instances, UIMA was found to be superior to the EA, PSO, EDA and DE algorithms, which were executed in isolation, in terms of the obtained objective function values at termination. Furthermore, the developed UIMA algorithm outperformed various single-solution-based metaheuristic algorithms (including variable neighborhood search, tabu search and simulated annealing) in terms of the solution quality. The maximum UIMA computational time did not exceed 306 s.

Some of the previous berth scheduling studies modeled uncertain vessel arrival times and/or handling times, while this study assumed the vessel arrival and handling times to be deterministic.

The developed UIMA algorithm can be used by the MCT operators as an efficient decision support tool and assist with a cost-effective design of berth schedules within an acceptable computational time.

A novel island-based metaheuristic algorithm is designed to solve the spatially constrained berth scheduling problem. The proposed island-based algorithm adopts several types of metaheuristic algorithms to cover different areas of the search space. The considered metaheuristic algorithms rely on different operators. Such feature is expected to facilitate the search process for superior solutions.

This paper reports a new technique for achieving optimized design for power system stabilizers. In any large scale interconnected systems, disturbances of small magnitudes are very common and low frequency oscillations pose a major problem. Hence small signal stability analysis is very important for analyzing system stability and performance. Power System Stabilizers (PSS) are used in these large interconnected systems for damping out low-frequency oscillations by providing auxiliary control signals to the generator excitation input. In this paper, collective decision optimization (CDO) algorithm, a meta-heuristic approach based on the decision making approach of human beings, has been applied for the optimal design of PSS. PSS parameters are tuned for the objective function, involving eigenvalues and damping ratios of the lightly damped electromechanical modes over a wide range of operating conditions. Also, optimal locations for PSS placement have been derived. Comparative study of the results obtained using CDO with those of grey wolf optimizer (GWO), differential Evolution (DE), Whale Optimization Algorithm (WOA) and crow search algorithm (CSA) methods, established the robustness of the algorithm in designing PSS under different operating conditions.

Intelligence level of a crowd network is defined as the expected reward of the network when completing the latest tasks (e.g. last N tasks). The purpose of this paper is to improve the intelligence level of a crowd network by optimizing the profession distribution of the crowd network.

Based on the concept of information entropy, this paper introduces the concept of business entropy and puts forward several factors affecting business entropy to analyze the relationship between the intelligence level and the profession distribution of the crowd network. This paper introduced Profession Distribution Deviation and Subject Interaction Pattern as the two factors which affect business entropy. By quantifying and combining the two factors, a Multi-Factor Business Entropy Quantitative (MFBEQ) model is proposed to calculate the business entropy of a crowd network. Finally, the differential evolution model and k-means clustering are applied to crowd intelligence network, and the species distribution of intelligent subjects is found, so as to achieve quantitative analysis of business entropy.

By establishing the MFBEQ model, this paper found that when the profession distribution of a crowd network is deviate less to the expected distribution, the intelligence level of a crowd network will be higher. Moreover, when subjects within the crowd network interact with each other more actively, the intelligence level of a crowd network becomes higher.

This paper aims to build the MFBEQ model according to factors that are related to business entropy and then uses the model to evaluate the intelligence level of a number of crowd networks.

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.

The purpose of this paper aims to design an optimization control for tunnel boring machine (TBM) based on geological identification. For unknown geological condition, the authors need to identify them before further optimization. For fully considering multiple crucial performance of TBM, the authors establish an optimization problem for TBM so that it can be adapted to varying geology. That is, TBM can operate optimally under corresponding geology, which is called geology-adaptability.

This paper adopted k-nearest neighbor (KNN) algorithm with modification to identify geological conditions. The modification includes adjustment of weights in voting procedure and similarity distance measurement, which at suitable for engineering and enhance accuracy of prediction. The authors also design several key performances of TBM during operation, and built a multi-objective function. Further, the multi-objective function has been transformed into a single objective function by weighted-combination. The reformulated optimization was solved by genetic algorithm in the end.

This paper provides a support for decision-making in TBM control. Through proposed optimization control, the advance speed of TBM has been enhanced dramatically in each geological condition, compared with the results before optimizing. Meanwhile, other performances are acceptable and the method is verified by in situ data.

This paper fulfills an optimization control of TBM considering several key performances during excavating. The optimization is conducted under different geological conditions so that TBM has geological-adaptability.

This paper aims to propose a train timetable rescheduling (TTR) approach from the perspective of multi-train tracking optimization based on the mutual spatiotemporal information in the high-speed railway signaling system.

Firstly, a single-train trajectory optimization (STTO) model is constructed based on train dynamics and operating conditions. The train kinematics parameters, including acceleration, speed and time at each position, are calculated to predict the arrival times in the train timetable. A STTO algorithm is developed to optimize a single-train time-efficient driving strategy. Then, a TTR approach based on multi-train tracking optimization (TTR-MTTO) is proposed with mutual information. The constraints of temporary speed restriction (TSR) and end of authority are decoupled to calculate the tracking trajectory of the backward tracking train. The multi-train trajectories at each position are optimized to generate a time-efficient train timetable.

The numerical experiment is performed on the Beijing-Tianjin high-speed railway line and CR400AF. The STTO algorithm predicts the train’s planned arrival time to calculate the total train delay (TTD). As for the TSR scenario, the proposed TTR-MTTO can reduce TTD by 60.60% compared with the traditional TTR approach with dispatchers’ experience. Moreover, TTR-MTTO can optimize a time-efficient train timetable to help dispatchers reschedule trains more reasonably.

With the cooperative relationship and mutual information between train rescheduling and control, the proposed TTR-MTTO approach can automatically generate a time-efficient train timetable to reduce the total train delay and the work intensity of dispatchers.

Many mathematical models have been shared to communicate about the COVID-19 outbreak; however, they require advanced mathematical skills. The main purpose of this study is to investigate in which way computational thinking (CT) tools and concepts are helpful to better understand the outbreak, and how the context of disease could be used as a real-world context to promote elementary and middle-grade students' mathematical and computational knowledge and skills.

In this study, the authors used a qualitative research design, specifically content analysis, and analyzed two simulations of basic SIR models designed in a Scratch. The authors examine the extent to which they help with the understanding of the parameters, rates and the effect of variations in control measures in the mathematical models.

This paper investigated the four dimensions of sample simulations: initialization, movements, transmission, recovery process and their connections to school mathematical and computational concepts.

A major limitation is that this study took place during the pandemic and the authors could not collect empirical data.

Teaching mathematical modeling and computer programming is enhanced by elaborating in a specific context. This may serve as a springboard for encouraging students to engage in real-world problems and to promote using their knowledge and skills in making well-informed decisions in future crises.

This research not only sheds light on the way of helping students respond to the challenges of the outbreak but also explores the opportunities it offers to motivate students by showing the value and relevance of CT and mathematics (Albrecht and Karabenick, 2018).

The purpose of this paper is to enhance consistent partial least squares (PLSc) to yield consistent parameter estimates for population models whose indicator blocks contain a subset of correlated measurement errors.

Correction for attenuation as originally applied by PLSc is modified to include a priori assumptions on the structure of the measurement error correlations within blocks of indicators. To assess the efficacy of the modification, a Monte Carlo simulation is conducted.

In the presence of population measurement error correlation, estimated parameter bias is generally small for original and modified PLSc, with the latter outperforming the former for large sample sizes. In terms of the root mean squared error, the results are virtually identical for both original and modified PLSc. Only for relatively large sample sizes, high population measurement error correlation, and low population composite reliability are the increased standard errors associated with the modification outweighed by a smaller bias. These findings are regarded as initial evidence that original PLSc is comparatively robust with respect to misspecification of the structure of measurement error correlations within blocks of indicators.

Introducing and investigating a new approach to address measurement error correlation within blocks of indicators in PLSc, this paper contributes to the ongoing development and assessment of recent advancements in partial least squares path modeling.

This study aims to reduce the redundant weight of the anti-roll torsion bar brought by the traditional empirical design and improving its strength and stiffness.

Based on the finite element approach coupled with the improved beluga whale optimization (IBWO) algorithm, a collaborative optimization method is suggested to optimize the design of the anti-roll torsion bar structure and weight. The dimensions and material properties of the torsion bar were defined as random variables, and the torsion bar's mass and strength were investigated using finite elements. Then, chaotic mapping and differential evolution (DE) operators are introduced to improve the beluga whale optimization (BWO) algorithm and run case studies.

The findings demonstrate that the IBWO has superior solution set distribution uniformity, convergence speed, solution correctness and stability than the BWO. The IBWO algorithm is used to optimize the anti-roll torsion bar design. The error between the optimization and finite element simulation results was less than 1%. The weight of the optimized anti-roll torsion bar was lessened by 4%, the maximum stress was reduced by 35% and the stiffness was increased by 1.9%.

The study provides a methodological reference for the simulation optimization process of the lateral anti-roll torsion bar.