Journal: Journal of Heuristics

Found 350 papers in total
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints
1995,
This paper presents parallelization strategies for a tabu search algorithm for the...
Case-based reasoning for repetitive combinatorial optimization problems, Part I: Framework
Case-based reasoning for repetitive combinatorial optimization problems, Part I: Framework
1996,
This article presents a case-based reasoning approach for the development of learning...
Heuristics for distribution network design in telecommunication
Heuristics for distribution network design in telecommunication
2000,
A distribution network problem arises in a lower level of a hierarchical modelling...
Linear programming-based heuristic algorithms for interconnecting token rings via source routing bridges
Linear programming-based heuristic algorithms for interconnecting token rings via source routing bridges
2000,
We develop a method to determine the topology of a network that interconnects a number...
On minimum congestion routing in rearrangeable multihop lightwave networks
On minimum congestion routing in rearrangeable multihop lightwave networks
1995,
In this article we consider the problem of minimizing the congestion in logically...
Reducing costs of backhaul networks for personal communications services networks using genetic algorithms
Reducing costs of backhaul networks for personal communications services networks using genetic algorithms
1996,
Designing cost-effective telecommunications networks often involves solving several...
Design of stacked self-healing rings using a genetic algorithm
Design of stacked self-healing rings using a genetic algorithm
2000,
Ring structures in telecommunications are taking on increasing importance because of...
A scatter-search-based learning algorithm for neural network training
A scatter-search-based learning algorithm for neural network training
1996,
In this article, we propose a new scatter-search-based learning algorithm to train...
Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
1995,
The convergence of the simulated annealing algorithm is accelerated by a probabilistic...
Applying simulated annealing to location-planning models
Applying simulated annealing to location-planning models
1996,
Simulated annealing is a computational approach that simulates an annealing schedule...
A simple dual algorithm for the generalised assignment problem
A simple dual algorithm for the generalised assignment problem
1996,
A new algorithm for the generalised assignment problem is described in this paper. The...
Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming
Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming
1996,
Many problems faced by decision makers are characterized by a multistage decision...
The 0–1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
The 0–1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
1996,
Efficient codes exist for exactly solving the 0–1 knapsack problem, which is a...
Piece-wise linear approximation of functions of two variables
Piece-wise linear approximation of functions of two variables
1996,
The goal of increasing computational efficiency is one of the fundamental challenges...
General purpose heuristics for integer programming – Part I
General purpose heuristics for integer programming – Part I
1996,
In spite of the many special purpose heuristics for specific classes of integer...
A hybrid genetic algorithm for the single machine scheduling problem
A hybrid genetic algorithm for the single machine scheduling problem
1999,
A hybrid genetic algorithm (HGA) is proposed for the single machine, single stage,...
Probabilistic diversification and intensification in local search for vehicle routing
Probabilistic diversification and intensification in local search for vehicle routing
1995,
This article presents a probabilistic technique to diversify, intensify, and...
Automatic Yellow-Pages pagination and layout
Automatic Yellow-Pages pagination and layout
1996,
The compact and harmonious layout of ads and text is a fundamental and costly step in...
A heuristic methodology for sizing a large-scale system of constrained, reusable resources
A heuristic methodology for sizing a large-scale system of constrained, reusable resources
1996,
This paper proposes a methodology for sizing certain large-scale systems of reusable,...
A hierarchical strategy for solving traveling salesman problems using elastic nets
A hierarchical strategy for solving traveling salesman problems using elastic nets
1995,
In this article, we focus on implementing the elastic net method to solve the...
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
1996,
A special class of 4-opt moves plays a key role in several leading heuristics for the...
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
1996,
The clustered traveling salesman problem is an extension of the classical traveling...
Detecting and preventing routing problems in the planning process of Common Channel Signalling System #7 networks
Detecting and preventing routing problems in the planning process of Common Channel Signalling System #7 networks
2000,
Common Channel Signalling System #7 (CCSS#7) has become nowadays widely used...
Solving a real world assignment problem with a metaheuristic
Solving a real world assignment problem with a metaheuristic
1998,
This paper investigates a real world assignment problem, which slightly differs from...
Papers per page: