This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem. Considering the complexity of the problem at hand, an effective cooperative adaptive genetic algorithm (CAGA) is proposed. In the algorithm, a dual chain coding scheme and a staged-hierarchical decoding approach are, respectively, designed to encode and decode each solution. Six dispatch heuristics and a dynamic adjustment method are introduced to define initial population. To balance the exploration and exploitation abilities, three effective operations are implemented: (1) two new crossover and mutation operators with collaborative mechanism are imposed on genetic algorithm; (2) an adaptive adjustment strategy is introduced to re-optimize better solutions after mutation operations, where ant colony search algorithm and modified greedy heuristic are intelligently switched; (3) a reset strategy with dynamic variable step strategy is embedded to re-generate some non-improved solutions. A Taguchi method of design of experiment is adopted to calibrate the parameter values in the presented algorithm. Comparison experiments are executed on test instances with different scale problems. Computational results show that the proposed CAGA is more effective and efficient than several well-known algorithms in solving the studied problem.
The passenger-cargo Roll on/Roll off ship stowage (PRSS) is the core step of passenger-cargo Roll on/Roll off (RoRo) transportation. The layout of vehicles in the cabin is directly related to the space utilization of the cabin and the efficiency of stowage operations, which in turn affects the economic benefits of the port. In this paper, we address the PRSS problem in the context of passenger-cargo RoRo transportation in the Qiongzhou Strait of China. By focusing on the utilization ratio of the cabin area, the PRSS problem can be viewed as a special version of a two-dimensional knapsack packing (2D-KP) problem with additional constraints, such as two-phase, complex rotation and safe navigation constraints. Then we present a mixed integer linear programming (MILP) mathematical model and an algorithm framework to tackle the PRSS problem. In the algorithm framework, a novel multi-phase heuristic stowage method is proposed to improve the current manual stowage decision-making state which completely depends on operational experience. Finally, several instances are generated based on the realistic date of Qiongzhou Strait to verify the effectiveness of the model and stowage method. Computational results show that the proposed model and stowage method are well suited to solve the PRSS problem and the algorithm framework has a strong robustness in large-scale application experiments.
Motivated by the operational scenarios of lock scheduling, we propose a serial-lock chain navigation problem (SLCNP) modeled on the Three Gorges-Gezhouba Dam (TGGD) for the first time. Ship grouping, synchronized moving, and grouped waiting operations are integrated into the ship navigation process. A mixed integer programming (MIP) model that incorporates real-world constraints such as ship priority, service fairness, traffic flow equilibrium, and phased ship placement is presented to optimize ship throughput and ship stay time. To solve the SLCNP, a sort-pick strategy-based swarm intelligence algorithm (SPSSIA) framework is developed that integrates the characteristics of SLCNP through a hybrid multi-section encoding method and a two-stage heuristic decoding approach. A swarm intelligence evolution mechanism is used to improve the search ability and robustness of the framework. Several instances are generated based on real data to verify the correctness and effectiveness of the model and algorithm. Computational results demonstrate the applicability and effectiveness of the proposed SPSSIA. Further analysis of the experimental results indicates that the key impact factors significantly influence the navigational performance of the TGGD system. The results of this study will provide practical guidance for the operational processes of inland river hubs with comparable characteristics.
Allocating the resources efficiently in cloud computing environment is not only an important issue and but also a research focus. A strategy of resource allocation and price adjustment based on particle swarm algorithm is proposed in this paper. According to the workload characteristics, a utility function is designed to evaluate QoS. According to the resource demand from all workloads, the resource prices are dynamically adjusted by the corresponding resource agents in order to obtain maximum profits for each workload. The results of the simulation experiment show that our strategy has effectiveness and robustness.