Keyword: heuristics

Found 5460 papers in total
An optimization model for the container pre-marshalling problem
An optimization model for the container pre-marshalling problem
2007,
In most container yards around the world, containers are stacked high to utilize yard...
An interactive heuristic for generation of paths in graphs with restriction of grades: application to the design of railway systems
An interactive heuristic for generation of paths in graphs with restriction of grades: application to the design of railway systems
2002,
The work discusses the design of a metro network through a graph-theoretical model...
Reductions, completeness and the hardness of approximability
Reductions, completeness and the hardness of approximability
2006,
In computability and in complexity theory reductions are widely used for mapping sets...
A factor ½ approximation algorithm for two-stage stochastic matching problems
A factor ½ approximation algorithm for two-stage stochastic matching problems
2006,
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate...
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
2007,
Given a centralized undirected graph with costs associated with its edges, the...
A new method, the fusion fission, for the relaxed k-way graph partitioning problem, and comparisons with some multilevel algorithms
A new method, the fusion fission, for the relaxed k-way graph partitioning problem, and comparisons with some multilevel algorithms
2007,
In this paper a new graph partitioning problem is introduced, the relaxed k-way graph...
An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
2007,
The generalized assignment problem with special ordered sets (GAPS2), is the problem...
Pivot, Cut, and Dive: a heuristic for 0–1 mixed integer programming
Pivot, Cut, and Dive: a heuristic for 0–1 mixed integer programming
2007,
This paper describes a heuristic for 0–1 mixed-integer linear programming...
Bound sets for biobjective combinatorial optimization problems
Bound sets for biobjective combinatorial optimization problems
2007,
In this paper we introduce the concept of bound sets for multiobjective discrete...
A hybrid scatter search for the probabilistic traveling salesman problem
A hybrid scatter search for the probabilistic traveling salesman problem
2007,
The probabilistic traveling salesman problem (PTSP) is an important theoretical and...
A heuristic approach for the continuous error localization problem in data cleaning
A heuristic approach for the continuous error localization problem in data cleaning
2007,
The Error Localization Problem concerns finding the minimum number of fields in a...
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
2006,
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer...
Efficient scheduling of periodic information monitoring requests
Efficient scheduling of periodic information monitoring requests
2006,
In many mission-critical applications such as police and homeland security-related...
Two-way eyeballing heuristics in dynamic lot sizing with backlogging
Two-way eyeballing heuristics in dynamic lot sizing with backlogging
1990,
A simple class of heuristic algorithms for discrete dynamic lot size problems with...
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
2006,
This paper addresses the capacitated lot-sizing problem involving the production of...
A capacitated facility location problem with constrained backlogging probabilities
A capacitated facility location problem with constrained backlogging probabilities
2007,
One of the assumptions of the capacitated facility location problem (CFLP) is that...
Considering scheduling and preventive maintenance in the flowshop sequencing problem
Considering scheduling and preventive maintenance in the flowshop sequencing problem
2007,
The aim of this paper is to propose tools in order to implicitly consider different...
Heuristic stability: A permutation disarray measure
Heuristic stability: A permutation disarray measure
2007,
Heuristic performance has been mainly measured by effectiveness (near optimality) and...
A reactive GRASP and path relinking for a combined production–distribution problem
A reactive GRASP and path relinking for a combined production–distribution problem
2007,
An NP-hard production–distribution problem for one product over a multi-period...
A note on ‘An Approximate Solution to Deterministic Systems’
A note on ‘An Approximate Solution to Deterministic Systems’
1996,
In a recent paper, Moeeni and Chang presented an efficient heuristic solution method...
A note on ‘An Approximate Solution to Deterministic Kanban Systems’: A commentary and further insights
A note on ‘An Approximate Solution to Deterministic Kanban Systems’: A commentary and further insights
1996,
In a recent paper, Vemuganti, Batta, and Zhu stated that the linear programming model...
The joint replenishment problem with resource restriction
The joint replenishment problem with resource restriction
2006,
There are many resource restrictions in real production/inventory systems (for...
Simple heuristics for push and pull remanufacturing policies
Simple heuristics for push and pull remanufacturing policies
2006,
Inventory policies for joint remanufacturing and manufacturing have recently received...
Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands
Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands
2006,
We study a production planning problem based on hard-disk drive assembly, where the...
Papers per page: