Results 31 to 40 of about 34,025 (156)

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics [PDF]

Combinatorics, Probability and Computing, 2005
Randomized search heuristics like evolutionary algorithms and simulated annealing find many applications, especially in situations where no full information on the problem instance is available. In order to understand how these heuristics work, it is necessary to analyse their behaviour on classes of functions.
Wegener, Ingo, Witt, Carsten
openaire   +1 more source

Joint Interference and Power Minimization for Fault-Tolerant Topology in Sensor Networks

IEEE Access
Energy conservation is crucial in wireless ad hoc sensor network design to increase network lifetime. Since communication consumes a major part of the energy used by a sensor node, efficient communication is important.
Renato E. N. de Moraes, Yngrith S. Silva, Felipe N. Martins, Jair A. L. Silva, Helder R. O. Rocha   +4 more
doaj   +1 more source

A Hybrid Meta-Heuristic Approach for Solving Single-Vessel Quay Crane Scheduling with Double-Cycling

Journal of Marine Science and Engineering
The escalating global demand for containerized cargo has intensified pressure on container terminals, which serve as vital nodes in maritime logistics.
Fahrettin Eldemir, Mustafa Egemen Taner
doaj   +1 more source

Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem [PDF]

, 2007
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Consoli, S, Darby-Dowman, K, Mladenović, N, Moreno-Pérez, JA   +3 more
core  

An Iterative Optimization Algorithm for Planning Spacecraft Pathways Through Asteroids

Applied Sciences
In this article, we explore the use of meta-heuristic algorithms for costly black-box permutation optimization problems. These combinatorial problems are defined by solution spaces that consist of permutations of elements, with an objective function that
Valentino Santucci
doaj   +1 more source

Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search

, 2020
Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations.
Barfoot, Timothy D., Gammell, Jonathan D., Srinivasa, Siddhartha S.   +2 more
core   +1 more source

Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem

U.Porto Journal of Engineering
A basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains.
Lourenço Sousa de Pinho
doaj   +1 more source

On the influence of pheromone updates in ACO algorithms [PDF]

, 2007
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply particularly to classical search heuristics such as Evolutionary Algorithms ...
Doerr, Benjamin, Neumann, Frank, Sudholt, Dirk, Witt, Carsten   +3 more
core  

GRASP‐based request allocation and MDP‐based vehicle routing in home pick‐up service with service continuity consideration

IET Intelligent Transport Systems
Service continuity (SC) plays an important role in service industry. In this paper, a daily home parcel pick‐up scheduling and routing problem is studied with SC consideration.
Yu WU, Xiaoping Qiu
doaj   +1 more source

Towards a Theory of Randomized Search Heuristics [PDF]

, 2003
There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP≠P or NP≠RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain.
openaire   +1 more source