Container terminals play a significant role as representative logistics facilities for contemporary trades by handling outbound, inbound, and transshipment containers to and from the sea (shipping liners) and the hinterland (consignees). Capacity planning is a fundamental decision process when constructing, expanding, or renovating a container terminal to meet demand, and the outcome of this planning is typically represented in terms of configurations of resources (e.g., the numbers of quay cranes, yard cranes, and vehicles), which enables the container flows to satisfy a high service level for vessels (e.g., berth-on-arrivals). This study presents a decision-making process that optimizes the capacity planning of large-scale container terminals. Advanced simulation-based optimization algorithms, such as Multi-Objective Multi-Fidelity Optimization with Ordinal Transformation and Optimal Sampling (MO-MO²TOS), Multi-Objective Optimal Computing Budget Allocation (MOCBA), and Multi-Objective Convergent Optimization via Most-Promising-Area Stochastic Search (MO-COMPASS), were employed to formulate and optimally solve the large-scale multi-objective problem with multi-fidelity simulation models. Various simulation results are compared with one another in terms of the capacities over different resource configurations to understand the effect of various parameter settings on optimal capacity across the algorithms.

Nowadays, many manufacturing and service industries prefer to share resources such as facilities and workers to cooperatively perform tasks, which can efficiently improve resource utilization and customer satisfaction. Generally, the decision-makers need to pay more for resource usage, leading to an urgent demand to decrease operational costs. This article proposes a stochastic bi-objective two-stage open shop scheduling problem that models a vehicle maintenance process where tasks are appointed to be completed by multiple third-party companies with professional equipment. We formulate this optimization problem by minimizing the total tardiness and processing cost subject to various resource constraints. A hybrid multiobjective migrating birds optimization combined with a genetic operation and a discrete event system is designed by considering problem characteristics to solve the problem. In this method, the migrating birds optimization with some particular strategies aims at searching candidate solutions from the entire solution domain. Simultaneously, the discrete event system, by using stochastic simulation and discrete event-based simulation approaches, focuses on evaluating the performance of searched solutions. Simulation experiments are performed, and state-of-the-art algorithms are used as competitive approaches. The results confirm that this approach has an excellent performance in handling our considered problem.

The general assignment problem is a classical NP-hard (non-deterministic polynomial-time) problem. In a warehouse, the constraints on the equipment and the characteristics of consecutive processes make it even more complicated. To overcome the difficulty in calculating the benefit of an assignment and in finding the optimal assignment plan, a simulation-based optimization method is introduced. We first built a simulation model of the warehouse with the object-oriented discrete-event simulation (O2DES) framework, and then implemented a random neighborhood search method utilizing the simulation output. With this method, the throughput and service level of the warehouse can be improved, while keeping the number of workers constant. Numerical results with real data demonstrate the reduction of discrepancy between inbound and outbound service level performance. With a less than $10\%$ reduction in inbound service level, we can achieve an over $30\%$ increase in outbound service level. The proposed decision support tool assists the warehouse manager in dealing with warehouse worker allocation problem under conditions of random daily workload.