Journal: Journal of Heuristics

Found 350 papers in total
Recovering beam search: enhancing the beam search approach for combinatorial optimization problems
Recovering beam search: enhancing the beam search approach for combinatorial optimization problems
2004,
A hybrid heuristic method for combinatorial optimization problems is proposed that...
A robust heuristic for batting order optimization under uncertainty
A robust heuristic for batting order optimization under uncertainty
2003,
Baseball teams are faced with a difficult scheduling problem every day: given a set of...
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs
2003,
This paper considers the problem of augmenting a given graph by a cheapest possible...
An incremental procedure for improving path assignment in a telecommunications network
An incremental procedure for improving path assignment in a telecommunications network
2003,
A fundamental problem in the design and management of a telecommunications network is...
A comparison of heuristics for the discrete cost multicommodity network optimization problem
A comparison of heuristics for the discrete cost multicommodity network optimization problem
2003,
In this paper, approximate solutions algorithms for discrete cost multicommodity...
A tabu search based approach for solving a class of bilevel programming problems in chemical engineering
A tabu search based approach for solving a class of bilevel programming problems in chemical engineering
2003,
In this paper an approach based on the tabu search paradigm to tackle the bilevel...
Analysis of a rollout approach to sequencing problems with stochastic routing applications
Analysis of a rollout approach to sequencing problems with stochastic routing applications
2003,
The paper considers sequencing problems, the traveling salesman problem being their...
A genetic algorithm with a compact solution encoding for the container ship stowage problem
A genetic algorithm with a compact solution encoding for the container ship stowage problem
2002,
The purpose of this study is to develop an efficient heuristic for solving the stowage...
Tutorial on surrogate constraint approaches for optimization in graphs
Tutorial on surrogate constraint approaches for optimization in graphs
2003,
Surrogate constraint methods have been embedded in a variety of mathematical...
On the hardness of the quadratic assignment problem with metaheuristics
On the hardness of the quadratic assignment problem with metaheuristics
2002,
Meta-heuristics are a powerful way to approximately solve hard combinatorial...
A taxonomy of hybrid metaheuristics
A taxonomy of hybrid metaheuristics
2002,
Hybrid metaheuristics have received considerable interest these recent years in the...
Complete local search with memory
Complete local search with memory
2002,
Neighborhood search heuristics like local search and its variants are some of the most...
Local search algorithms for the bin packing problem and their relationships to various construction heuristics
Local search algorithms for the bin packing problem and their relationships to various construction heuristics
2003,
The tradeoff between the speed and quality of the solutions obtained by various...
Tournament competition and its merits for coevolutionary algorithms
Tournament competition and its merits for coevolutionary algorithms
2003,
In a competitive coevolutionary algorithm, the competition strategy, selecting...
Guided local search for final placement in VLSI design
Guided local search for final placement in VLSI design
2003,
The design of a very large scale integration circuit consists of two main parts:...
Bounds and heuristics for the shortest capacitated paths problem
Bounds and heuristics for the shortest capacitated paths problem
2002,
Given a graph G , the Shortest Capacitated Paths Problem (SCPP) consists of...
Tabu Machine: a new neural network solution approach for combinatorial optimization problems
Tabu Machine: a new neural network solution approach for combinatorial optimization problems
2003,
A new artifical neural network solution approach is proposed to solve combinatorial...
Are branch and bound and A* algorithms identical?
Are branch and bound and A* algorithms identical?
2003,
Heuristic Search and Branch and Bound algorithms have many similarities. In this...
A heuristic for Boolean optimization problems
A heuristic for Boolean optimization problems
2003,
A heuristic method is proposed for the solution of a large class of binary...
Cooperative parallel tabu search for capacitated network design
Cooperative parallel tabu search for capacitated network design
2002,
We present a cooperative parallel tabu search method for the fixed charge,...
A ¾-approximation algorithm for multiple subset sum
A ¾-approximation algorithm for multiple subset sum
2003,
The Multiple Subset Sum Problem is the variant of bin packing in which the number of...
Heuristic methods for large centroid clustering problems
Heuristic methods for large centroid clustering problems
2003,
This article presents new heuristic methods for solving a class of hard centroid...
Self-adaptive genetic algorithm for clustering
Self-adaptive genetic algorithm for clustering
2003,
Clustering is a hard combinatorial problem which has many applications in science and...
On using tabu search for design automation of very large scale integrated systems
On using tabu search for design automation of very large scale integrated systems
2003,
Tabu search is a meta-heuristic problem solving technique that, when applied...
Papers per page: