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.

This paper aims to examine the time it would take to provide medical prophylaxis for a large urban population in the wake of an airborne anthrax attack and the effect that various parameters have on the total logistical time.

A mathematical model that evaluates key parameters and suggests alternatives for improvement is formulated. The objective of the model is to minimize the total logistical time required for prophylaxis by balancing three cycles as follows: the loading cycle, the shipping cycle and the service cycle.

Applying the model to two representative cases reveals the effect of various parameters on the process. For example, the number of distribution centers and the number of servers in each center are key parameters, whereas the number of central depots and the local shipping method is less important.

Various psychological factors such as mass panic are not included in the model.

There are few papers analyzing the logistical response to an anthrax attack, and most focus mainly on the strategic level. The study deals with the tactical logistical level. The authors focus on the distribution process of prophylaxis and other medical supplies during the crisis, analyze it and identify the parameters that influence the time between the detection of the attack and the provision of effective medical treatment to the exposed population.

Since its introduction by Chari, Kehoe, and McGrattan (2007), Business Cycle Accounting (BCA) exercises have become widespread. Much attention has been devoted to the results of such exercises and to methodological departures from the baseline methodology. Little attention has been paid to identification issues within these classes of models. In this chapter, the authors investigate whether such issues are of concern in the original methodology and in an extension proposed by Šustek (2011) called Monetary Business Cycle Accounting. The authors resort to two types of identification tests in population. One concerns strict identification as theorized by Komunjer and Ng (2011) while the other deals both with strict and weak identification as in Iskrev (2010). Most importantly, the authors explore the extent to which these weak identification problems affect the main economic takeaways and find that the identification deficiencies are not relevant for the standard BCA model. Finally, the authors compute some statistics of interest to practitioners of the BCA methodology.

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.

Container shipping is a crucial component of the global supply chain that is affected by a large range of operational risks with high uncertainty, threatening the stability of service, manufacture, distribution and profitability of involved parties. However, quantitative risk analysis (QRA) of container shipping operational risk (CSOR) is being obstructed by the lack of a well-established theoretical structure to guide deeper research efforts. This paper proposes a methodological framework to strengthen the quality and reliability of CSOR analysis (CSORA).

Focusing on addressing uncertainties, the framework establishes a solid, overarching and updated basis for quantitative CSORA. The framework consists of clearly defined elements and processes, including knowledge establishing, information gathering, aggregating multiple sources of data (social/deliberative and mathematical/statistical), calculating risk and uncertainty level and presenting and interpreting quantified results. The framework is applied in a case study of three container shipping companies in Vietnam.

Various methodological contributions were rendered regarding CSOR characteristics, settings of analysis models, handling of uncertainties and result interpretation. The empirical study also generated valuable managerial implications regarding CSOR management policies.

This paper fills the gap of an updated framework for CSORA considering the recent advancements of container shipping operations and risk management. The framework can be used by both practitioners as a tool for CSORA and scholars as a test bench to facilitate the comparison and development of QRA models.

This paper presents an experimental investigation in establishing the relationship between FDM process parameters and tensile strength of polycarbonate (PC) samples using the I-Optimal design.

I-optimal design methodology is used to plan the experiments by means of Minitab-17.1 software. Samples are manufactured using Stratsys FDM 400mc and tested as per ISO standards. Additionally, an artificial neural network model was developed and compared to the regression model in order to select an appropriate model for optimisation. Finally, the genetic algorithm (GA) solver is executed for improvement of tensile strength of FDM built PC components.

This study demonstrates that the selected process parameters (raster angle, raster to raster air gap, build orientation about Y axis and the number of contours) had significant effect on tensile strength with raster angle being the most influential factor. Increasing the build orientation about Y axis produced specimens with compact structures that resulted in improved fracture resistance.

The fitted regression model has a p-value less than 0.05 which suggests that the model terms significantly represent the tensile strength of PC samples. Further, from the normal probability plot it was found that the residuals follow a straight line, thus the developed model provides adequate predictions. Furthermore, from the validation runs, a close agreement between the predicted and actual values was seen along the reference line which further supports satisfactory model predictions.

This study successfully investigated the effects of the selected process parameters - raster angle, raster to raster air gap, build orientation about Y axis and the number of contours - on tensile strength of PC samples utilising the I-optimal design and ANOVA. In addition, for prediction of the part strength, regression and ANN models were developed. The selected ANN model was optimised using the GA-solver for determination of optimal parameter settings.

The proposed ANN-GA approach is more appropriate to establish the non-linear relationship between the selected process parameters and tensile strength. Further, the proposed ANN-GA methodology can assist in manufacture of various industrial products with Nylon, polyethylene terephthalate glycol (PETG) and PET as new 3DP materials.

Rapid sensitivity analysis and near-optimal decision-making in contested environments are valuable requirements when providing military logistics support. Port of debarkation denial motivates maneuver from strategic operational locations, further complicating logistics support. Simulations enable rapid concept design, experiment and testing that meet these complicated logistic support demands. However, simulation model analyses are time consuming as output data complexity grows with simulation input. This paper proposes a methodology that leverages the benefits of simulation-based insight and the computational speed of approximate dynamic programming (ADP).

This paper describes a simulated contested logistics environment and demonstrates how output data informs the parameters required for the ADP dialect of reinforcement learning (aka Q-learning). Q-learning output includes a near-optimal policy that prescribes decisions for each state modeled in the simulation. This paper's methods conform to DoD simulation modeling practices complemented with AI-enabled decision-making.

This study demonstrates simulation output data as a means of state–space reduction to mitigate the curse of dimensionality. Furthermore, massive amounts of simulation output data become unwieldy. This work demonstrates how Q-learning parameters reflect simulation inputs so that simulation model behavior can compare to near-optimal policies.

Fast computation is attractive for sensitivity analysis while divorcing evaluation from scenario-based limitations. The United States military is eager to embrace emerging AI analytic techniques to inform decision-making but is hesitant to abandon simulation modeling. This paper proposes Q-learning as an aid to overcome cognitive limitations in a way that satisfies the desire to wield AI-enabled decision-making combined with modeling and simulation.

The purpose of this paper is to propose a smooth double-spline interpolation method for six-degree-of-freedom rotational robot manipulators, achieving the global C2 continuity of the robot trajectory.

This paper presents a smooth double-spline interpolation method, achieving the global C2 continuity of the robot trajectory. The tool center positions and quaternion orientations are first fitted by a cubic B-spline curve and a quartic-polynomial-based quaternion spline curve, respectively. Then, a parameter synchronization model is proposed to realize the synchronous and smooth movement of the robot along the double spline curves. Finally, an extra u-s function is used to record the relationship between the B-spline parameter and its arc length parameter, which may reduce the feed rate fluctuation in interpolation. The seven segments jerk-limited feed rate profile is used to generate motion commands for algorithm validation.

The simulation and experimental results demonstrate that the proposed method is effective and can generate the global C2-continuity robot trajectory.

The main contributions of this paper are as follows: guarantee the C2 continuity of the position path and quaternion orientation path simultaneously; provide a parameter synchronization model to realize the synchronous and smooth movement of the robot along the double spline curves; and add an extra u-s function to realize arc length parameterization of the B-spline path, which may reduce the feed rate fluctuation in interpolation.

Small highly saturated interior permanent magnet- synchronous machines (IPMSMs) show a very nonlinear behaviour. Such machines are mostly controlled with a closed-loop cascade control, which is based on a d-q two-axis dynamic model with constant concentrated parameters to calculate the control parameters. This paper aims to present the identification of a complete current- and rotor position-dependent d-q dynamic model, which is derived by using a finite element method (FEM) simulation. The machine’s constant parameters are determined for an operation on the maximum torque per ampere (MTPA) curve. The obtained MTPA control performance was evaluated on the complete FEM-based nonlinear d-q model.

A FEM model was used to determine the nonlinear properties of the complete d-q dynamic model of the IPMSM. Furthermore, a fitting procedure based on the nonlinear MTPA curve is proposed to determine adequate constant parameters for MTPA operation of the IPMSM.

The current-dependent d-q dynamic model of the machine models the relevant dynamic behaviour of the complete current- and rotor position-dependent FEM-based d-q dynamic model. The most adequate control response was achieved while using the constant parameters fitted to the nonlinear MTPA curve by using the proposed method.

The effect on the motor’s steady-state and dynamic behaviour of differently complex d-q dynamic models was evaluated. A workflow to obtain constant set of parameters for the decoupled operation in the MTPA region was developed and their effect on the control response was analysed.

This study aims to investigate the effect of vibration on ceramic tools under dry cutting conditions and find the optimum cutting condition for the hardened steel machining process in a computer numerical control (CNC) lathe machine.

In this research, an integrated fuzzy TOPSIS-based Taguchi L9 optimization model has been applied for the multi-objective optimization (MOO) of the hard-turning responses. Additionally, the effect of vibration on the ceramic tool wear was investigated using Analysis of Variance (ANOVA) and Fast Fourier Transform (FFT).

The optimum cutting conditions for the multi-objective responses were obtained at 98 m/min cutting speed, 0.1 mm/rev feed rate and 0.2 mm depth of cut. According to the ANOVA of the input cutting parameters with respect to response variables, feed rate has the most significant impact (53.79%) on the control of response variables. From the vibration analysis, the feed rate, with a contribution of 34.74%, was shown to be the most significant process parameter influencing excessive vibration and consequent tool wear.

The MOO of response parameters at the optimum cutting parameter settings can significantly improve productivity in the dry turning of hardened steel and control over the input process parameters during machining.

Most studies on optimizing responses in dry hard-turning performed in CNC lathe machines are based on single-objective optimization. Additionally, the effect of vibration on the ceramic tool during MOO of hard-turning has not been studied yet.