Journal: Journal of Heuristics

Found 350 papers in total
An improved heuristic for the far from most strings problem
An improved heuristic for the far from most strings problem
2012,
The Far From Most Strings Problem (FFMSP) asks for a string that is far from as many...
The efficiency of indicator‐based local search for multi‐objective combinatorial optimisation problems
The efficiency of indicator‐based local search for multi‐objective combinatorial optimisation problems
2012,
In the last few years, a significant number of multi‐objective metaheuristics...
A facility neighborhood search heuristic for capacitated facility location with single‐source constraints and flexible demand
A facility neighborhood search heuristic for capacitated facility location with single‐source constraints and flexible demand
2012,
We consider a generalization of the well‐known capacitated facility location...
On dominance‐based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
On dominance‐based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
2012,
This paper discusses simple local search approaches for approximating the efficient...
A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem
A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem
1997,
In this paper we describe an hybrid heuristic approach, which combines Genetic...
A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems
A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems
1997,
We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling...
Metaheuristics for a Flexible Assembly System Design Problem
Metaheuristics for a Flexible Assembly System Design Problem
1997,
Flexibility has become an important priority in the formulation and implementation of...
General Purpose Heuristics for Integer Programming–Part II
General Purpose Heuristics for Integer Programming–Part II
1997,
In spite of the many special purpose heuristics for specific classes of integer...
Dynamic Hierarchical Packing of Wireless Switches Using a Seed, Repair and Replace Genetic Algorithm
Dynamic Hierarchical Packing of Wireless Switches Using a Seed, Repair and Replace Genetic Algorithm
1997,
Suppose that items of equipment are to be added to a supply station (e.g., new switch...
Combinatorial Optimization by Dynamic Contraction
Combinatorial Optimization by Dynamic Contraction
1997,
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an...
Performance‐Driven Layer Assignment by Integer Linear Programming and Path‐Constrained Hypergraph Partitioning
Performance‐Driven Layer Assignment by Integer Linear Programming and Path‐Constrained Hypergraph Partitioning
1997,
Performance‐driven physical layout design is becoming increasingly important...
Rollout Algorithms for Combinatorial Optimization
Rollout Algorithms for Combinatorial Optimization
1997,
We consider the approximate solution of discrete optimization problems using...
Matching based very large‐scale neighborhoods for parallel machine scheduling
Matching based very large‐scale neighborhoods for parallel machine scheduling
2011,
In this paper we study very large‐scale neighborhoods for the minimum total...
A tabu search algorithm for the covering design problem
A tabu search algorithm for the covering design problem
2011,
A ( v , k , t )‐covering design is a collection of k ‐subsets (called...
Using resource scarceness characteristics to solve the multi‐mode resource‐constrained project scheduling problem
Using resource scarceness characteristics to solve the multi‐mode resource‐constrained project scheduling problem
2011,
In the past decades, resource parameters have been introduced in project scheduling...
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
2011,
The orienteering problem (OP) consists in finding an elementary path over a subset of...
A biased random‐key genetic algorithm with forward‐backward improvement for the resource constrained project scheduling problem
A biased random‐key genetic algorithm with forward‐backward improvement for the resource constrained project scheduling problem
2011,
This paper presents a biased random‐key genetic algorithm for the resource...
Biased random‐key genetic algorithms for combinatorial optimization
Biased random‐key genetic algorithms for combinatorial optimization
2011,
Random‐key genetic algorithms were introduced by Bean (1994) for solving...
GRASP with path‐relinking for the generalized quadratic assignment problem
GRASP with path‐relinking for the generalized quadratic assignment problem
2011,
The generalized quadratic assignment problem (GQAP) is a generalization of the...
Optimal row and column ordering to improve table interpretation using estimation of distribution algorithms
Optimal row and column ordering to improve table interpretation using estimation of distribution algorithms
2011,
A common information representation task in research as well as educational and...
Generating highly balanced sudoku problems as hard problems
Generating highly balanced sudoku problems as hard problems
2011,
Sudoku problems are some of the most known and enjoyed pastimes, with a never...
An adaptive multi‐start graph partitioning algorithm for structuring cellular networks
An adaptive multi‐start graph partitioning algorithm for structuring cellular networks
2011,
In mobile network design, the problem of assigning network elements to controllers...
A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in R d
A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in R d
2011,
We present a heuristic for the Euclidean Steiner tree problem in ℜ d for d ≥2....
Optimal enough?
Optimal enough?
2011,
An alleged weakness of heuristic optimisation methods is the stochastic character of...
Papers per page: