Emergency material scheduling optimization model and algorithms: A review

Operation optimization of natural gas pipelines has received increasing attentions, due to such advantages as maximizing the operating economic benefit and the gas delivery amount. This paper provides a review on the most relevant research progress related to the steady-state operation optimization models of natural gas pipelines as well as corresponding solution methods based on stochastic optimization algorithms. The existing operation optimization model of the natural gas pipeline is a mixed-integer nonlinear programming (MINLP) model involving a nonconvex feasible region and mixing of continuous, discrete, and integer optimization variables, which represents an extremely difficult problem to be solved by use of optimization algorithms. A survey on the state of the art demonstrates that many stochastic algorithms show better performance of solving such optimization models due to their advantages of handling discrete variables and of high computation efficiency over classical deterministic optimization algorithms. The essential progress mainly with regard to the applications of the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Simulated Annealing (SA) algorithms, and their extensions is summarized. The performances of these algorithms are compared in terms of the quality of optimization results and the computation efficiency. Furthermore, the research challenges of improving the optimization model, enhancing the stochastic algorithms, developing an online optimization technology, researching the transient optimization, and studying operation optimization of the integrated energy network are discussed.

Each university has different regulations in making lecture schedule according to the conditions of respective institution. In this study, regulation on lecture scheduling used the maximum limit of credits of lecturer in a day, in which if exceeds the maximum limit, then the schedule of course will be moved on another day. This study attempts to optimize the schedule preparation in each semester by considering the maximum limit of credits of a lecturer in a day. Lecture scheduling is a combination of space, time, and resources. It is categorized into combinatorial optimization group. There are two methods for solving the combinatorial optimization problems, i.e. exact and approximation method. The approximation method consists of two types, heuristics and metaheuristics. The algorithm metaheuristics categories include genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO), bee colony optimization (BCO), simulated annealing, and so on. This paper employed metaheuristics approach. Research on the preparation of lecture scheduling using ACO algorithm has been conducted and proven to be able to prepare the lecture scheduling. The ACO algorithm has numbers of parameters that in solving issues, one must manually set a number of parameters by using the Design of Experiments (DoE) tool, which takes time to solve the optimization problem. Hence, to solve the issue, an automated parameter optimization is required. PSO algorithm has fewer parameters compared to the ACO. Therefore, the purpose of this paper is a hybrid between PSO and ACO in preparing lecture scheduling.

Fuzzy systems (FSs) have been extensively applied to automatic control, pattern recognition, and decision analysis. However, a common bottleneck is encountered in the derivation of fuzzy rules, which is often difficult, time consuming, and relies on expert knowledge. To automate the design of FSs, many metaheuristic learning algorithms have been proposed. One major optimization category uses Swarm Intelligence (SI) model (Kennedy et al., 2001). The SI technique studies collective behavior in decentralized systems. Its development was based on mimicking the social behavior of animals or insects in an effort to find the optima in the problem space. SI models are initialized with a population of random solutions. One well-known SI model is particle swarm optimization (PSO) (Kennedy & Eberhart, 1995). Many modified PSO models have been proposed and successfully applied to different optimization problems (Clerc & Kennedy, 2002; Bergh & Engelbrecht, 2004; Ratnaweera et al., 2004; Juang, 2004; Kennedy & Mendes, 2006; Parrott & Li, 2006; Chen & Li, 2007). FS design using PSO has also been proposed in several studies (Juang, 2004; Chatterjee et al., 2005; Juang et al., 2007; Araujo & Coelho, 2008; Sharma et al., 2009). Another well-known SI is ant colony optimization (ACO) (Dorigo & Stutzle, 2004). The ACO technique is inspired by real ant colony observations. It is a multi-agent approach that was originally proposed to solve difficult discrete combinatorial optimization problems, such as the traveling salesman problem (TSP) (Dorigo et al., 1996; Dorigo & Gambardella, 1997). In the original ACO meta-heuristic, artificial ant colonies cooperate to find good solutions for difficult discrete optimization problems. Different ACO models have been applied to FS design problems (Cassillas et al., 2000; Cassillas et al., 2005; Mucientes & Casillas; 2007; Juang & Lo, 2007; Juang et al., 2008; Juang & Lu; 2009). In (Cassillas et al.,2000; Mucientes & Casillas; 2007; Juang et al., 2008; Juang & Lu; 2009), the FS input space was partitioned in grid type with antecedent part parameters of an FS manually assigned in advance. In (Juang & Lo, 2007), the FS input space was flexibly partitioned using a fuzzy clustering-like algorithm in order to reduce the total number of rules. For all of these studies, the consequent part parameters were optimized in discrete space using ACO. Since only the consequent part parameters are optimized, and the optimization space is restricted to be discrete, the designed FSs are unsuitable for problems where high accuracy is a major concern. Source: Fuzzy Systems, Book edited by: Ahmad Taher Azar, ISBN 978-953-7619-92-3, pp. 216, February 2010, INTECH, Croatia, downloaded from SCIYO.COM

<p>In practice, manufacturing systems are highly dynamic and continuously facing unexpected events and interruptions. This puts production managers in charge of making frequent updates to the ongoing plans and schedules to cope with these changes. This is done by adopting different scheduling strategies and optimization models. Despite several attempts in the literature, the need for models that can minimize the effect of changes (i.e., stochastic and robust models) or react to them using real-time information (i.e., real- time optimization models) is still felt. </p> <p>This dissertation includes three main contributions with different optimization models and heuristic algorithms that can help managers deal with different unexpected events and interruptions on the shop floor. In the first contribution (Chapter 2), the case of stochastic deterioration-based failures in a single machine production system is considered. The machine’s degradation is modeled as a multi-state system. The obtained formulations are then integrated into an optimization model that jointly optimizes the production sequences, machine inspections, and condition-based maintenance actions. The results showed an average improvement of about 35% in total expected costs when information about the machine’s degradation level was used. </p> <p>In the second contribution (Chapter 3), the case of unexpected new job arrivals and random machine breakdowns in a flexible job shop production environment is considered. The effect of random machine breakdowns on the processing durations is formulated and then integrated into a dynamic optimization model. The proposed model investigates how real-time updates can be utilized to improve scheduling decisions based on unexpected arrivals, the availability of machines (downtimes and recovery times), and the completion times of operations. </p> <p>Finally, in Chapter 4, the case of integrating production scheduling and condition-based preventive maintenance (PM) planning in a flexible job shop production system is addressed. The study considers the case of stochastic machine degradation, random machine breakdowns, minimal repairs, condition-based PM, due date changes, and new job arrivals. The reliability of machines is modeled as a multi-state system, in which the obtained formulations are incorporated into an integrated dynamic optimization model. The developed model aims to study the effects of different RTS policies on each of the considered cases and empirically quantify the potential benefits of using real-time information to enhance scheduling decisions. </p>

In this chapter, one gives an introduction to different kinds of particle swarm optimization (PSO) algorithms. One also introduces artificial neural networks (ANNs), support vector machines (SVMs) and evolutionary computing to show how PSO may be used to determine optimal parameters using an ANN or SVM regime, for classification of DNA strings. In addition, PSO is used in the design of an SVM-based clustering algorithm. Ant colony optimization (ACO) algorithms are also introduced in the chapter. Using ACO algorithms has been of great success to solve many discrete optimization and non-deterministic polynomial (NP)-hard problems, for instance the travelling salesman problem. The behaviour of ants is also used, for instance, to design an algorithm for data clustering. We want to develop later a similar application based on this clustering algorithm and compare it with the SVM one using PSO.

The increasingly frequent occurrence of major natural disasters can pose a serious threat to national stability and the safety of people's lives, and cause serious economic losses. How to quickly and accurately dispatch emergency materials to all disaster areas across regions in post-disaster has attracted wide attention from the government and academia. In response to the characteristic of high uncertainty in emergency rescue for major natural disasters, and considering differentiated disaster severity levels in different disaster areas, the entropy weight method is used to determine the urgency coefficient of emergency material demand for disaster areas. This study aims to minimize the emergency materials dispatching time and cost, also maximize the dispatching fairness for disaster areas. The triangular fuzzy number method is used to represent the uncertain variables mentioned above, so that a cross-regional emergency materials intelligent dispatching model in major natural disasters (CREMIDM-MND) is constructed. The extremely heavy rainstorm disaster in Henan Province of China in 2021 is selected as a typical case. Based on objective disaster data obtained from official websites, this study applies the constructed model to real disaster case and calculates the results by MATLAB. The ant colony algorithm is further used to optimize the transportation route based on the calculation results of the emergency material dispatching for disaster areas, and finally forms the intelligent emergency materials dispatching scheme that meets the multiple objectives. The research results indicate that compared to the actual situation, CREMIDM-MND can help decision-maker to develop a cross-regional emergency materials intelligent dispatching scheme in time, thereby effectively improving the government's emergency rescue performance in major natural disasters. Moreover, some managerial insights related to cross-regional emergency materials dispatching practice problem in major natural disasters are presented.

Inverse transient radiation analysis in one-dimensional participating slab using improved Ant Colony Optimization algorithms

Network Optimization of RPTB Express based on Ant Colony Algorithm

The present article investigates the effectiveness of evolutionary computation algorithms in a specific optimisation task, namely morphological segmentation of words into subword segments, focusing on the definition of stems and endings. More precisely, particle swarm optimisation (PSO) is compared to an earlier study on the same task using ant colony optimisation (ACO), using a number of different optimisation criteria, for each of which independent experiments are run. In the present article, the system architecture has been revised over earlier implementations, to allow substantially faster simulation times (by several orders of magnitude), which in turn allows the realisation of more iterations. The effect of local search to the PSO final segmentation quality is investigated in detail, with different local search processes being compared in terms of their effectiveness. In addition, issues involving the convergence of PSO are examined, encompassing variants which adopt global versus local training schemes. Experimental results show that, for different datasets, as a rule both PSO and ACO achieve higher segmentation accuracies than manual tuning. A comparison between ACO and PSO is made, over the different criteria used. When focusing on the highest performing criteria, ACO and PSO are comparable, while the system revisions allow the process to be completed much faster. In terms of the highest segmentation accuracy obtained for a specific system configuration, PSO is more effective, by achieving the highest segmentation accuracy amongst all optimisation methods tested.

Based on the mobile robot path planning problem, on the basis of the improved grid method, this paper proposes an improved ant colony algorithm, the particle swarm optimization algorithm can be incorporated into the ant colony algorithm. Firstly, using the particle swarm optimization algorithm to search for global path roughly. At the same time of search for dynamic pheromone intelligent distribution, to get ant colony algorithm's initial pheromone distribution and according to the pheromone content to eliminate some poor path. Secondly, using ant colony algorithm for the optimal path, it was gotten by particle swarm optimization for the secondary search. Finally, get the optimal solution of path search. The simulation results show that, the fusion algorithm does better than the ant colony algorithm in terms of path optimization.

Efficient multiprocessor scheduling is essentially the problem of allocating a set of computational jobs to a set of processors to minimize the overall execution time. The main issue is how jobs are partitioned in which total finishing time and waiting time is minimized. Minimization of these two criteria simultaneously, is a multi objective optimization problem. There are many variations of this problem, most of which are NP-hard problem, so we must rely on heuristics to solve the problem instances. Many heuristic-based approaches have been applied to finding schedules that minimize the execution time of computing tasks on parallel processors. Particle swarm optimization (PSO) is currently employed in several optimization and search problems due to its ease and ability to find solutions successfully. A variant of PSO, called as improved particle swarm optimization (ImPSO) has been developed in this paper and is hybridized with the ant colony optimization (ACO) to achieve better solutions. The proposed hybrid algorithm effectively exploits the capabilities of distributed and parallel computing of swarm intelligence approaches. In addition hybrid algorithm using improved particle swarm optimization (ImPSO) with artificial immune system (AIS) is also implemented for the same set of problems to compare with the proposed hybrid algorithm (ImPSO with ACO). It was observed that the proposed hybrid approach (Improved PSO with ACO) gives better results in experiments and reduces finishing and waiting time simultaneously. Key words: Particle swarm optimization (PSO), improved particle swarm optimization (ImPSO), ant colony optimization (ACO), job scheduling, finishing time, waiting time.

