Keyword: heuristics

Found 5460 papers in total
An evolutionary algorithm for the resource‐constrained project scheduling problem with minimum and maximum time lags
2011,
In this paper, we present an evolutionary algorithm (EVA) for solving the...
A new model for the integrated vehicle‐crew‐rostering problem and a computational study on rosters
2011,
Operational planning within public transit companies has been extensively tackled but...
A set partitioning reformulation of a school bus scheduling problem
2011,
We present an integer programming model for the integrated optimization of bus...
New high performing heuristics for minimizing makespan in permutation flowshops
2009,
The well‐known NEH heuristic from Nawaz, Enscore and Ham proposed in 1983 has...
An appraisal of a column‐generation‐based algorithm for centralized train‐conflict resolution on a metropolitan railway network
2011,
In practice, a train‐conflict resolution is decentralized around dispatchers...
An enhanced charged system search for configuration optimization using the concept of fields of forces
2011,
The concept of the ‘fields of forces’ is utilized as a general model of...
Public‐transport vehicle scheduling with multi vehicle type
2011,
The public‐transport (transit) operation planning process commonly includes...
Maximum utility product pricing models and algorithms based on reservation price
2011,
We consider a revenue management model for pricing a product line with several...
Relaxations and exact solution of the variable sized bin packing problem
2011,
We address a generalization of the classical one‐dimensional bin packing...
Heuristic approaches to discrete‐continuous project scheduling problems to minimize the makespan
2011,
In this paper some discrete‐continuous project scheduling problems to minimize...
Planning wireless networks by shortest path
2011,
Transmitters and receivers are the basic elements of wireless networks and are...
Dynamic uncapacitated lot sizing with random demand under a fillrate constraint
2011,
This paper deals with the single-item dynamic uncapacitated lot sizing problem with...
The constrained compartmentalized knapsack problem: mathematical models and solution methods
2011,
The constrained compartmentalized knapsack problem can be seen as an extension of the...
Lower bounds for the ITC‐2007 curriculum‐based course timetabling problem
2011,
This paper describes an approach for generating lower bounds for the...
Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems
2011,
Terminal assignment problem (TEAP) is to determine minimum cost links to form a...
Allocation of quality control stations in multistage manufacturing systems
2011,
The allocation of quality control stations (AQCS) in multistage manufacturing systems...
Firing sequences backward algorithm for simple assembly line balancing problem of type 1
2011,
The objective of simple assembly line balancing problem type‐1 (SALBP‐1)...
Dynamic lot sizing for multiple products with a new joint replenishment model
2011,
This paper studies a new multi‐product dynamic lot sizing problem, where the...
DEA based dimensionality reduction for classification problems satisfying strict non‐satiety assumption
2011,
This study shows how data envelopment analysis (DEA) can be used to reduce vertical...
Resource leveling in a machine environment
2011,
We address resource leveling problems in a machine environment. Given a set of m...
A Hybrid Particle Swarm Optimisation approach for Reactive Power Optimisation in electricity market
2011,
Reactive Power Optimisation (RPO) is an important issue in deregulated...
Long term staff scheduling of physicians with different experience levels in hospitals using column generation
2011,
We present a strategic model to solve the long‐term staffing problem of...
Decision Support and Optimization in Shutdown and Turnaround Scheduling
2011,
Large‐scale maintenance in industrial plants requires the entire shutdown of...
Computing a Classic Index for Finite‐Horizon Bandits
2011,
This paper considers the efficient exact computation of the counterpart of the Gittins...
Papers per page: