Results 81 to 90 of about 57,703 (300)
Combinatorial optimization and metaheuristics [PDF]
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational ...
Consoli, S, Darby-Dowman, K
core
The proposed hybrid osprey‐salp swarm optimization algorithm addresses optimal power flow (OPF) problems in smart grids incorporating solar, hydro, and thermal generators. The algorithm is validated on Institute of Electrical and Electronics Engineers 30‐, 57‐, and 118‐bus test systems across five single and multiobjective OPF scenarios.
Mujtaba Ali +5 more
wiley +1 more source
Next Generation Metaheuristic: Jaguar Algorithm
Metaheuristic algorithms are implemented to solve optimization problems and have recently received significant research attention. Metaheuristic algorithms rely primarily on two properties, exploration, and exploitation.
Yao-Hsin Chou +3 more
doaj +1 more source
ABSTRACT This study develops an integrated simulation–optimization framework for sustainable crop allocation and water resource management in the Bargarh Canal Command (BCC), eastern India. Efficient irrigation allocation remains a critical challenge due to competing demands, groundwater–surface water interactions and environmental constraints ...
Priyanka Mohapatra +2 more
wiley +1 more source
Precision Restoration to Minimize Soil Loss in a Watershed in the Atlantic Forest Domain
ABSTRACT The Turvo River Watershed, located in the Zona da Mata region of Minas Gerais and part of the Doce River Basin, faces serious problems of erosion and soil degradation, which compromise and reduce the quality of local water resources. Given this scenario, it is essential to implement environmental recovery strategies that prioritize the ...
Rodrigo Nobre Santana +6 more
wiley +1 more source
Farmer Ants Optimization Algorithm: A Novel Metaheuristic for Solving Discrete Optimization Problems
Currently, certain complex issues are classified as NP-hard problems, for which there is no exact solution, or they cannot be solved in a reasonable amount of time. As a result, metaheuristic algorithms have been developed as an alternative.
Ali Asghari +4 more
doaj +1 more source
The dynamic traveling salesman problem (DTSP) falls under the category of combinatorial dynamic optimization problems. The DTSP is composed of a primary TSP sub-problem and a series of TSP iterations; each iteration is created by changing the previous ...
Petr Stodola +3 more
doaj +1 more source
Heuristics for the traveling repairman problem with profits [PDF]
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue.
Dewilde, Thijs +4 more
core +1 more source
A study on exponential-size neighborhoods for the bin packing problem with conflicts
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source
Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach
ABSTRACT Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting
Yishay Shapira, Mor Kaspi
wiley +1 more source

