Algorithms

Research

Jump to: Review

18 pages, 2909 KiB

Open AccessArticle

Travel Time Reliability-Based Rescue Resource Scheduling for Accidents Concerning Transport of Dangerous Goods by Rail

by Lanfen Liu and Xinfeng Yang

Algorithms 2021, 14(11), 325; https://doi.org/10.3390/a14110325 - 5 Nov 2021

Cited by 3 | Viewed by 2094

Abstract

The characteristics of railway dangerous goods accidents are very complex. The rescue of railway dangerous goods accidents should consider the timeliness of rescue, the uncertainty of traffic environment and the diversity of rescue resources. Thus, the purpose of this paper is to confront [...] Read more.

The characteristics of railway dangerous goods accidents are very complex. The rescue of railway dangerous goods accidents should consider the timeliness of rescue, the uncertainty of traffic environment and the diversity of rescue resources. Thus, the purpose of this paper is to confront the rescue resources scheduling problem of railway dangerous goods accident by considering factors such as rescue capacity, rescue demand and response time. Based on the analysis of travel time and reliability for rescue route, a multi-objective scheduling model of rescue resources based on travel time reliability is constructed in order to minimize the total arrival time of rescue resources and to maximize total reliability. The proposed model is more reliable than the traditional model due to the consideration of travel time reliability of rescue routes. Moreover, a two-stage algorithm is designed to solve this problem. A multi-path algorithm with bound constraints is used to obtain the set of feasible rescue routes in the first stage, and the NSGA-II algorithm is used to determine the scheduling of rescue resources for each rescue center. Finally, the two-stage algorithm is tested on a regional road network, and the results show that the designed two-stage algorithm is valid for solving the rescue resource scheduling problem of dangerous goods accidents and is able to obtain the rescue resource scheduling scheme in a short period of time. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

19 pages, 2620 KiB

Open AccessArticle

Feature Selection for High-Dimensional Datasets through a Novel Artificial Bee Colony Framework

by Yuanzi Zhang, Jing Wang, Xiaolin Li, Shiguo Huang and Xiuli Wang

Algorithms 2021, 14(11), 324; https://doi.org/10.3390/a14110324 - 4 Nov 2021

Cited by 4 | Viewed by 2488

Abstract

There are generally many redundant and irrelevant features in high-dimensional datasets, which leads to the decline of classification performance and the extension of execution time. To tackle this problem, feature selection techniques are used to screen out redundant and irrelevant features. The artificial [...] Read more.

There are generally many redundant and irrelevant features in high-dimensional datasets, which leads to the decline of classification performance and the extension of execution time. To tackle this problem, feature selection techniques are used to screen out redundant and irrelevant features. The artificial bee colony (ABC) algorithm is a popular meta-heuristic algorithm with high exploration and low exploitation capacities. To balance between both capacities of the ABC algorithm, a novel ABC framework is proposed in this paper. Specifically, the solutions are first updated by the process of employing bees to retain the original exploration ability, so that the algorithm can explore the solution space extensively. Then, the solutions are modified by the updating mechanism of an algorithm with strong exploitation ability in the onlooker bee phase. Finally, we remove the scout bee phase from the framework, which can not only reduce the exploration ability but also speed up the algorithm. In order to verify our idea, the operators of the grey wolf optimization (GWO) algorithm and whale optimization algorithm (WOA) are introduced into the framework to enhance the exploitation capability of onlooker bees, named BABCGWO and BABCWOA, respectively. It has been found that these two algorithms are superior to four state-of-the-art feature selection algorithms using 12 high-dimensional datasets, in terms of the classification error rate, size of feature subset and execution speed. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

18 pages, 2183 KiB

Open AccessArticle

Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

by BongJoo Jeong, Jun-Hee Han and Ju-Yong Lee

Algorithms 2021, 14(11), 323; https://doi.org/10.3390/a14110323 - 3 Nov 2021

Cited by 9 | Viewed by 2551

Abstract

This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to minimize a weighted sum of [...] Read more.

This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to minimize a weighted sum of total tardiness of urgent jobs and the makespan of normal jobs. This problem is formulated in mixed integer programming (MIP). By using a commercial optimization solver, the MIP can be used to find an optimal solution. However, because this problem is proved to be NP-hard, solving to optimality requires a significantly long computation time for a practical size problem. Therefore, this study adopts metaheuristic algorithms to obtain a good solution quickly. To complete this, two metaheuristic algorithms (an iterated greedy algorithm and a simulated annealing algorithm) are proposed, and a series of computational experiments were performed to examine the effectiveness and efficiency of the proposed algorithms. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

27 pages, 3528 KiB

Open AccessArticle

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

by Bonfim Amaro Junior, Marcio Costa Santos, Guilherme Nepomuceno de Carvalho, Luiz Jonatã Pires de Araújo and Placido Rogerio Pinheiro

Algorithms 2021, 14(11), 305; https://doi.org/10.3390/a14110305 - 23 Oct 2021

Cited by 5 | Viewed by 2815

Abstract

The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems. This study approached a category of C&P problems called the minimum time cut [...] Read more.

The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems. This study approached a category of C&P problems called the minimum time cut path (MTCP) problem, which aims to identify a sequence of cutting and sliding movements for the head device to minimize manufacturing time. Both cutting and slide speeds (just moving the head) vary according to equipment, despite their relevance in real-world scenarios. This study applied the MTCP problem on the practical scope and presents two metaheuristics for tackling more significant instances that resemble real-world requirements. The experiments presented in this study utilized parameter values from typical laser cutting machines to assess the feasibility of the proposed methods compared to existing commercial software. The results show that metaheuristic-based solutions are competitive when addressing practical problems, achieving increased performance regarding the processing time for 94% of the instances. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

19 pages, 2890 KiB

Open AccessArticle

Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems

by Ali Ahmid, Thien-My Dao and Ngan Van Le

Algorithms 2021, 14(10), 286; https://doi.org/10.3390/a14100286 - 29 Sep 2021

Cited by 2 | Viewed by 2078

Abstract

Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems. Those examples have a common feature of discrete design domain that turn [...] Read more.

Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems. Those examples have a common feature of discrete design domain that turn them into a set of NP-hard optimization problems. Determining the right optimization algorithm for such problems is a precious point that tends to impact the overall cost of the design process. Furthermore, reinforcing the performance of a prospective optimization algorithm reduces the design cost. In the current study, a comprehensive assessment criterion has been developed to assess the performance of meta-heuristic (MH) solutions in the domain of structural design. Thereafter, the proposed criterion was employed to compare five different variants of Ant Colony Optimization (ACO). It was done by using a well-known structural optimization problem of laminate Stacking Sequence Design (SSD). The initial results of the comparison study reveal that the Hyper-Cube Framework (HCF) ACO variant outperforms the others. Consequently, an investigation of further improvement led to introducing an enhanced version of HCFACO (or EHCFACO). Eventually, the performance assessment of the EHCFACO variant showed that the average practical reliability became more than twice that of the standard ACO, and the normalized price decreased more to hold at 28.92 instead of 51.17. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

17 pages, 1595 KiB

Open AccessArticle

Algorithms for Bidding Strategies in Local Energy Markets: Exhaustive Search through Parallel Computing and Metaheuristic Optimization

by Andrés Angulo, Diego Rodríguez, Wilmer Garzón, Diego F. Gómez, Ameena Al Sumaiti and Sergio Rivera

Algorithms 2021, 14(9), 269; https://doi.org/10.3390/a14090269 - 16 Sep 2021

Cited by 8 | Viewed by 3690

Abstract

The integration of different energy resources from traditional power systems presents new challenges for real-time implementation and operation. In the last decade, a way has been sought to optimize the operation of small microgrids (SMGs) that have a great variety of energy sources [...] Read more.

The integration of different energy resources from traditional power systems presents new challenges for real-time implementation and operation. In the last decade, a way has been sought to optimize the operation of small microgrids (SMGs) that have a great variety of energy sources (PV (photovoltaic) prosumers, Genset CHP (combined heat and power), etc.) with uncertainty in energy production that results in different market prices. For this reason, metaheuristic methods have been used to optimize the decision-making process for multiple players in local and external markets. Players in this network include nine agents: three consumers, three prosumers (consumers with PV capabilities), and three CHP generators. This article deploys metaheuristic algorithms with the objective of maximizing power market transactions and clearing price. Since metaheuristic optimization algorithms do not guarantee global optima, an exhaustive search is deployed to find global optima points. The exhaustive search algorithm is implemented using a parallel computing architecture to reach feasible results in a short amount of time. The global optimal result is used as an indicator to evaluate the performance of the different metaheuristic algorithms. The paper presents results, discussion, comparison, and recommendations regarding the proposed set of algorithms and performance tests. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

17 pages, 432 KiB

Open AccessArticle

Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation

by Dhananjay Thiruvady, Kerri Morgan, Susan Bedingfield and Asef Nazari

Algorithms 2021, 14(8), 219; https://doi.org/10.3390/a14080219 - 21 Jul 2021

Cited by 3 | Viewed by 3372

Abstract

The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more [...] Read more.

The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more engaged when they are allocated students that meet their industry requirements. In this paper, both an integer programming model and an ant colony optimisation heuristic are proposed, with the aim of automating the allocation of students to industry placements. The emphasis is on maximising student engagement and industry partner satisfaction. As part of the objectives, these methods incorporate diversity in industry sectors for students undertaking multiple placements, gender equity across placement providers, and the provision for partners to rank student selections. The experimental analysis is in two parts: (a) we investigate how the integer programming model performs against manual allocations and (b) the scalability of the IP model is examined. The results show that the IP model easily outperforms the previous manual allocations. Additionally, an artificial dataset is generated which has similar properties to the original data but also includes greater numbers of students and placements to test the scalability of the algorithms. The results show that integer programming is the best option for problem instances consisting of less than 3000 students. When the problem becomes larger, significantly increasing the time required for an IP solution, ant colony optimisation provides a useful alternative as it is always able to find good feasible solutions within short time-frames. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

Review

Jump to: Research

33 pages, 5524 KiB

Open AccessReview

Metaheuristics in the Humanitarian Supply Chain

by Francisca Santana Robles, Eva Selene Hernández-Gress, Neil Hernández-Gress and Rafael Granillo Macias

Algorithms 2021, 14(12), 364; https://doi.org/10.3390/a14120364 - 15 Dec 2021

Cited by 4 | Viewed by 3715

Abstract

Everyday there are more disasters that require Humanitarian Supply Chain (HSC) attention; generally these problems are difficult to solve in reasonable computational time and metaheuristics (MHs) are the indicated solution algorithms. To our knowledge, there has not been a review article on MHs [...] Read more.

Everyday there are more disasters that require Humanitarian Supply Chain (HSC) attention; generally these problems are difficult to solve in reasonable computational time and metaheuristics (MHs) are the indicated solution algorithms. To our knowledge, there has not been a review article on MHs applied to HSC. In this work, 78 articles were extracted from 2016 publications using systematic literature review methodology and were analyzed to answer two research questions: (1) How are the HSC problems that have been solved from Metaheuristics classified? (2) What is the gap found to accomplish future research in Metaheuristics in HSC? After classifying them into deterministic (52.56%) and non-deterministic (47.44%) problems; post-disaster (51.28%), pre-disaster (14.10%) and integrated (34.62%); facility location (41.03%), distribution (71.79%), inventory (11.54%) and mass evacuation (10.26%); single (46.15%) and multiple objective functions (53.85%), single (76.92%) and multiple (23.07%) period; and the type of Metaheuristic: Metaphor (71.79%) with genetic algorithms and particle swarm optimization as the most used; and non-metaphor based (28.20%), in which search algorithms are mostly used; it is concluded that, to consider the uncertainty of the real context, future research should be done in non-deterministic and multi-period problems that integrate pre- and post-disaster stages, that increasingly include problems such as inventory and mass evacuation and in which new multi-objective MHs are tested. Full article

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Metaheuristic Algorithms in Optimization and Applications 2021

Share This Special Issue

Special Issue Editors

Special Issue Information

Keywords

Benefits of Publishing in a Special Issue

Published Papers (8 papers)

Research

Review

Further Information

Guidelines

MDPI Initiatives

Follow MDPI