Heat Exchanger Network Optimization Based on the Participatory Evolution Strategy for Streams

The non-structural model of a heat exchanger network randomly selects a position of a node on hot and cold streams to generate a heat exchanger and an existing heat exchanger to participate in the evolution. Despite the model being more random and flexible, this selection method cannot easily find a good solution. In addition, the heat exchangers participating in the evolution might not be involved in all streams in each evolutionary process. A stream that does not participate in the evolution will have no significance to the current iteration. Therefore, many iterations are required to make each stream participate in the evolution, which limits the evolution efficiency of the optimization algorithm. In view of this shortcoming, this study proposes a participatory evolutionary strategy for streams based on hot streams. The proposed strategy reorders the existing heat exchangers on hot and cold streams and takes the corresponding measures to ensure that a heat exchanger is selected for each stream to participate in the evolution in every cycle. The proposed participatory evolutionary strategy for streams improves the global optimal solution for designs based on non-structural models. The effectiveness of the proposed strategy is demonstrated in two cases.

Global Simultaneous Optimization of Oil, Hysteretic and Inertial Dampers Using Real-Valued Genetic Algorithm and Local Search

A method for global simultaneous optimization of oil, hysteretic and inertial dampers is proposed for building structures using a real-valued genetic algorithm and local search. Oil dampers has the property that they can reduce both displacement and acceleration without significant change of natural frequencies and hysteretic dampers possess the characteristic that they can absorb energy efficiently and reduce displacement effectively in compensation for the increase of acceleration. On the other hand, inertial dampers can change (prolong) the natural periods with negative stiffness and reduce the effective input and the maximum acceleration in compensation for the increase of deformation. By using the proposed simultaneous optimization method, structural designers can select the best choice of these three dampers from the viewpoints of cost and performance indices (displacement, acceleration). For attaining the global optimal solution which cannot be attained by the conventional sensitivity-based approach, a method including a real-valued genetic algorithm and local search is devised. In the first stage, a real-valued genetic algorithm is used for searching an approximate global optimal solution. Then a local search procedure is activated for enhancing the optimal character of the solutions by reducing the total quantity of three types of dampers. It is demonstrated that a better design from the viewpoint of global optimality can be obtained by the proposed method and the preference of damper selection strongly depends on the design target (displacement, acceleration). Finally, a multi-objective optimization for the minimum deformation and acceleration is investigated.

Path Planning of Mobile Robots in Warehouse Logistics Relying on Computer Multimedia 3D Reconstruction Technology

Because traditional methods are difficult to solve the problems related to the path planning of logistics robots, this study proposes a method of using computer multimedia 3D reconstruction technology to realize the path planning of warehouse logistics robots. Without fully considering the accurate movement path between points, according to the warehouse logistics robot, it is judged whether the starting point is at the exit. The planning problem of the movement path is converted into a TSP problem and a TS-TSP problem. Finally, the analysis of experimental results shows that the method proposed in this study converges faster than traditional algorithms and can quickly obtain the global optimal solution. At the same time, the warehousing logistics robot requires less path planning time and has strong practical application.

An improved predator-prey particle swarm optimization algorithm for Nash equilibrium solution

Focusing on the problem incurred during particle swarm optimization (PSO) that tends to fall into local optimization when solving Nash equilibrium solutions of games, as well as the problem of slow convergence when solving higher order game pay off matrices, this paper proposes an improved Predator-Prey particle swarm optimization (IPP-PSO) algorithm based on a Predator-Prey particle swarm optimization (PP-PSO) algorithm. First, the convergence of the algorithm is advanced by improving the distribution of the initial predator and prey. By improving the inertia weight of both predator and prey, the problem of “precocity” of the algorithm is improved. By improving the formula used to represent particle velocity, the problems of local optimizations and slowed convergence rates are solved. By increasing pathfinder weight, the diversity of the population is increased, and the global search ability of the algorithm is improved. Then, by solving the Nash equilibrium solution of both a zero-sum game and a non-zero-sum game, the convergence speed and global optimal performance of the original PSO, the PP-PSO and the IPP-PSO are compared. Simulation results demonstrated that the improved Predator-Prey algorithm is convergent and effective. The convergence speed of the IPP-PSO is significantly higher than that of the other two algorithms. In the simulation, the PSO does not converge to the global optimal solution, and PP-PSO approximately converges to the global optimal solution after about 40 iterations, while IPP-PSO approximately converges to the global optimal solution after about 20 iterations. Furthermore, the IPP-PSO is superior to the other two algorithms in terms of global optimization and accuracy.

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

