Keyword: heuristics

Found 5460 papers in total
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
2011,
We introduce a new assignment and scheduling problem in a distribution system, which...
A skyline heuristic for the 2D rectangular packing and strip packing problems
A skyline heuristic for the 2D rectangular packing and strip packing problems
2011,
In this paper, we propose a greedy heuristic for the 2D rectangular packing problem...
Optimal row and column ordering to improve table interpretation using estimation of distribution algorithms
Optimal row and column ordering to improve table interpretation using estimation of distribution algorithms
2011,
A common information representation task in research as well as educational and...
Branch and Price for Service Network Design with Asset Management Constraints
Branch and Price for Service Network Design with Asset Management Constraints
2011,
We address the service network design problem with asset management considerations for...
Optimal Allocation of Protective Resources in Shortest‐Path Networks
Optimal Allocation of Protective Resources in Shortest‐Path Networks
2011,
This article introduces a game‐theoretic approach for allocating protection...
Two heuristics to the share‐of‐choice product line design problem
Two heuristics to the share‐of‐choice product line design problem
2011,
Two heuristics are proposed in this paper to solve the problem of constructing an...
A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
2011,
This paper deals with the dynamic multi‐item capacitated lot‐sizing...
A Freight Service Design Problem for a Railway Corridor
A Freight Service Design Problem for a Railway Corridor
2011,
We study the problem of designing a set of highly profitable freight routes in a...
Scheduling Trains with Priorities: A No‐Wait Blocking Parallel‐Machine Job‐Shop Scheduling Model
Scheduling Trains with Priorities: A No‐Wait Blocking Parallel‐Machine Job‐Shop Scheduling Model
2011,
The paper investigates train scheduling problems when prioritised trains and...
Solution of the Train Platforming Problem
Solution of the Train Platforming Problem
2011,
In this paper we study a general formulation of the train platforming problem, which...
Scheduling a single machine with multiple job processing ability to minimize makespan
Scheduling a single machine with multiple job processing ability to minimize makespan
2011,
This paper investigates a new problem, called single machine scheduling with multiple...
A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
2011,
The graph colouring problem, as an important NP‐complete problem, is considered...
An application of variable neighbourhood search to hospital call scheduling of infant formula promotion
An application of variable neighbourhood search to hospital call scheduling of infant formula promotion
2011,
In the infant formula industry, products must rely on the prescription or...
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
2011,
This paper presents the SR‐GCWS‐CS probabilistic algorithm that combines...
Delimitation of service areas in reverse logistics networks with multiple depots
Delimitation of service areas in reverse logistics networks with multiple depots
2011,
This paper describes a heuristic approach for the definition of service (or influence)...
Minimizing the sum of maximum earliness and maximum tardiness in the single‐machine scheduling problem with sequence‐dependent setup time
Minimizing the sum of maximum earliness and maximum tardiness in the single‐machine scheduling problem with sequence‐dependent setup time
2011,
This paper considers the problem of scheduling a given number of jobs on a single...
A heuristic procedure for the integrated facility layout design and flow assignment problem
A heuristic procedure for the integrated facility layout design and flow assignment problem
2011,
We present an efficient iterative heuristic procedure for solving the integrated...
A GA/TS algorithm for the stage shop scheduling problem
A GA/TS algorithm for the stage shop scheduling problem
2011,
This paper presents a special case of the general shop called stage shop problem. The...
A GRASP metaheuristic to improve accessibility after a disaster
A GRASP metaheuristic to improve accessibility after a disaster
2011,
We consider the problem of allocating scarce resources to repair a rural road network...
A heuristic for the circle packing problem with a variety of containers
A heuristic for the circle packing problem with a variety of containers
2011,
In this paper we present a heuristic algorithm based on the formulation space search...
A tree search method for the container loading problem with shipment priority
A tree search method for the container loading problem with shipment priority
2011,
This paper addresses a special kind of container loading problem with shipment...
Freight transportation in railway networks with automated terminals: A mathematical model and MIP heuristic approaches
Freight transportation in railway networks with automated terminals: A mathematical model and MIP heuristic approaches
2011,
In this paper we propose a planning procedure for serving freight transportation...
Fix‐and‐optimize heuristics for capacitated lot‐sizing with sequence‐dependent setups and substitutions
Fix‐and‐optimize heuristics for capacitated lot‐sizing with sequence‐dependent setups and substitutions
2011,
In this paper, we consider a capacitated single‐level dynamic lot‐sizing...
A 3/2‐approximation algorithm for ki‐partitioning
A 3/2‐approximation algorithm for ki‐partitioning
2011,
We consider multiprocessor scheduling with the objective of minimizing the makespan....
Papers per page: