5,004 Results Found

The Set Coverage Problem (SCP) is an important combinatorial optimization problem known to be NP-complete. The use of metaheuristics to solve the SCP includes different algorithms. In particular, binarization techniques have been explored to adapt me...

Metaheuristics have proven to be effective in solving large-scale combinatorial problems by combining global exploration with local exploitation, all within a reasonably short time. The balance between these phases is crucial to avoid slow or prematu...

In recent years, metaheuristic methods have shown remarkable efficacy in resolving complex combinatorial challenges across a broad spectrum of fields. Nevertheless, the escalating complexity of these problems necessitates the continuous development o...

In this paper, we study the optimality conditions for set optimization problems with set criterion. Firstly, we establish a few important properties of the Minkowski difference for sets. Then, we introduce the generalized second-order lower radial ep...

In this paper, the Fischer–Burmeister active-set trust-region (FBACTR) algorithm is introduced to solve the nonlinear bilevel programming problems. In FBACTR algorithm, a Karush–Kuhn–Tucker (KKT) condition is used with the Fischer&n...

In this paper we investigate the optimal control problem for set-valued quasivariational inequality with unilateral constraints. Under suitable conditions, we prove that the solution to the current optimal control problem converges to a solution to o...

In this paper, by using the normal subdifferential and equilibrium-like function we first obtain some properties for K-preinvex set-valued maps. Secondly, in terms of this equilibrium-like function, we establish some sufficient conditions for the exi...

In this paper, we deal with the properties and applications of a nonlinear scalarization function for sets by using the Minkowski difference. Under some suitable assumptions, the continuity and convexity concerned with the nonlinear scalarization fun...

In this paper, we introduce the notion of higher-order weak adjacent epiderivative for a set-valued map without lower-order approximating directions and obtain existence theorem and some properties of the epiderivative. Then by virtue of the epideriv...

This study focuses on the formulation and analysis of problems that are dual to those defined by convex set-valued mappings. Various important classes of optimization problems—such as the classical problems of mathematical and linear programmin...

In this paper, we introduce a second-order strong subdifferential of set-valued maps, and discuss some properties, such as convexity, sum rule and so on. By the new subdifferential and its properties, we establish a necessary and sufficient optimalit...

The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem...

The Maximum Independent Set Problem is a classic graph optimization NPhard problem. Given a graph G=(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. In this paper,...

The offshore plant, due to its characteristics, is subject to many restrictions on the material and design of the pipes. Because the design of the firefighting piping depends on the pre-set fire protection design, it is possible to reduce the cost of...

This paper is devoted to the analysis of mathematical models of chemotherapy for malignant tumors growing according to the Gompertz law or the generalized logistic law. The influence of the therapeutic agent on the tumor dynamics is determined by a t...

In this work, an approach is proposed to solve binary combinatorial problems using continuous metaheuristics. It focuses on the importance of binarization in the optimization process, as it can have a significant impact on the performance of the algo...

This paper deals with p-location problem solving processes based on a decomposition, which separates the creation of a uniformly deployed set of p-location problems from the solution of the p-location problem for that specific instance. The research...

Improved street lighting can provide better use of public space and helps to promote safety while driving or walking. In terms of balancing benefits and impacts, on the basis of cost saving, this research adopts two prominent mathematical models, the...

Ant colony optimization is a metaheuristic that is mainly used for solving hard combinatorial optimization problems. The distinctive feature of ant colony optimization is a learning mechanism that is based on learning from positive examples. This is...

The paper presents research on a specific approach to the issue of computed tomography with an incomplete data set. The case of incomplete information is quite common, for example when examining objects of large size or difficult to access. Algorithm...

Optimal control is a critical tool for mechanical robotic systems, facilitating the precise manipulation of dynamic processes. These processes are described through differential equations governed by a control function, addressing a time-optimal prob...

Aiming at the problems of low resource utilization and high distribution cost of urban logistics enterprises, this paper introduces the threshold setting of large parcels, comprehensively considers the processing links of large parcels and standard p...

This research presents a novel hybrid approach, which combines the White Shark Optimizer (WSO) metaheuristic algorithm with chaotic maps integrated into the binarization process. Inspired by the predatory behavior of white sharks, WSO has shown great...

This work is focused on the performance analysis and optimal routing of wireless technology for intelligent energy metering, considering the inclusion of micro grids. For the study, a geo-referenced scenario has been taken into account, which will fo...

In recent years, remote sensing data have gradually shown a trend towards big data. The cost of the efficient storage, transmission, and processing of multi-source massive remote sensing data is very high. In practical applications, it is usually nec...

In this paper, a comparison of stochastic optimization algorithms is presented for the reconstruction of electromagnetic profiles in through-the-wall radar imaging. We combine those stochastic optimization approaches with a shape-based representation...

The flexible job shop scheduling problem (FJSP) is an extension of the classical job shop scheduling problem and one of the more well-known NP-hard problems. To get better global optima of the FJSP, a novel hybrid whale optimization algorithm (HWOA)...

This work focuses on solving and analyzing two-point fuzzy boundary value problems in the form of fractional ordinary differential equations (FFOBVPs) using a new version of the approximation analytical approach. FFOBVPs are useful in describing comp...

The transportation network design and frequency setting problem concerns the optimization of transportation systems comprising fleets of vehicles serving a set amount of passengers on a predetermined network (e.g., public transport systems). It has b...

Aiming at the problem that the Osprey Optimization Algorithm (OOA) does not have high optimization accuracy and is prone to falling into local optimum, an Improved Osprey Optimization Algorithm Based on a Two-Color Complementary Mechanism for Global...

This study explores a foundational logistics center location and allocation problem in a three-stage logistics network that consists of suppliers, logistics centers, and customers. In this study, the environmental sustainability of the logistics netw...

The satisfaction of requirements and preferences of shippers is critical to enable the practicability of solutions that are derived from intermodal transportation routing problems. This study aims to propose a decision process to help shippers partic...

In Japan, natural disasters occur frequently. Serious disasters may cause damage to traffic networks and telecommunication infrastructures, leading to the occurrence of isolated disaster areas. In this article, unmanned aerial vehicles (UAVs) are use...

Elaborated in several forms before being formally defined, virtually coupled train sets (VCTS) have become an issue for capacity increase with obvious shorter train intervals. As the station organization strategy is still ambiguous due to the lack of...

The connectedness and path connectedness of the solution sets to vector optimization problems is an important and interesting study in optimization theories and applications. Most papers involving the direction established the connectedness and conne...

The Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe. This study introduces a binary White Shark Optimizer (WSO) enhanced with V3 transf...

In this article, we introduce a novel averaged-type iterative scheme designed for solving convex minimization problems over the set of common fixed points of a pair of demicontractive mappings. Under suitable assumptions, we prove that the proposed a...

This paper investigates some duality results of a mixed type for a class of multiple objective fractional optimal control problems. More precisely, by considering the Wolfe- and Mond–Weir-type dualities, we formulate a robust mixed-type dual pr...

With the surging complexity of real-world problems in important domains such as sustainability, there is a need to leverage advanced modern computational methods or intelligent techniques to support decisions or policy-making. In this Special Issue,...

In this study, a typical transportation problem involving intuitionistic fuzzy-type variables and parameters is focused on. The approaches proposed in the literature for such transportation problems have many shortcomings, such as the use of ranking...

This study formulates a multi-objective, multi-item solid transportation issue with parameters that are neutrosophic Z-number fuzzy variables such as transportation costs, supplies, and demands. This work covers two scenarios where uncertainty in the...

This research aims to explain the intrinsic difficulty of Karp’s list of twenty-one problems through the use of empirical complexity measures based on the ellipsoidal width of the polyhedron generated by the constraints of the relaxed linear pr...

An investigation is conducted in this paper into a performance analysis of fully intuitionistic fuzzy multi-objective multi-item solid fractional transport model (FIF-MMSFTM). It is to be anticipated that the parameters of the conveyance model will b...

In this paper, we study the knapsack problem with conflict pair constraints. After a thorough literature survey on the topic, our study focuses on the special case of bipartite conflict graphs. For complete bipartite (multipartite) conflict graphs, t...

There are many problems based on solving nonautonomous differential equations of the form $\ddot{x}\left(t\right)+{\omega }^2\left(t\right)x\left(t\right)=0,$ where $x\left(t\right)$ represents the coordinate of a material point and $\omega$ is the angular frequency. The inverse problem involves finding...

Multi-sensor fusion for unmanned surface vehicles (USVs) is an important issue for autonomous navigation of USVs. In this paper, an improved particle swarm optimization (PSO) is proposed for real-time autonomous navigation of a USV in real maritime e...

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...

Inspired by the mechanism of generation and restriction among five elements in Chinese traditional culture, we present a novel Multi-Objective Five-Elements Cycle Optimization algorithm (MOFECO). During the optimization process of MOFECO, we use indi...

The need to optimize the deployment and maintenance costs for service delivery in wireless networks is an essential task for each service provider. The goal of this paper was to optimize the number of service centres (gNodeB) to cover selected custom...

The article presents research on the application of computed tomography with an incomplete dataset to the problem of examining the internal structure of walls. The case of incomplete information in computed tomography often occurs in various applicat...