Saltwater intrusion in coastal aquifers poses significant challenges in the management of vulnerable coastal groundwater resources around the world. To develop a strategy for regional scale sustainable management of coastal aquifers, solution of large-scale multi-objective decision models is essential. The flow and solute transport equations are also density dependent, where the flow parameters are dependent on salt concentration; hence, the flow and solute transport equations need to be solved as coupled equations. In a linked optimization simulation model, the numerical simulation model as a predictor of the physical processes need to be solved enormous number of times to be able to identify an optimum solution as per the specified objectives and constraints. This problem becomes even more complicated when multiple objectives are included and the Pareto optimal solutions need to be determined. Therefore, to ensure the computational efficiency and feasibility of determining a regional scale strategy for control and sustainable use of a coastal aquifer, meta-models that are trained, tested and validated using randomized solutions of the numerical simulation models can be utilized. These meta-models once trained and tested serves the purpose of an approximate emulator of the complex numerical models rendering the solution of a complex and large scale linked optimization model computationally efficient and feasible. The optimal groundwater extraction patterns can be obtained through linked simulation-optimization (S/O) technique in which the simulation part is usually replaced by computationally efficient meta-models. This study proposes a computationally efficient meta-model to emulate density reliant integrated flow and solute transport scenarios of coastal aquifers. A meta-model, Adaptive Neuro Fuzzy Inference System (ANFIS) is trained and developed for an illustrative coastal aquifer study area. Prediction accuracy of the developed ANFIS based meta-model is evaluated for suitability. The meta-model is then integrated with a multiple objective coastal aquifer management model to demonstrate the potential application of this methodology. The optimization algorithm utilized for solution is the Controlled Elitist Multi-objective Genetic Algorithm. Performance evaluation results show acceptable accuracy in the obtained optimized management strategies. Therefore, use of trained and tested meta-models linked to an optimization model results in significant computational efficacy. It also ensures computational practicability of solving such large-scale integrated S/O approach for regional scale coastal groundwater management.KeywordsSaltwater intrusionCoastal aquiferParallel processingFuzzy c-mean clusteringFuzzy inference systemGenetic algorithm

To determine the optimal trajectory of mobile robots in a complex environment and to enhance the effectiveness of search efficiency and path optimization, an improved ant colony (ACO) algorithm is proposed. A fusion algorithm of improved particle swarm optimization (PSO) and ACO algorithm is proposed to solve for optimal paths. Firstly, we improve the PSO and adaptively adjust the inertia weight to facilitate the particle search. Besides, we disturb the particles with the chaotic variables to increase the convergence speed. Secondly, the pheromone distribution on the path is adjusted based on the optimal solution of PSO to solve the initial pheromone insufficiency issue in the ACO algorithm. Then, to optimize the update strategy, we adaptively adjust the pheromone intensity values. We also provide a wide range of control schemes for updating the parameters for balancing the search capability and convergence. The results in the simulation environment show that our algorithm is more effective than other improved algorithms. The improved fusion algorithm converges faster and finds shorter optimal path. The method can improve the comprehensive performance and achieve the rapid path planning for mobile robots.

Fuzzy particle swarm optimization for conjunctive use of groundwater and reclaimed wastewater under uncertainty

The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO) algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO) algorithm to solve two-stage flexible flow shop scheduling problems and thereby minimize earliness, tardiness, and makespan. Computational results reveal that for both small and large problems, EACO is more effective and robust than both the particle swarm optimization (PSO) algorithm and the ACO algorithm. Importantly, this work demonstrates that EACO can solve complex scheduling problems in an acceptable period of time.