Particle swarm optimization (PSO) is a popular metaheuristic for deterministic optimization. Originated in the interpretations of the movement of individuals in a bird flock or fish school, PSO introduces the concept of personal best and global best to simulate the pattern of searching for food by flocking and successfully translate the natural phenomena to the optimization of complex functions. Many real-life applications of PSO cope with stochastic problems. To solve a stochastic problem using PSO, a straightforward approach is to equally allocate computational effort among all particles and obtain the same number of samples of fitness values. This is not an efficient use of computational budget and leaves considerable room for improvement. This paper proposes a seamless integration of the concept of optimal computing budget allocation into PSO to improve the computational efficiency of PSO for stochastic optimization problems. We derive an asymptotically optimal allocation rule to intelligently determine the number of samples for all particles such that the PSO algorithm can efficiently select the personal best and global best when there is stochastic estimation noise in fitness values. We also propose an easy-to-implement sequential procedure. Numerical tests show that our new approach can obtain much better results using the same amount of computational effort.
In many real‐world applications, designs can only be evaluated pairwise, relative to each other. Nevertheless, in the simulation literature, almost all the ranking and selection procedures are developed based on the individual performances of each design. This research considers the statistical ranking and selection problem when the design performance can only be simulated pairwise. We formulate this new problem using the optimal computing budget allocation approach and derive the asymptotic optimality condition based on some approximations. The numerical study indicates that our approach can reduce the number of simulations required to confidently identify the best design.
This paper addresses the capacitated vehicle routing problem with time-window and three-dimensional loading constraints in land–sea transport (3L-CVRPTWLS, which is an extension of the 3L-CVRP) to minimize the total cost of land–sea transport. The 3L-CVRPTWLS considers the online packing environment and port-of-destination (POD) constraint, which are clearly of practical significance in freight distribution. Due to its high degree of combinatorial complexity, the literature on this problem is very limited. To solve the 3L-CVRPTWLS, we develop a general deepest-bottom-left-fill (DBLF) and layer heuristic for packing and a hybrid variable-neighborhood tabu search for the routing phase (HLVNTS) based on the “packing first, routing second” (P1R2) strategy. HLVNTS reduces the average total number of vehicles by 2.51% and the average total travel distance by 27.62% in a shorter amount of time. The experimental results show that the proposed algorithm performs well in the tested instances in terms of both computational efficiency and solution quality. Moreover, we evaluate the impact of the POD constraint on the total transportation cost. This study may provide some important support for the sustainable development of land–sea transport and help to protect the environment.
23 March 2023 in Journal of the Operations Research Society of China
Simulation optimization is often applied to solve large-scale complex systems problems in which high-fidelity simulation models are usually complex and time-consuming to run. As a result, the number of objective function evaluations is often very limited and presents a major hurdle for optimization. Recently, a new multi-fidelity optimization framework referred to as ordinal transformation was proposed to make use of a low-fidelity approximation model to speed up optimization. In this paper, we propose a new optimal sampling rule that leverages the theoretical properties of ordinal transformation to efficiently search for the optimal solution. The new optimal sampling rule maximizes the approximate probability of correctly selecting the best solution and is asymptotically optimal. Preliminary numerical experiments demonstrate that the new method achieves competitive finite-time performance and leads to significant improvement over existing optimal sampling rules designed for ordinal transformation.
The increasing number of disposable packaging boxes has caused a huge waste of resources and environmental problems. In order to promote the effective use of sustainable express packaging, this study builds a reverse network of recyclable express packaging boxes for e-commerce businesses with self-established logistics. Considering the uncertainties of demand, return rate, retention rate and recovery rate, a stochastic programming model is proposed to determine the location of collection points and recovery centers in the supply chain network, as well as the flow of recycling boxes, with the objective of minimizing the total cost. Furthermore, an improved priority-based tabu search algorithm is proposed to solve the model. The feasibility and operability of the model are verified via a benchmark function experiment and numerical experiment. This study provides important support for the sustainable development of the express delivery industry and helps to protect the environment.