The paper proposes the formulation of a single-task robot (ST), single-robot task (SR), time-extended assignment (TA), multi-robot task allocation (MRTA) problem with multiple, nonlinear criteria using discrete variables that drastically reduce the computation burden. Obtaining an allocation is addressed by a Branch and Bound (B&B) algorithm in low scale problems and by a genetic algorithm (GA) specifically developed for the proposed formulation in larger scale problems. The GA crossover and mutation strategies design ensure that the descendant allocations of each generation will maintain a certain level of feasibility, reducing greatly the range of possible descendants, and accelerating their convergence to a sub-optimal allocation. The proposed MRTA algorithms are simulated and analyzed in the context of a thermosolar power plant, for which the spatially distributed Direct Normal Irradiance (DNI) is estimated using a heterogeneous fleet composed of both aerial and ground unmanned vehicles. Three optimization criteria are simultaneously considered: distance traveled, time required to complete the task and energetic feasibility. Even though this paper uses a thermosolar power plant as a case study, the proposed algorithms can be applied to any MRTA problem that uses a multi-criteria and nonlinear cost function in an equivalent way. The performance and response of the proposed algorithms are compared for four different scenarios. The results show that the B&B algorithm can find the global optimal solution in a reasonable time for a case with four robots and six tasks. For larger problems, the genetic algorithm approaches the global optimal solution in much less computation time. Moreover, the trade-off between computation time and accuracy can be easily carried out by tuning the parameters of the genetic algorithm according to the available computational power.

Hybrid Multi-Population and Adaptive Search Range Strategy With Particle Swarm Optimization for Multimodal Optimization

This paper proposes an algorithm named hybrid multi-population and adaptive search range strategy with particle swarm optimization (ARPSO) for solving multimodal optimization problems. The main idea of the algorithm is to divide the global search space into multiple sub-populations searching in parallel and independently. For diversity increasing, each sub-population will continuously change the search area adaptively according to whether there are local optimal solutions in its search space and the position of the global optimal solution, and in each iteration, the optimal solution in this area will be reserved. For the purpose of accelerating convergence, at the global and local levels, when the global optimal solution or local optimal solution is found, the global search space and local search space will shrink toward the optimal solution. Experiments show that ARPSO has unique advantages for solving multi-dimensional problems, especially problems with only one global optimal solution but multiple local optimal solutions.

On the P-formulation and the Split-Fraction-Formulation for the Generalized Pooling Problem

The generalized pooling problem (GPP) is a NP-hard problem for which the solution time for securing a global optimal solution heavily depends on the strength of the problem formulation. The existing GPP formulations use either quality variables (P-formulation and the variants) or split-fraction variables (SF-formulation and the variants) to model the material balance at the pools. This paper is the first attempt to develop theoretical results for comparing the strength of P-formulation and SF-formulation. It is found that, an enhanced version of P-formulation, called P-formulation, is at least as strong as SF-formulation under mild conditions. Furthermore, P-formulation becomes identical to P-formulation when the pooling network comprises only mixers and splitters. With additional conditions that are often satisfied at the root node, P-formulation is proved to be as least as strong as SF-formulation. The theoretical results are verified by the computational study of 23 problem instances.

Optimization of a refinery scheduling process with column generation and a quantum annealer

This study focuses on the optimization of a refinery scheduling process with the help of an adiabatic quantum computer, and more concretely one of the quantum annealers developed by D-Wave Systems. We present an algorithm for finding a global optimal solution of a MILP that leans on a solver for QUBO problems, and apply it to various possible cases of refinery scheduling optimization. We analyze the inconveniences found during the whole process, whether due to the heuristic nature of D-Wave or the implications of reducing a MILP to QUBO, and present some experimental results.