18,224 results
Search Results
2. Planning a Mass Vaccination Campaign with Balanced Staff Engagement
- Author
-
Foderaro, Salvatore, Naldi, Maurizio, Nicosia, Gaia, Pacifici, Andrea, van der Aalst, Wil, Series Editor, Mylopoulos, John, Series Editor, Ram, Sudha, Series Editor, Rosemann, Michael, Series Editor, Szyperski, Clemens, Series Editor, Ziemba, Ewa, editor, and Chmielarz, Witold, editor
- Published
- 2022
- Full Text
- View/download PDF
3. Invited paper: A Review of Thresheld Convergence
- Author
-
Stephen Chen, James Montgomery, Antonio Bolufé-Röhler, and Yasser Gonzalez-Fernandez
- Subjects
Exploration ,Exploitation ,Heuristic Algorithms ,Optimization ,Multi-modality ,Management. Industrial management ,HD28-70 - Abstract
A multi-modal search space can be defined as having multiple attraction basins – each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers.
- Published
- 2022
- Full Text
- View/download PDF
4. Towards Utilitarian Combinatorial Assignment with Deep Neural Networks and Heuristic Algorithms
- Author
-
Präntare, Fredrik, Tiger, Mattias, Bergström, David, Appelgren, Herman, Heintz, Fredrik, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Heintz, Fredrik, editor, Milano, Michela, editor, and O'Sullivan, Barry, editor
- Published
- 2021
- Full Text
- View/download PDF
5. Minimization of the Weighted Total Sparsity of Cosmonaut Training Courses
- Author
-
Lazarev, Alexander, Khusnullin, Nail, Musatova, Elena, Yadrentsev, Denis, Kharlamov, Maxim, Ponomarev, Konstantin, Barbosa, Simone Diniz Junqueira, Series Editor, Filipe, Joaquim, Series Editor, Kotenko, Igor, Series Editor, Sivalingam, Krishna M., Series Editor, Washio, Takashi, Series Editor, Yuan, Junsong, Series Editor, Zhou, Lizhu, Series Editor, Ghosh, Ashish, Series Editor, Evtushenko, Yury, editor, Jaćimović, Milojica, editor, Khachay, Michael, editor, Kochetov, Yury, editor, Malkova, Vlasta, editor, and Posypkin, Mikhail, editor
- Published
- 2019
- Full Text
- View/download PDF
6. Multi-object Tracking Based on a Multi-layer Particle Filter for Unclustered Spatially Extended Measurements
- Author
-
Buyer, Johannes, Vollert, Martin, Kocsis, Mihai, Sußmann, Nico, Zöllner, Raoul, Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Ruediger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Hirche, Sandra, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Liang, Qilian, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Möller, Sebastian, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zhang, Junjie James, Series Editor, Lee, Sukhan, editor, Ko, Hanseok, editor, and Oh, Songhwai, editor
- Published
- 2018
- Full Text
- View/download PDF
7. A New Multi-objective Hardware-Software-Partitioning Algorithmic Approach for High Speed Applications
- Author
-
Govil, Naman, Shrestha, Rahul, Roy Chowdhury, Shubhajit, Barbosa, Simone Diniz Junqueira, Series editor, Chen, Phoebe, Series editor, Filipe, Joaquim, Series editor, Kotenko, Igor, Series editor, Sivalingam, Krishna M., Series editor, Washio, Takashi, Series editor, Yuan, Junsong, Series editor, Zhou, Lizhu, Series editor, Kaushik, Brajesh Kumar, editor, Dasgupta, Sudeb, editor, and Singh, Virendra, editor
- Published
- 2017
- Full Text
- View/download PDF
8. Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry.
- Author
-
Kim, Kyungdoc, Kim, Byung-In, and Cho, Hyunbo
- Subjects
CUTTING stock problem ,MATHEMATICAL optimization ,MATHEMATICAL models ,HEURISTIC algorithms ,KNAPSACK problems ,PAPER mills - Abstract
This study examines a two-stage two-dimensional cutting stock problem encountered by a paper mill company. The problem includes various machine-related and operational constraints based on real-world situations. Paper products are manufactured using two major cutting processes. Each cutting machine has a specific minimum and maximum width for input and output rolls and is limited by the maximum number of rolls it can cut at the same time. A mathematical model is presented to formally address the problem and an efficient multiple-choice knapsack-based heuristic algorithm is proposed to solve the problem. To demonstrate the efficiency of the proposed heuristic algorithm, computational experiments are conducted on test data-set generated from real-world data provided by a large paper mill company in the Republic of Korea. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
9. Evaluation Methodology for Data Communication-Aware Application Partitioning
- Author
-
Ashraf, Imran, Ostadzadeh, S. Arash, Meeuws, Roel, Bertels, Koen, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, an Mey, Dieter, editor, Alexander, Michael, editor, Bientinesi, Paolo, editor, Cannataro, Mario, editor, Clauss, Carsten, editor, Costan, Alexandru, editor, Kecskemeti, Gabor, editor, Morin, Christine, editor, Ricci, Laura, editor, Sahuquillo, Julio, editor, Schulz, Martin, editor, Scarano, Vittorio, editor, Scott, Stephen L., editor, and Weidendorfer, Josef, editor
- Published
- 2014
- Full Text
- View/download PDF
10. Hybridizing River Formation Dynamics and Ant Colony Optimization
- Author
-
Rabanal, Pablo, Rodríguez, Ismael, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Kampis, George, editor, Karsai, István, editor, and Szathmáry, Eörs, editor
- Published
- 2011
- Full Text
- View/download PDF
11. Invited paper: A Review of Thresheld Convergence
- Author
-
Stephen Chen, James Montgomery, Antonio Bolufé-Röhler, and Yasser Gonzalez-Fernandez
- Subjects
Exploration ,Exploitation ,Heuristic Algorithms ,Optimization ,Multi-modality ,Management. Industrial management ,HD28-70 - Abstract
A multi-modal search space can be defined as having multiple attraction basins – each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers.
- Published
- 2015
12. Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems
- Author
-
Ribas, Imma, Mateo, Manel, Vallespir, Bruno, editor, and Alix, Thècle, editor
- Published
- 2010
- Full Text
- View/download PDF
13. Detecting Multivariate Outliers Using Projection Pursuit with Particle Swarm Optimization
- Author
-
Ruiz-Gazen, Anne, Marie-Sainte, Souad Larabi, Berro, Alain, Lechevallier, Yves, editor, and Saporta, Gilbert, editor
- Published
- 2010
- Full Text
- View/download PDF
14. Optimum Channel Allocation in OFDMA Multi-cell Systems
- Author
-
Abrardo, Andrea, Detti, Paolo, Nicosia, Gaia, Pacifici, Andrea, Servilio, Mara, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Altman, Eitan, editor, and Chaintreau, Augustin, editor
- Published
- 2009
- Full Text
- View/download PDF
15. Design on Algorithm of Automatic Test Papers Generation for Examination System of Electric Energy Measurement.
- Author
-
Yuan-Bin, Chen and Jie, Dai
- Abstract
With various kinds of intelligent metering equipment coming into service, there has been an urgent need for a set of examination system in the electric power industry to check the staff's level of measuring electric energy. In this paper, we design and implement a random test paper generation algorithm for this examination system, and analyze the experiment's data, based on the practical requirement of a training system for the electric energy measurement in a certain electric company. At the same time, in order to get a set of test papers to satisfy the given conditions, this paper discusses how to use optimized genetic algorithm to generate test papers from the question bank. This paper introduce fishnet algorithm to generate test papers automatically for getting a better, more fair and more objective test paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
16. Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search
- Author
-
Gawiejnowicz, Stanisław, Kurc, Wiesław, Pankowska, Lidia, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Wyrzykowski, Roman, editor, Dongarra, Jack, editor, Meyer, Norbert, editor, and Waśniewski, Jerzy, editor
- Published
- 2006
- Full Text
- View/download PDF
17. A MILP Model to Select Cutting Machines and Cutting Patterns to Minimize Paper Loss.
- Author
-
Tharmmaphornphilas, Wipawee, Puemsin, Sukonthip, and Siripongwutikorn, Peerapon
- Subjects
CUTTING machines ,PAPER ,PAPER converting machinery ,HEURISTIC algorithms ,COMPUTER algorithms - Abstract
We study a paper converting process where master rolls are transformed to paper sheets with the minimal paper loss, including trim loss, set up loss, and over-production loss. Two different types of cutters are involved in the converting process - one transversal knife and two transversal knife machines. To solve the problem, various types of paper sheets specified by material type, size, and required quantity are grouped into all possible cutting patterns using a heuristic method. Then, a MILP model is proposed to assign cutting patterns to each type of cutter while satisfying the machine capacity constraints. Applying the methodology to industrial problems, we found the average total loss of 4.6% for single-product group problems and 3.1% for two-product group problems, which respectively correspond to 25.8% and 41.9% improvement over a current method based on worker experiences used by the company. [ABSTRACT FROM AUTHOR]
- Published
- 2013
18. Use of an Evolutionary Approach for Question Paper Template Generation.
- Author
-
Paul, Dimple V., Naik, Shankar B., Rane, Priyanka, and Pawar, Jyoti D.
- Abstract
This paper focuses on question paper template generation and its use in dynamic generation of examination question paper. Question paper template generation is a constrained based optimization problem. Choosing an efficient, scientific and rational algorithm to generate a template is the key to dynamic examination question paper generation. By using the evolutionary computational search technique of evolutionary programming and educational taxonomies, this paper analyses and experimentally proves that the generated question paper templates are best suited for dynamic examination paper generation. This new technique outperforms traditional algorithms in terms of coverage of topics, learning domains and marks distribution in the generated question paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
19. Research on Fuzzy-Logic Algorithm of Intelligent Generating Test Paper.
- Author
-
Qing-yun RU and Jing-yi DU
- Subjects
FUZZY logic ,FUZZY algorithms ,MATHEMATICAL logic ,QUANTITATIVE research ,CONSTRAINT satisfaction ,HEURISTIC algorithms - Abstract
Intelligent generating test paper can be thought of as a typical fuzzy mathematical logic problem. First, the paper analyzes the quantitative evaluation criteria of the traditional test paper generation questions and shows the existing problems in practical application of it. Then the paper introduces two different fuzzy constraints principal disjunctive normal form concept and proposes an evaluation system combining quantitative with qualitative. Viewing at the particularity of constraint satisfaction problems of intelligent generating test paper, the paper uses heuristic knowledge and applies constraint satisfaction method combining generation test with membership correction constraint satisfaction methods to realize intelligent generating test paper. The experiment shows that this method obtains good results. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
20. A Study of Delayed Competitive Influence Propagation Based on Shortest Path Calculation.
- Author
-
Li, Yang and Wang, Zhiqiang
- Subjects
TIME complexity ,HEURISTIC algorithms ,GREEDY algorithms ,SOCIAL influence ,COMPUTATIONAL complexity - Abstract
In social network applications, competitive influence propagation often exhibits a certain degree of time lag. In the scenario of positive and negative competitive propagation studied in this paper, under the premise that negative nodes are activated first, how to find a set of positive seed nodes to participate in competitive propagation is studied, aiming to minimize the spread of negative influence. In the current study, the time complexity of the improved algorithms based on greedy strategies is high, which limits their scope of application in practical scenarios; some heuristic algorithms achieve better scalability, but there is still much room for improvement. Therefore, this paper proposes a new method to solve the influence propagation problem of delayed competition, also known as a heuristic propagation factor evaluation algorithm (HeuPFE). The main process is as follows: (1) We build a shortest path snapshot for the nearest propagation region of negative nodes and reduce the search space of competing nodes. (2) Then, we construct a node propagation factor evaluation method based on this shortest negative-oriented node path snapshot to reduce computational complexity. Comparing results with those of traditional heuristic algorithms, we carry out experiments on real datasets and verify the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
21. The spatial frequency domain designated watermarking framework uses linear blind source separation for intelligent visual signal processing.
- Author
-
Kumari, Rani and Mustafi, Abhijit
- Subjects
BLIND source separation ,WATERMARKS ,DIGITAL watermarking ,SIGNAL processing ,SEPARATION of variables ,ELECTRONIC paper ,HEURISTIC algorithms - Abstract
This paper develops a digital watermarking algorithm using an informed watermark retrieval architecture. The developed method uses the fractional Fourier transform to embed the watermark in the space-frequency domain and extracts the watermark using blind source separation techniques. The watermark embedding is further enhanced using a heuristic algorithm to increase the strength of the watermarking system. We use genetic algorithm to find the optimal fractional domain by minimizing the coefficient of RMSE between the input image and the watermarked image. The algorithm's performance against various common attacks, e.g., JPEG compression and Gaussian noise, is presented to estimate the algorithm's robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. On the one-dimensional stock cutting problem in the paper tube industry.
- Author
-
Matsumoto, Kazuki, Umetani, Shunji, and Nagamochi, Hiroshi
- Subjects
CUTTING stock problem ,PAPER products industry ,TUBES ,COMBINATORIAL optimization ,INDUSTRIAL applications ,SEARCH algorithms ,HEURISTIC algorithms - Abstract
The one-dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems which arises in many industrial applications. Although the primary objective of 1D-CSP is to minimize the total length of used stock rolls, the efficiency of cutting processes has become more important in recent years. The crucial bottleneck of the cutting process often occurs at handling operations in semiautomated manufacturers such as those in the paper tube industry. To reduce interruptions and errors at handling operations in the paper tube industry, we consider a variant of 1D-CSP that minimizes the total length of used stock rolls while constraining (C1) the number of setups of each stock roll type, (C2) the combination of piece lengths occurring in open stacks simultaneously, and (C3) the number of open stacks. For this problem, we propose a generalization of the cutting pattern called the 'cutting group,' which is a sequence of cutting patterns that satisfies the given upper bounds of setups of each stock roll type and open stacks. To generate good cutting groups, we decompose the 1D-CSP into a number of auxiliary bin packing problems. We develop a tabu search algorithm based on a shift neighborhood that solves the auxiliary bin packing problems by the first-fit decreasing heuristic algorithm. Experimental results show that our algorithm improves the quality of solutions compared to the existing algorithm used in a paper tube factory. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
23. QM-DLA: an efficient qubit mapping method based on dynamic look-ahead strategy.
- Author
-
Liu, Hui, Zhang, Bingjie, Zhu, Yu, Yang, Hanxiao, and Zhao, Bo
- Subjects
QUBITS ,QUANTUM computing ,DIRECTED acyclic graphs ,QUANTUM gates ,HEURISTIC algorithms - Abstract
Quantum computing has already demonstrated great computational potential across multiple domains and has received more and more attention. However, due to the connectivity limitations of Noisy Intermediate-Scale Quantum (NISQ) devices, most of the quantum algorithms cannot be directly executed without the help of inserting SWAP gates. Nevertheless, more SWAP gates lead to a longer execution time and, inevitably, lower fidelity of the algorithm. To this end, this paper proposes an optimized qubit mapping algorithm based on a dynamic look-ahead strategy to minimize the number of SWAP gates inserted. Firstly, a heuristic algorithm is proposed based on maximizing physical qubit connectivity to generate the optimal initial qubit mapping, which reduces the need for logical qubit shifts during subsequent SWAP gate insertion. Secondly, in the form of directed acyclic graphs, we identify quantum gates that violate the constraints of physical coupling and insert SWAP gates to remap qubits, thereby overcoming the limitations of qubit interactions. Finally, the optimal SWAP gate insertion strategy is built by comparing the cost of different SWAP gate insertion strategies through a multi-window look-ahead strategy to reduce the number of SWAP gates inserted. The experimental results show that the strategy in this paper decreases the number of SWAP gate insertions and significantly reduces the depth of quantum circuits when performing qubit mapping compared with state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. A Survey of Algorithms for Paper-reviewer Assignment Problem.
- Author
-
Kolasa, Tomasz and Krol, Dariusz
- Subjects
GENETIC algorithms ,HEURISTIC algorithms ,COMBINATORIAL optimization ,ARTIFICIAL intelligence ,SET theory - Abstract
This paper analyzes some details of artificial intelligence algorithms to paper-reviewer assignment problem. In particular, the study on most common algorithms like genetic algorithm (GA), ant colony optimization (ACO) and tabu-search (TS) is made and the performance of these algorithms in paper-reviewer assignment problem is tested. Moreover, two hybrid methods that efficiently combine the above-mentioned algorithms are proposed: the ACO-GA and GA-TS algorithms. To measure the performance of these algorithms, extensive computational experiments are conducted. Evaluation using different data sets shows that the proposed algorithms are effective and achieve good results. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
25. Invited paper: A Review of Thresheld Convergence
- Author
-
Montgomery, James, Gonzalez-Fernandez, Yasser, Bolufé-Röhler, Antonio, and Chen, Stephen
- Subjects
Optimization ,lcsh:Management. Industrial management ,lcsh:HD28-70 ,Management. Industrial management ,ComputerApplications_COMPUTERSINOTHERSYSTEMS ,Exploration ,Exploitation ,Multi-modality ,HD28-70 ,Heuristic Algorithms - Abstract
A multi-modal search space can be defined as having multiple attraction basins – each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers.
- Published
- 2015
- Full Text
- View/download PDF
26. Method for Collaborative Layout Optimization of Ship Equipment and Pipe Based on Improved Multi-Agent Reinforcement Learning and Artificial Fish Swarm Algorithm.
- Author
-
Zhang, Hongshuo, Yu, Yanyun, Song, Zelin, Han, Yanzhao, Yang, Zhiyao, and Ti, Lang
- Subjects
OPTIMIZATION algorithms ,MACHINE learning ,REWARD (Psychology) ,EVIDENCE gaps ,HEURISTIC algorithms - Abstract
The engine room is the core area of a ship, critical to its operation, safety, and efficiency. Currently, many researchers merely address the ship engine room layout design (SERLD) problem using optimization algorithms and independent layout strategies. However, the engine room environment is complex, involving two significantly different challenges: equipment layout and pipe layout. Traditional methods fail to achieve optimal collaborative layout objectives. To address this research gap, this paper proposes a collaborative layout method that combines improved reinforcement learning and heuristic algorithms. For equipment layout, the engine room space is first discretized into a grid, and a Markov decision process (MDP) framework suitable for equipment layout is proposed, including state space, action space, and reward mechanisms suitable for equipment layout. An improved adaptive guided multi-agent Q-learning (AGMAQL) algorithm is employed to train the layout model in a centralized manner, with enhancements made to the agent's exploration state, exploration action, and learning strategy. For pipe layout, this paper proposes an improved adaptive trajectory artificial fish swarm algorithm (ATAFSA). This algorithm incorporates a hybrid encoding method, adaptive strategy, scouting strategy, and parallel optimization strategy, resulting in enhanced stability, accuracy, and problem adaptability. Subsequently, by comprehensively considering layout objectives and engine room attributes, a collaborative layout method incorporating hierarchical and adaptive weight strategies is proposed. This method optimizes in phases according to the layout objectives and priorities of different stages, achieving multi-level optimal layouts and providing designers with various reference schemes with different focuses. Finally, based on a typical real-world engine room engineering case, various leading algorithms and strategies are tested and compared. The results show that the proposed AGMAQL-ATAFSA (AGMAQL-ATA) exhibits robustness, efficiency, and engineering practicality. Compared to previous research methods and algorithms, the final layout quality improved overall: equipment layout effectiveness increased by over 4.0%, pipe optimization efficiency improved by over 40.4%, and collaborative layout effectiveness enhanced by over 2.2%. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. Improved Ant Colony Algorithm for the Split Delivery Vehicle Routing Problem.
- Author
-
Ma, Xiaoxuan and Liu, Chao
- Subjects
ANT algorithms ,PARTICLE swarm optimization ,VEHICLE routing problem ,BEES algorithm ,COMBINATORIAL optimization ,HEURISTIC algorithms ,RADAR in aeronautics - Abstract
The split delivery vehicle routing problem (SDVRP) is a classic combinatorial optimization problem, which is usually solved using a heuristic algorithm. The ant colony optimization algorithm is an excellent heuristic algorithm that has been successfully applied to solve various practical problems, and it has achieved good results. However, in the existing ant colony optimization algorithms, there are issues with weak targeting of different customer selection strategies, difficulty in balancing convergence speed and global search ability, and a predisposition to become trapped in local optima. To solve these problems, this paper proposes an improved ant colony algorithm (IACA). First, in terms of customer point selection, the initial customer and noninitial customer selection strategies are proposed for different customers, and the adaptive selection threshold is designed. Second, in terms of pheromone processing, an initial pheromone distribution method based on a greedy strategy, a pheromone backtracking mechanism, and an adaptive pheromone volatile factor are proposed. Finally, based on the 2-opt local search method, vehicle path self-search and intervehicle path search are proposed to further improve the quality of the solution. This paper tests the performance of the IACA on datasets of different scales. The experimental results show that compared with the clustering algorithm, artificial bee colony algorithm, particle swarm optimization algorithm, traditional ant colony algorithm, and other algorithms, the IACA can achieve more competitive results. Specifically, compared to the path length calculated by other algorithms, the path length calculated by IACA decreased by an average of 1.58%, 4.28%, and 3.64% in small, medium, and large-scale tests, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Guest editorial for the PMC special section on selected papers from ICDCN 2017.
- Author
-
Bellavista, Paolo and Kar, Koushik
- Subjects
DISTRIBUTED computing ,HEURISTIC algorithms - Published
- 2019
- Full Text
- View/download PDF
29. Invited paper: A Review of Thresheld Convergence.
- Author
-
Chen, Stephen, Montgomery, James, Bolufé-Röhler, Antonio, and Gonzalez-Fernandez, Yasser
- Subjects
- *
DIFFERENTIAL evolution , *METAHEURISTIC algorithms , *PARTICLE swarm optimization , *MATHEMATICAL optimization , *STOCHASTIC convergence , *PERFORMANCE evaluation - Abstract
A multi-modal search space can be defined as having multiple attraction basins - each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers. [ABSTRACT FROM AUTHOR]
- Published
- 2015
30. Simultaneous determination of maximum acceleration and endurance of morphing UAV with ABC algorithm-based model
- Author
-
Konar, Mehmet
- Published
- 2020
- Full Text
- View/download PDF
31. An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem.
- Author
-
Zhaolin Lv, Yuexia Zhao, Hongyue Kang, Zhenyu Gao, and Yuhang Qin
- Subjects
PRODUCTION scheduling ,OPTIMIZATION algorithms ,FLOW shops ,METAHEURISTIC algorithms ,PRODUCTION management (Manufacturing) ,HEURISTIC algorithms ,NP-hard problems ,RANDOM walks - Abstract
Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize the makespan. This paper chooses a twosegment encoding mode based on the job and the machine of the FJSP. To verify the effectiveness of GNHHO, this study tests it in 23 benchmark functions, 10 standard job shop scheduling problems (JSPs), and 5 standard FJSPs. Besides, this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company's FJSP. The optimized scheduling scheme demonstrates significant improvements in makespan, with an advancement of 28.16% for static scheduling and 35.63% for dynamic scheduling. Moreover, it achieves an average increase of 21.50% in the on-time order delivery rate. The results demonstrate that the performance of theGNHHO algorithm in solving FJSP is superior to some existing algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Trauma-Informed Design: Leveraging Usability Heuristics on a Social Services Website.
- Author
-
Eggleston, Melissa and Noel, Lesley-Ann
- Subjects
USER experience ,SOCIAL services ,WEBSITES ,INFORMATION technology ,HEURISTIC algorithms ,MOBILE apps - Abstract
Trauma-informed design and technology have been an important topic of discussion in the last 5 years in user experience. However, little exists to offer practical direction for practitioners applying trauma-informed approaches to websites, apps, and other digital tools. This paper shares an example of applying trauma-informed (TI) principles to a social service agency website in the United States using wellknown usability heuristics, which are principles used in interaction design to ensure usability. There appears to be a significant overlap between usability heuristics and TI principles; practitioners can use usability heuristics as a familiar foundation to make any design more traumainformed. This paper describes specific ways TI principles can be operationalized using usability heuristics to develop more user-friendly and trauma-informed websites. A case study in design shows how user experience professionals can be more trauma-informed in their work to better serve the general public or users who have experienced trauma. [ABSTRACT FROM AUTHOR]
- Published
- 2024
33. Simplified approach for locating the critical probabilistic slip surface in limit equilibrium analysis.
- Author
-
Cheng, Y. M., Li, L., and Liu, L. L.
- Subjects
EQUILIBRIUM ,RELIABILITY in engineering ,COMPARATIVE studies ,MONTE Carlo method ,HEURISTIC algorithms ,COMPUTER algorithms - Abstract
This paper aims to develop a rapid and practical procedure that can locate the slip surface for a slope with the minimum reliability index for limit equilibrium analysis at the minimum expense of time. The comparative study on the reliability indices from different sample numbers using the Monte Carlo Simulation Method has demonstrated that the results from large enough sample number are related with those from small sample number with high correlation indices. This observation has been tested for many homogeneous and heterogeneous slopes with various conditions under parametric studies. Based on this observation, the reliability index for a potential slip surface can be calcu lated with a small sample number, and the search for the minimum reliability index and the slip surface can be determined by heuristic optimization algorithm. Based on the comparisons between the critical deterministic and probabilistic slip surfaces for many different cases, the use of the proposed fast method in locating the critical probabilistic slip surface is found to perform well, which is suitable for normal routine analysis and design works. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
34. TSPS: A Topic based Shortest Path Set algorithm for influence maximization.
- Author
-
Duan, Xiuliang, Qiu, Liqing, and Sun, Chengai
- Subjects
SOCIAL networks ,ALGORITHMS ,SOCIAL problems ,INFLUENCE ,HEURISTIC algorithms - Abstract
This paper focuses on the influence maximization problem in social networks, which aims to find some influence nodes that maximize the spread of information. Most existing achievements usually adopt a uniform propagation probability, without considering the topic information. Moreover, the classic Independent Cascade Model and its approximations have suffered from much running time. To overcome this limitation, this paper proposed a Topic based Shortest Path Set algorithm (TSPS). Additionally, a comprehensive set of experiments are conducted on large real-world networks, showing that our proposal provides more impressive results in the aspects of influence spread and running time. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. Heuristic optimization of Bezier curves based trajectories for unconventional airships docking
- Author
-
Ceruti, Alessandro and Marzocca, Pier
- Published
- 2017
- Full Text
- View/download PDF
36. A proactive/reactive mass screening approach with uncertain symptomatic cases.
- Author
-
Lin, Jiayi, Aprahamian, Hrayer, and Golovko, George
- Subjects
BUDGET ,MEDICAL screening ,HEALTH services administrators ,HEURISTIC algorithms ,STATISTICAL decision making - Abstract
We study the problem of mass screening of heterogeneous populations under limited testing budget. Mass screening is an essential tool that arises in various settings, e.g., the COVID-19 pandemic. The objective of mass screening is to classify the entire population as positive or negative for a disease as efficiently and accurately as possible. Under limited budget, testing facilities need to allocate a portion of the budget to target sub-populations (i.e., proactive screening) while reserving the remaining budget to screen for symptomatic cases (i.e., reactive screening). This paper addresses this decision problem by taking advantage of accessible population-level risk information to identify the optimal set of sub-populations for proactive/reactive screening. The framework also incorporates two widely used testing schemes: Individual and Dorfman group testing. By leveraging the special structure of the resulting bilinear optimization problem, we identify key structural properties, which in turn enable us to develop efficient solution schemes. Furthermore, we extend the model to accommodate customized testing schemes across different sub-populations and introduce a highly efficient heuristic solution algorithm for the generalized model. We conduct a comprehensive case study on COVID-19 in the US, utilizing geographically-based data. Numerical results demonstrate a significant improvement of up to 52% in total misclassifications compared to conventional screening strategies. In addition, our case study offers valuable managerial insights regarding the allocation of proactive/reactive measures and budget across diverse geographic regions. Author summary: The problem of mass screening of heterogeneous populations is challenging, especially when we do not have enough tests to check everyone all at once. Therefore, under limited testing budget, testing facilities need to allocate a portion of the testing budget to target sub-populations (i.e., proactive screening) while reserving the remaining budget to screen for symptomatic cases (i.e., reactive screening). Our study provides a strategy to make those decision efficiently by taking advantage of risk information and utilizing optimization models. We conduct a comprehensive case study on COVID-19 in the US and numerical results demonstrate a significant improvement compared to conventional screening strategies. The results of this paper will benefit health administrators and policy-makers by providing managerial insights regarding optimal allocation of testing kits and testing designs across diverse geographic regions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. Optimizing Robotic Mobile Fulfillment Systems for Order Picking Based on Deep Reinforcement Learning.
- Author
-
Zhu, Zhenyi, Wang, Sai, and Wang, Tuantuan
- Subjects
DEEP reinforcement learning ,REINFORCEMENT learning ,DEEP learning ,ANT algorithms ,ORDER picking systems ,ROBOTICS ,HEURISTIC algorithms - Abstract
Robotic Mobile Fulfillment Systems (RMFSs) face challenges in handling large-scale orders and navigating complex environments, frequently encountering a series of intricate decision-making problems, such as order allocation, shelf selection, and robot scheduling. To address these challenges, this paper integrates Deep Reinforcement Learning (DRL) technology into an RMFS, to meet the needs of efficient order processing and system stability. This study focuses on three key stages of RMFSs: order allocation and sorting, shelf selection, and coordinated robot scheduling. For each stage, mathematical models are established and the corresponding solutions are proposed. Unlike traditional methods, DRL technology is introduced to solve these problems, utilizing a Genetic Algorithm and Ant Colony Optimization to handle decision making related to large-scale orders. Through simulation experiments, performance indicators—such as shelf access frequency and the total processing time of the RMFS—are evaluated. The experimental results demonstrate that, compared to traditional methods, our algorithms excel in handling large-scale orders, showcasing exceptional superiority, capable of completing approximately 110 tasks within an hour. Future research should focus on integrated decision-making modeling for each stage of RMFSs and designing efficient heuristic algorithms for large-scale problems, to further enhance system performance and efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. Dynamic Cooperative Communications with Mutual Information Accumulation for Mobile Robots in Industrial Internet of Things.
- Author
-
Sun, Daoyuan, Liu, Zefan, and Zhang, Xinming
- Subjects
INDUSTRIAL robots ,INTERNET of things ,WIRELESS Internet ,MOBILE robots ,TIME complexity ,HEURISTIC algorithms ,WIRELESS sensor networks - Abstract
Mobile robots play an important role in the industrial Internet of Things (IIoT); they need effective mutual communication between the cloud and themselves when they move in a factory. By using the sensor nodes existing in the IIoT environment as relays, mobile robots and the cloud can communicate through multiple hops. However, the mobility and delay sensitivity of mobile robots bring new challenges. In this paper, we propose a dynamic cooperative transmission algorithm with mutual information accumulation to cope with these two challenges. By using rateless coding, nodes can reduce the delay caused by retransmission under poor channel conditions. With the help of mutual information accumulation, nodes can accumulate information faster and reduce delay. We propose a two-step dynamic algorithm, which can obtain the current routing path with low time complexity. The simulation results show that our algorithm is better than the existing heuristic algorithm in terms of delay. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. Intelligent Model Predictive Control and Its Application to Aeroengines.
- Author
-
Li, Peng, Zhao, Xudong, Liu, Shuoshuo, Xu, Ning, and Qin, Haiqin
- Subjects
OPTIMIZATION algorithms ,PREDICTION models ,METAHEURISTIC algorithms ,INDUSTRIAL efficiency ,INTELLIGENT control systems ,RESEARCH personnel ,HEURISTIC algorithms ,ELECTRIC transients - Abstract
In this paper, a new model predictive control termed as intelligent model predictive control (IMPC) combined with an improved new competitive swarm optimizer (CSO) is designed. The analytical predictive model is not necessarily established a priori in the proposed IMPC algorithm, and the control plant can be used directly as the predictive model to reduce the complexity of the algorithm. In addition, two new techniques, dynamic initialization and back steps methods, are proposed and utilized to improve the traditional CSO to realize constraints management during the optimization process. An application to aeroengine transient-state control is studied to verify the effectiveness of the presented IMPC algorithm. It is shown that, benefitting from the IMPC algorithm, the control task is well completed and all the constraints are satisfied. Practical Applications: This paper proposes a new optimization algorithm to solve some complex optimization problems with constraints. The designed new optimization algorithm is simple and easy to implement and it is more suitable for applications with black-box models or complex optimization objective functions compared with some existing optimization algorithms. This paper may provide some help to researchers who are interested in model predictive control or metaheuristic algorithms and to people whose work contains some complex optimization problems. This paper also provides a design method of aeroengine transient-state control plans. The simulation results showed that compared with some existing control methods or optimization algorithms, the aeroengine could accelerate to the desired steady-state point with shorter transient time and all constraints are satisfied when utilizing the proposed new optimization algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. Enhancing the Efficiency of Resilient Multipath-Routed Elastic Optical Networks: A Novel Approach for Coexisting Protected and Unprotected Services with Idle Slot Reuse.
- Author
-
Cavalcanti, Michael M. L., Teixeira, Gabriela W., Dinarte, Henrique A., Almeida Jr., Raul C., Boutaba, Raouf, and Chaves, Daniel A. R.
- Subjects
HEURISTIC algorithms ,PRIVATE security services ,BANDWIDTHS ,TOPOLOGY ,ASSIGNMENT problems (Programming) ,VEHICLE routing problem - Abstract
In this paper, we investigate a scenario in which protected and unprotected services coexist in an elastic optical network under dynamic traffic. In the investigated scenario, unprotected services can reuse the reserved idle bandwidth to provide protection to the protected services. Under this scenario, we propose a new heuristic algorithm that enables such reuse as well as define and introduce a new assignment problem in elastic optical networks, named a Transmission Spectrum Assignment (T-SA) problem. In this paper, we consider a scenario in which services may be routed using the multipath routing approach. Additionally, protection using bandwidth squeezing is also considered. We assess our proposal through simulations on three different network topologies and compare our proposal against the classical protection approach, in which bandwidth reuse is not allowed. For the simulated range of network loads, the maximum (minimum) blocking probability reduction obtained by our proposal is approximately 48% (10%) in the European topology, 46% (7%) in the NSFNET topology, and 32% (6%) in the German topology. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Operator placement for data stream processing based on publisher/subscriber in hybrid cloud-fog-edge infrastructure.
- Author
-
Tang, Bing, Han, Huiyuan, Yang, Qing, and Xu, Wei
- Subjects
ELECTRONIC data processing ,GREEDY algorithms ,HEURISTIC algorithms ,GENETIC algorithms ,DATA brokers ,BROKERS ,INTERNET of things - Abstract
Internet of Things (IoT) systems generate a vast volume of data to process, and the volume of data generated by the IoT will continue to expand exponentially in the future. Due to the large-scale nature of such systems and their geographically distributed nature, how to optimally place operators and brokers for data processing across cloud, fog, and edge is the main concern of this paper. Furthermore, in the past, IoT systems relied on cloud-based brokers. If the communication between operators in an IoT application has to be regulated by a broker located in the cloud, the advantages brought by the processing of nodes located at the edge and the fog may be neglected. We consider various factors, such as the impact of different network topologies on operators and brokers, the needs of IoT application users, the performance of sensor layers, and the location characteristics of IoT sensors. In diverse placement strategies, the characteristics of the broker have been given special attention. This paper considers the combined architecture of the operator and broker on the edge, fog, and cloud as an optimization problem of minimizing computational processing and data transmission cost. We propose jointly placing the IoT application's operator and broker on the edge, fog, and cloud nodes. Then we proposed two algorithms: the low-complexity heuristic algorithm named GREEDY and the genetic algorithm called GA. Simulation results show that, in most situations, the GA placement method outperforms others and provides a near-optimal solution. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Remote-Sensing Satellite Mission Scheduling Optimisation Method under Dynamic Mission Priorities.
- Author
-
Li, Xiuhong, Sun, Chongxiang, Fan, Huilong, and Yang, Jiale
- Subjects
SCHEDULING ,RESOURCE allocation ,REMOTE sensing ,HEURISTIC algorithms - Abstract
Mission scheduling is an essential function of the management control of remote-sensing satellite application systems. With the continuous development of remote-sensing satellite applications, mission scheduling faces significant challenges. Existing work has many inherent shortcomings in dealing with dynamic task scheduling for remote-sensing satellites. In high-load and complex remote sensing task scenarios, there is low scheduling efficiency and a waste of resources. The paper proposes a scheduling method for remote-sensing satellite applications based on dynamic task prioritization. This paper combines the and Bound methodologies with an onboard task queue scheduling band in an active task prioritization context. A purpose-built emotional task priority-based scheduling blueprint is implemented to mitigate the flux and unpredictability characteristics inherent in the traditional satellite scheduling paradigm, improve scheduling efficiency, and fine-tune satellite resource allocation. Therefore, the Branch and Bound method in remote-sensing satellite task scheduling will significantly save space and improve efficiency. The experimental results show that comparing the technique to the three heuristic algorithms (GA, PSO, DE), the BnB method usually performs better in terms of the maximum value of the objective function, always finds a better solution, and reduces about 80% in terms of running time. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem.
- Author
-
Liu, Yi and Jiang, Xiaoyun
- Subjects
BIN packing problem ,ALGORITHMS ,HEURISTIC algorithms ,INTEGER programming ,GENETIC algorithms - Abstract
To improve cargo loading efficiency and achieve diverse needs of companies for the loading process, this paper innovatively establishes a multiple objective mixed integer programming model for the three-dimensional multiple bin-size bin packing problem (3D-MBSBPP). The model is designed to maximize container space utilization rate and cargo load balance, minimize container usage costs, and incorporates some practical constraints. On this basis, we propose a novel dynamic feedback algorithm based on spatial corner fitness (SCF_DFA) to solve this model, which consists of three stages. Specifically, Stage 1 employs a heuristic algorithm based on spatial corner fitness to optimize the search of the remaining spaces. Stage 2 employs a container type selection algorithm to dynamically adjust and optimize container types. Stage 3 uses an improved genetic algorithm to improve the quality of the solutions of the first two stages. We demonstrate the effectiveness of the proposed algorithm through comparative experiments on benchmark instances, and apply it to solve the real-life instances for the 3D-MBSBPP. The results show that the proposed algorithm can make the average container space utilization rate reach 85.38%, which is 1.48% higher than that of baseline method, while the loading results obtained are more balanced, indicating the advantages of the SCF_DFA in solving 3D-MBSBPP. Furthermore, we conduct ablation experiments to confirm the effectiveness of each component within the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
44. Maximum Node Interconnection by a Given Sum of Euclidean Edge Lengths in a Cluster Node Distribution.
- Author
-
Yeonsoo Kim, Minkwon Kim, and Byungyeon Hwang
- Subjects
HEURISTIC algorithms ,GENETIC algorithms ,DISTRIBUTED algorithms - Abstract
This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
45. Air Traffic Flow Management Delay Prediction Based on Feature Extraction and an Optimization Algorithm.
- Author
-
Zhao, Zheng, Yuan, Jialing, and Chen, Luhao
- Subjects
OPTIMIZATION algorithms ,AIR flow ,TRAFFIC flow ,FEATURE extraction ,HEURISTIC algorithms ,SEARCH algorithms - Abstract
Air Traffic Flow Management (ATFM) delay can quantitatively reflect the congestion caused by the imbalance between capacity and demand in an airspace network. Furthermore, it is an important parameter for the ex-post analysis of airspace congestion and the effectiveness of ATFM strategy implementation. If ATFM delays can be predicted in advance, the predictability and effectiveness of ATFM strategies can be improved. In this paper, a short-term ATFM delay regression prediction method is proposed for the characteristics of the multiple sources, high dimension, and complexity of ATFM delay prediction data. The method firstly constructs an ATFM delay prediction network model, specifies the prediction object, and proposes an ATFM delay prediction index system by integrating common flow control information. Secondly, an ATFM delay prediction method based on feature extraction modules (including CNN, TCN, and attention modules), a heuristic optimization algorithm (sparrow search algorithm (SSA)), and a prediction model (LSTM) are proposed. The method constructs a CNN-LSTM-ATT model based on SSA optimization and a TCN-LSTM-ATT model based on SSA optimization. Finally, four busy airports and their major waypoints in East China are selected as the ATFM delay prediction network nodes for example validation. The experimental results show that the MAEs of the two models proposed in this paper for ATFM delay regression prediction are 4.25 min and 4.38 min, respectively. Compared with the CNN-LSTM model, the errors are reduced by 2.71 min and 2.59 min, respectively. Compared with the TCN-LSTM model, the times are 3.68 min and 3.55 min, respectively. In this paper, two improved LSTM models are constructed to improve the prediction accuracy of ATFM delay duration so as to provide support for the establishment of an ATFM delay early warning mechanism, further improve ATFM delay management, and enhance resource allocation efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Optimal Location and Sizing of Multi-Resource Distributed Generator Based on Multi-Objective Artificial Bee Colony Algorithm.
- Author
-
Qiangfei Cao, Huilai Wang, Zijia Hui, and Lingyun Chen
- Subjects
BEES algorithm ,HONEYBEES ,LIFE cycle costing ,DISTRIBUTED algorithms ,EMISSIONS (Air pollution) ,WIND power ,HEURISTIC algorithms ,GAS turbines - Abstract
Distribution generation (DG) technology based on a variety of renewable energy technologies has developed rapidly. A large number of multi-type DG are connected to the distribution network (DN), resulting in a decline in the stability of DN operation. It is urgent to find a method that can effectively connect multi-energy DG to DN. photovoltaic (PV), wind power generation (WPG), fuel cell (FC), and micro gas turbine (MGT) are considered in this paper. A multi-objective optimization model was established based on the life cycle cost (LCC) of DG, voltage quality, voltage fluctuation, system network loss, power deviation of the tie-line, DG pollution emission index, and meteorological index weight of DN. Multi-objective artificial bee colony algorithm (MOABC) was used to determine the optimal location and capacity of the four kinds of DG access DN, and compared with the other three heuristic algorithms. Simulation tests based on IEEE 33 test node and IEEE 69 test node show that in IEEE 33 test node, the total voltage deviation, voltage fluctuation, and system network loss of DN decreased by 49.67%, 7.47% and 48.12%, respectively, compared with that without DG configuration. In the IEEE 69 test node, the total voltage deviation, voltage fluctuation and system network loss of DN in the MOABC configuration scheme decreased by 54.98%, 35.93% and 75.17%, respectively, compared with that without DG configuration, indicating that MOABC can reasonably plan the capacity and location of DG. Achieve the maximum trade-off between DG economy and DN operation stability. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Integrating Minimum Spanning Tree and MILP in Urban Planning: A Novel Algorithmic Perspective.
- Author
-
Pavon, Wilson, Torres, Myriam, and Inga, Esteban
- Subjects
URBAN planning ,SPANNING trees ,MIXED integer linear programming ,GREEDY algorithms ,URBAN trees - Abstract
This paper presents a novel eight-step iterative algorithm for optimizing the layout of a neighborhood, focusing on the efficient allocation of houses to strategically placed facilities, herein referred to as 'points of interest'. The methodology integrates a mixed integer linear programming (MILP) approach with a heuristic algorithm to address a variant of the facility location problem combined with network design considerations. The algorithm begins by defining a set of geographic coordinates to represent houses within a predefined area. It then identifies key points of interest, forming the basis for subsequent connectivity and allocation analyses. The methodology's core involves applying the Greedy algorithm to assign houses to the nearest points of interest, subject to capacity constraints. The method is followed by computing a Minimum Spanning Tree (MST) among these points to ensure efficient overall connectivity. The proposed algorithm's iterative design is a key attribute. The most promising result of this approach is its ability to minimize the distance between houses and points of interest while optimizing the network's total length. This dual optimization ensures a balanced distribution of houses and an efficient layout, making it particularly suitable for urban planning and infrastructure development. The paper's findings demonstrate the algorithm's effectiveness in creating a practical and efficient neighborhood layout, highlighting its potential application in large-scale urban planning and development projects. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Construction and application of logistics scheduling model based on heterogeneous graph neural network.
- Author
-
Wang, Lei
- Subjects
PARETO optimum ,LOGISTICS ,HEURISTIC algorithms ,SCHEDULING ,SUPPLY chains - Abstract
The core of logistics is scheduling and monitoring. After the modern interprise logistics development concept change, the development prospect of enterprise logistics is more optimistic. Major enterprises have begun to use intelligent logistics scheduling platforms. In order to solve the problem that heterogeneous information fusion is complex in the temporal heterogeneous graphs, this paper proposes to dynamically store and update node representation through an augmented memory matrix in a memory network. At the same time, the model also designs a novel read-write module for the memory matrix, which can effectively capture the timing information in the long interaction sequence and has high flexibility. The model has significantly improved in tasks such as node classification, timing recommendation and visualization. This paper studies the logistics supply chain of modern enterprises and establishes the mathematical model of vehicle scheduling. This paper takes the non-full load scheduling model as the critical research object. Based on the research of logistics supply chain, the vehicle scheduling model is established. The intelligent heuristic algorithm is applied to solve it, and the effective vehicle distribution scheme and driving route are formed. The simulation results show that the approximate Pareto optimal solution obtained by our designed model and algorithm has good robustness. NSGAIIROELSDR can get a better solution in small-scale scheduling. However, in large-scale numerical experiments, the final solution obtained by MOEA/DROELSDR is obviously better than that of NSGAIIROELSDR, and the running time of MOEA/DROELSDR is also shorter. Therefore, we conclude that MOEA/DROELSDR is more suitable for large-scale scheduling, and NSGAIIROELSDR is more suitable for more minor scheduling. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
49. HPO-RRT*: a sampling-based algorithm for UAV real-time path planning in a dynamic environment.
- Author
-
Guo, Yicong, Liu, Xiaoxiong, Jia, Qianlei, Liu, Xuhang, and Zhang, Weiguo
- Subjects
DRONE aircraft ,ALGORITHMS ,HEURISTIC algorithms - Abstract
The real-time path planning of unmanned aerial vehicles (UAVs) in dynamic environments with moving threats is a difficult problem. To solve this problem, this paper proposes a time-based rapidly exploring random tree (time-based RRT*) algorithm, called the hierarchical rapidly exploring random tree algorithm based on potential function lazy planning and low-cost optimization (HPO-RRT*). The HPO-RRT* algorithm can guarantee path homotopy optimality and high planning efficiency. This algorithm uses a hierarchical architecture comprising a UAV perception system, path planner, and path optimizer. After the UAV perception system predicts moving threats and updates world information, the path planner obtains the heuristic path. First, the path planner uses the bias sampling method based on the artificial potential field function proposed in this paper to guide sampling to improve the efficiency and quality of sampling. Then, the tree is efficiently extended by the improved time-based lazy collision checking RRT* algorithm to obtain the heuristic path. Finally, a low-cost path optimizer quickly optimizes the heuristic path directly to optimize the path while avoiding additional calculations. Simulation results show that the proposed algorithm outperforms the three existing advanced algorithms in terms of addressing the real-time path-planning problem of UAVs in a dynamic environment. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
50. A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem.
- Author
-
Becker, Kai Helge and Appa, Gautam
- Subjects
HEURISTIC algorithms ,COMBINATORICS ,CUTTING stock problem ,PAPER industry ,COMPUTATIONAL complexity - Abstract
The Minimum Score Separation Problem (MSSP) is a combinatorial problem that was introduced in JORS 55 as an open problem in the paper industry arising in conjunction with the cutting stock problem. During the process of producing boxes, flat papers are prepared for folding by being scored with knives. The problem is to determine whether and how a given production pattern of boxes can be arranged such that a certain minimum distance between the knives can be kept. Introducing the concept of matching-based alternating Hamiltonian paths, this paper models the MSSP as the problem of finding an alternating Hamiltonian path on a graph that is the union of a matching and a type of graph known as a 'threshold graph'. On this basis, we find a heuristic that can quickly recognize a large percentage of feasible and infeasible instances of the MSSP. Detailed computational experiments demonstrate the efficiency of our approach. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.