Keyword: heuristics

Found 5460 papers in total
Simultaneous design and training of ontogenic neural network classifiers
1996,
The use of neural networks in pattern classification is a relatively recent phenomena....
A hybrid neural approach to combinatorial optimization
1996,
Both the Hopfield neural network and Kohonen’s principles of self-organization...
Tabu Search for zero-one mixed integer programming with advanced level strategies and learning
1995,
The authors show how carefully designed Tabu Search mechanisms can work together...
The Traveling Salesman Problem with Backhauls
1996,
The purpose of this paper is to propose new heuristics for the Traveling Salesman...
Assembly line balancing with smoothed work station assignments
1995,
In this paper, a methodology for balancing assembly lines with smoothed work station...
An iterative heuristic for the single machine dynamic total completion time scheduling problem
1996,
The authors address the problem of scheduling a single machine to minimize the total...
Single machine scheduling to minimize the number of early and tardy jobs
1996,
The authors study single machine scheduling problems with the objective of minimizing...
A binary-rounding heuristic for multi-period variable-task-duration assignment problems
1996,
Multi-period assignment problems seek to allocate employees to tasks as required...
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
1996,
The authors consider a short-term production scheduling problem in a manufacturing...
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
1996,
The single machine scheduling (SMS) problem with sequence dependent setup costs and...
A user interactive heuristic procedure for solving the multiple product cycling problem
1996,
The paper considers a lot-sizing model for the manufacture and storage of several...
An improved petal heuristic for the vehicle routeing problem
1996,
Solutions produced by the first generation of heuristics for the vehicle routeing...
A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
1996,
Vehicle rotuing problems (VRPs) are known to be computationally intractable. The...
Composing batches with yield uncertainty
1993,
This paper presents a class of job design problems arising from the fabrication...
Obtaining minimum-correlation Latin Hypercube Sampling plans using an IP-based heuristic
1995,
The objective of Latin Hypercube Sampling is to determine an effective procedure for...
An heuristic algorithm to allocate shifts
1996,
The paper presents a heuristic algorithm for the optimal solution of a problem of...
Genetic algorithms and call admission to telecommunications networks
1996,
The authors consider the admission problem for the two class M/M/C/C queueing system....
A new simulated annealing algorithm for the facility layout problem
1996,
In this paper the authors present an application of simulated annealing to facility...
SUBDROP: A modified drop heuristic for location problems
1995,
A modification of the DROP heuristic is presented. This modification utilizes randomly...
Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
1996,
This paper examines the application of a genetic algorithm used in conjunction with a...
How to avoid stockouts when producing several items on a single facility? What to do if you can’t?
1996,
This paper considers the Multiple Product Single Facility Stockout Avoidance Problem...
Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach
1996,
This paper optimizes a well known NP-hard combinatorial problem-redundancy...
A simple heuristic to minimize makespan on parallel processors with unequal capacities
1995,
Jobs with fixed processing times must be assigned to m parallel processors to minimize...
On the complexity of manpower shift scheduling
1996,
The paper considers the shift assignment problem in manpower scheduling, and show that...
Papers per page: