Journal: Journal of Heuristics

Found 350 papers in total
Cooperative strategies for solving the bicriteria sparse multiple knapsack problem
Cooperative strategies for solving the bicriteria sparse multiple knapsack problem
2002,
For hard optimization problems, it is difficult to design heuristic algorithms which...
An interactive method for 0–1 multiobjective problems using simulated annealing and tabu search
An interactive method for 0–1 multiobjective problems using simulated annealing and tabu search
2000,
This paper presents an interactive method for solving general 0–1 multiobjective...
Mathematical programming techniques in constraint programming: A short overview
Mathematical programming techniques in constraint programming: A short overview
2002,
In recent years, the integration of techniques from Artificial Intelligence and...
A simulated annealing approach to bicriteria scheduling problems on a single machine
A simulated annealing approach to bicriteria scheduling problems on a single machine
2000,
In this paper, we apply a simulated annealing approach to two bicriteria scheduling...
Bounds and tabu search for a cyclic max–min scheduling problem
Bounds and tabu search for a cyclic max–min scheduling problem
2001,
A cyclic scheduling problem with applications to transport efficiency is considered....
Scheduling tasks on unrelated machines: Large neighborhood improvement procedures
Scheduling tasks on unrelated machines: Large neighborhood improvement procedures
2001,
Two approximation algorithms are presented for minimizing the makespan of independent...
A constraint-based method for project scheduling with time windows
A constraint-based method for project scheduling with time windows
2002,
This paper presents a heuristic algorithm for solving RCPSP/max, the resource...
CHESS – changing horizon efficient set search: A simple principle for multiobjective optimization
CHESS – changing horizon efficient set search: A simple principle for multiobjective optimization
2000,
This paper presents a new concept for generating approximations to the non-dominated...
Use of substitute scalarizing functions to guide a local search based heuristic: The case of moTSP
Use of substitute scalarizing functions to guide a local search based heuristic: The case of moTSP
2000,
Solving the Tchebycheff program means optimizing a particular scalarizing function....
Subcost-guided search – experiments with timetabling problems
Subcost-guided search – experiments with timetabling problems
2001,
This paper reports on experiments with ‘subcost-guided’ heuristic search...
Greedy and local search heuristics for unconstrained binary quadratic programming
Greedy and local search heuristics for unconstrained binary quadratic programming
2002,
In this paper, a greedy heuristic and two local search algorithms, 1-opt local search...
An evolution program for non-linear transportation problems
An evolution program for non-linear transportation problems
2001,
In this paper we describe main features of a Strongly Feasible Evolution Program...
Solving vehicle routing problems using constraint programming and metaheuristics
Solving vehicle routing problems using constraint programming and metaheuristics
2000,
Constraint Programming typically uses the technique of depth-first branch and bound as...
A heuristic for the vehicle routing problem with time windows
A heuristic for the vehicle routing problem with time windows
2001,
In this paper we propose a heuristic algorithm to solve the Vehicle Routing Problem...
Using constraint-based operators to solve the vehicle routing problem with time windows
Using constraint-based operators to solve the vehicle routing problem with time windows
2002,
This paper presents operators searching large neighborhoods in order to solve the...
Parallelization of a two-phase metaheuristic for routing problems with time windows
Parallelization of a two-phase metaheuristic for routing problems with time windows
2002,
This paper describes the parallelization of a two-phase metaheuristic for the vehicle...
Multi colony ant algorithms
Multi colony ant algorithms
2002,
In multi colony ant algorithms several colonies of ants cooperate in finding good...
Designing least-cost survivable wireless backhaul networks
Designing least-cost survivable wireless backhaul networks
2000,
This paper presents a new heuristic algorithm for designing least-cost...
Effective heuristics for the global positioning system survey network of Malta: Simulated annealing and tabu search techniques
Effective heuristics for the global positioning system survey network of Malta: Simulated annealing and tabu search techniques
2001,
A GPS network can be defined as a set of stations, co-ordinated by a series of...
Cruise missile mission planning: A heuristic algorithm for automatic path generation
Cruise missile mission planning: A heuristic algorithm for automatic path generation
2001,
This manuscript presents a heuristic algorithm based on geometric concepts for the...
Spreadsheet implementable inventory control for a distribution center
Spreadsheet implementable inventory control for a distribution center
2001,
This paper develops and tests a simple procedure for establishing stocking rules for a...
Heuristic techniques for single line train scheduling
Heuristic techniques for single line train scheduling
1997,
Optimising a train schedule on a single line track is known to be NP-Hard with respect...
Case-based reasoning for repetitive combinatorial optimization problems, Part II: Numerical results
Case-based reasoning for repetitive combinatorial optimization problems, Part II: Numerical results
1997,
This paper presents numerical results from the application of a case-based reasoning...
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 a hybrid heuristic approach, which combines Genetic...
Papers per page: