Keyword: heuristics

Found 5460 papers in total
Rule of thumb heuristics for configuring storage racks in automated storage and retrieval systems design
Rule of thumb heuristics for configuring storage racks in automated storage and retrieval systems design
2001,
A well-known rule of thumb for evaluating storage rack configurations in automated...
Comparing descent heuristics and metaheuristics for the vehicle routing problem
Comparing descent heuristics and metaheuristics for the vehicle routing problem
2001,
Three improvement heuristics for the vehicle routing problem are considered: a descent...
Optimal prioritized channel allocation in cellular mobile systems
Optimal prioritized channel allocation in cellular mobile systems
2001,
Under the cutoff priority discipline, the optimal prioritized channel allocation...
Genetically derived approximations for determining the implied volatility
Genetically derived approximations for determining the implied volatility
1999,
In established option valuation models all parameters except for the volatility can be...
A due-window determination in minmax scheduling problems
A due-window determination in minmax scheduling problems
2001,
In several recent scheduling studies the notion of due-date is generalized: it is...
A heuristic scheduling system for ceramic industrial coatings
A heuristic scheduling system for ceramic industrial coatings
2000,
We developed and implemented a heuristic-based scheduling system for Ceramic...
Classical and modern heuristics for the vehicle routing problem
Classical and modern heuristics for the vehicle routing problem
2000,
This article is a survey of heuristics for the Vehicle Routing Problem. It is divided...
On the classification of NP-complete problems in terms of their correlation coefficient
On the classification of NP-complete problems in terms of their correlation coefficient
2000,
Local search and its variants simulated annealing and tabu search are very popular...
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
2000,
In this paper, we consider a network design problem arising in the context of...
A simplex-based tabu search method for capacitated network design
A simplex-based tabu search method for capacitated network design
2000,
The fixed charge capacitated multicommodity network design problem is a well-known...
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
2000,
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for...
An ant colony system hybridized with a new local search for the sequential ordering problem
An ant colony system hybridized with a new local search for the sequential ordering problem
2000,
We present a new local optimizer called SOP-3-exchange for the sequential ordering...
Statistical analysis of computational tests of algorithms and heuristics
Statistical analysis of computational tests of algorithms and heuristics
2000,
Statistical analysis is a powerful tool to apply when evaluating the performance of...
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
1999,
We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow...
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
1999,
Two-dimensional bin packing problems consist of allocating, without overlapping, a...
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
1999,
This article introduces two new techniques for solving the Quadratic Assignment...
Digital data networks design using genetic algorithms
Digital data networks design using genetic algorithms
2000,
Communication networks have witnessed significant growth in the last decade due to the...
Heuristical methods for the relaxed two-dimensional rectangle scheduling problem
Heuristical methods for the relaxed two-dimensional rectangle scheduling problem
1999,
We are dealing with a problem of one-resource-constrained scheduling: How can a number...
Generalized multifit-type methods for scheduling parallel identical machines
Generalized multifit-type methods for scheduling parallel identical machines
1999,
We investigate a very well known NP-complete problem of the scheduling-theory:...
Generalized multifit-type methods II
Generalized multifit-type methods II
2000,
We investigate a well known NP-complete problem of the scheduling theory: scheduling...
A new hybrid optimization algorithm
A new hybrid optimization algorithm
1999,
We develop a new optimization algorithm that combines the genetic algorithm and a...
A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function
A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function
2000,
In this paper we developed three meta-heuristics procedures: simulated annealing,...
An effective implementation of the Lin–Kernighan traveling salesman heuristic
An effective implementation of the Lin–Kernighan traveling salesman heuristic
2000,
This paper describes an implementation of the Lin–Kernighan heuristic, one of...
Genetic algorithm in uncertain environments for solving stochastic programming problem
Genetic algorithm in uncertain environments for solving stochastic programming problem
2000,
Many real problems with uncertainties may often be formulated as Stochastic...
Papers per page: