Automatic grouping (clustering) involves dividing a set of objects into subsets (groups) so that the objects from one subset are more similar to each other than to the objects from other subsets according to some criterion. Kohonen neural networks ar...
The traveling salesman problem (TSP) is one of the typical NP–Hard problems of combinatorial optimization area. This paper proposes a new hyper heuristic algorithm named Parametric Hybrid Method (PHM) based on The Farthest Vertex (FV) and Greedy heur...
To improve energy efficiency and maintain the stability of the power grid, time-of-use (TOU) electricity tariffs have been widely used around the world, which bring both opportunities and challenges to the energy-efficient scheduling problems. Single...
This paper presents a performance comparison of greedy heuristics for a recent variant of the dominating set problem known as the minimum positive influence dominating set (MPIDS) problem. This APX-hard combinatorial optimization problem has applicat...
In the Industrial Internet, computing- and power-limited mobile devices (MDs) in the production process can hardly support the computation-intensive or time-sensitive applications. As a new computing paradigm, mobile edge computing (MEC) can almost m...
Owing to the different quantities and processing times of sub-lots, intermingling sub-lots with each other, instead of fixing the production sequence of sub-lots of a lot as in the existing studies, is a more practical approach to lot-streaming flow...
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for
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 met...
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search t...
As an important direction of topology management and infrastructure construction in Internet of Vehicles (IoV), the problem of roadside unit deployment has been discussed a lot. Considering the problem of communication occlusion caused by mobile vehi...
To achieve the principles of reduction, resource, and harmless disposal of domestic waste, the circular economy prolongs the life cycle of resources by converting waste into renewable resources through sorting, recycling, and other ways. There are st...
Device-to-device (D2D) communications can be adopted as a promising solution to attain high quality of service (QoS) for a network. However, D2D communications generates harmful interference when available resources are shared with traditional cellul...
Recently, a massive migration of enterprise applications to the cloud has been recorded in the IT world. One of the challenges of cloud computing is Quality-of-Service management, which includes the adoption of appropriate methods for allocating clou...
One of the main drawbacks of the traditional methods for computing components in the three-way Tucker model is the complex structure of the final loading matrices preventing an easy interpretation of the obtained results. In this paper, we propose a...
In on-grid microgrids, electric vehicles (EVs) have to be efficiently scheduled for cost-effective electricity consumption and network operation. The stochastic nature of the involved parameters along with their large number and correlations make suc...
Truck platooning has recently become an essential issue in automatic driving. Though truck platooning can increase safety and reduce fuel consumption and carbon emissions, the practical vehicle routing problem involved in truck platooning has not bee...
Cognitive radio (CR), which is a common form of wireless communication, consists of a transceiver that is intelligently capable of detecting which communication channels are available to use and which are not. After this detection process, the transc...
In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating t...
Task allocation is an essential element for determining the capability of multi-UAV systems to perform various tasks. This paper presents a procedure called a “rebalancing algorithm” for generating task-performing routes in heterogeneous...
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper propos...
The study of influence maximizing in temporal social networks (IMT) is an important aspect of influence maximization (IM) research. Currently, two main types of algorithms can solve the IMT problem: greedy-based algorithms and heuristic-based algorit...
Allocation models are essential tools for optimally distributing client requests across multiple services under defined restrictions and objective functions. This study evaluates several heuristics to address an allocation problem involving young ind...
Over the past few decades, there has been a significant increase in the number of Earth observation satellites, and the area of ground targets requiring observation has also been expanding. To effectively utilize the capabilities of these satellites...
Remote sensing with unmanned aerial vehicles (UAVs) facilitates photogrammetry for environmental and infrastructural monitoring. Models are created with less computational cost by reducing the number of photos required. Optimal camera locations for r...
Bin Packing is one of the research areas of Operations Research with many industrial applications, as well as rich theoretical impact. In this article, the authors deal with Bin Packing on the practical side: they consider two Bin Packing Benchmark c...
For this study, we investigated efficient strategies for the recovery of individual links in power grids governed by the direct current (DC) power flow model, under random link failures. Our primary objective was to explore the efficacy of recovering...
In recent years, a large and growing body of literature has addressed the energy-efficient resource management problem in data centers. Due to the fact that cooling costs still remain the major portion of the total data center energy cost, thermal-aw...
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...
As the logistics industry modernizes, living standards improve, and consumption patterns shift, the demand for fresh food continues to grow, making cold chain logistics for perishable goods a critical component in ensuring food quality and safety. Ho...
Partitioning rectangular and rectilinear shapes in n-dimensional binary images into the smallest set of axis-aligned n-cuboids is a fundamental problem in image analysis, pattern recognition, and computational geometry, with applications in object de...
This study introduces a novel heuristic approach to optimize mineral processing in metallurgical plants, framed as a variant of the fractional knapsack problem. The optimization framework integrates plant operational modes, blending requirements, and...
Distributed permutation flowshop scheduling is an NP-hard problem that has become a hot research topic in the fields of optimization and manufacturing in recent years. Multimodal optimization finds multiple global and local optimal solutions of a fun...
The privacy and security of the Internet of Things (IoT) are emerging as popular issues in the IoT. At present, there exist several pieces of research on network analysis on the IoT network, and malicious network analysis may threaten the privacy and...
To address the conflict between real-time performance and optimal resource allocation in large-scale digital array radars, this paper proposes a novel resource scheduling framework that integrates graph-theoretic modeling with an adaptive heuristic s...
This paper addresses the taxi fleet dispatch problem, which is critical for many transport service platforms such as Uber, Lyft, and Didi Chuxing. We focus on maximizing the revenue and profit a taxi platform can generate through the dispatch approac...
In this paper, we consider the reconfiguration of wireless backhaul networks with mechanically steerable antennas in the presence of changing traffic demands. Reconfiguration requires the scheduling and coordination of several operations, including a...
A rescheduling algorithm for trains on a single-track railway was developed in case of disturbances that would cause conflicts between trains. This algorithm is based on mixed integer linear programming (MILP) with speed-up routines. The model consid...
This study investigates a two-stage assembly-type flow shop with limited waiting time constraints for minimizing the makespan. The first stage consists of m machines fabricating m types of components, whereas the second stage has a single machine to...
The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and inte...
Network caching is a technique used to speed-up user access to frequently requested contents in complex data networks. This paper presents a two-layer overlay network caching system for content distribution. It is used to define some caching scenario...
The escalating global demand for containerized cargo has intensified pressure on container terminals, which serve as vital nodes in maritime logistics. This study aims to enhance operational efficiency in non-automated container terminals by examinin...
In the everchanging landscape of human mobility and commerce, efficient route planning has become paramount. This paper addresses the open vehicle routing problem (OVRP), a major logistical challenge in route optimization for a fleet of vehicles serv...
As a promising tool for monitoring the physical world, directional sensor networks (DSNs) consisting of a large number of directional sensors are attracting increasing attention. As directional sensors in DSNs have limited battery power and restricte...
In this paper, an improved Beluga Whale Optimization algorithm based on data mining and scheduling rules with AdaBoost(IBWO-DDR-AdaBoost) rule heuristic scheduling method for solving job-shop scheduling problems (JSP) is proposed, in which data minin...
An innovative trajectory strategy was proposed and accessed for wire arc additive manufacturing (WAAM), applicable to different and more complex geometries, rather than being a single solution. This strategy, named Pixel, can be defined as a complex...
In agriculture, the soil properties influence the productivity and quality of crops. The farmer expects that in a specific area of the land, the physicochemical characteristics of the soil will be homogeneous as the selected crop has the desired qual...
In photolithographic processes, nanometer-level-precision wavefront-aberration models enable the machine to be able to meet the overlay (OVL) drift and critical dimension (CD) specifications. Software control algorithms take as input these models and...
The Knapsack Problem belongs to the best-studied classical problems in combinatorial optimization. The Multiple-choice Knapsack Problem (MCKP) represents a generalization of the problem, with various application fields such as industry, transportatio...
Given the environmental impacts produced by the growing increase in waste electrical and electronic equipment (WEEE) and their current inadequate management, this article proposes a mathematical model to define the best location for installing WEEE c...
We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwardin...
of 4