Results 41 to 50 of about 3,716,603 (121)
Optimised search heuristic combining valid inequalities and tabu search [PDF]
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the ...
Helena Ramalhinho-Lourenço +1 more
core
Runtime analysis of randomized search heuristics for dynamic graph coloring [PDF]
, 2019 We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph.
Jakob Bossek +7 more
core +1 more source
Complete local search with memory [PDF]
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we
Sierksma, G., Ghosh, D.
core
Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem [PDF]
, 2008 One of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points at which to place the items inside the bins, because the performance of exact and heuristic solution methods is actually
CRAINIC T. G +3 more
core +1 more source
Vacancy referrals, job search and the duration of unemployment: a randomized experiment [PDF]
One goal of the public employment service is to facilitate matching between unemployed job seekers and job vacancies; another goal is to monitor job search so as to bring search efforts among the unemployed in line with search requirements.
Holmlund, Bertil +2 more
core +2 more sources
Local search heuristics for multi-index assignment problems with decomposable costs. [PDF]
The multi-index assignment problem (MIAP) with decomposable costs is a natural generalization of the well-known assignment problem. Applications of the MIAP arise for instance in the field of multi-target multi-sensor tracking.
Bandelt, H, Maas, A, Spieksma, Frederik
core
Solving the flight perturbation problem with meta heuristics
, 2006 When there is a perturbation in a carefully constructed aircraft schedule, e.g. an aircraft breakdown, it is important to minimize the negative consequences of this disturbance.
Andersson Granberg, Tobias +1 more
core +1 more source
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
, 2003 Randomized search heuristics like local search, tabu search, simulated annealing or all kinds of evolutionary algorithms have many applications. However, for most problems the best worst-case expected run times are achieved by more problem-specific ...
Ingo Wegener +2 more
core
Consumer choice in competitive location models: Formulations and heuristics [PDF]
A new direction of research in Competitive Location theory incorporates theories of Consumer Choice Behavior in its models. Following this direction, this paper studies the importance of consumer behavior with respect to distance or transportation costs ...
Rosa Colomé, Daniel Serra
core
Hybrid Meta-Heuristics for Robust Scheduling [PDF]
The production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in ...
Dekker, R. +3 more
core