Keyword: heuristics: local search

Found 320 papers in total
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
2012,
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The...
Synchronized arc routing for snow plowing operations
Synchronized arc routing for snow plowing operations
2012,
This paper introduces a synchronized arc routing problem for snow plowing operations....
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
2012,
This paper deals with the single machine scheduling problem to minimize the total...
Iterated local search and very large neighborhoods for the parallel‐machines total tardiness problem
Iterated local search and very large neighborhoods for the parallel‐machines total tardiness problem
2012,
We present computational results with a heuristic algorithm for the parallel machines...
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
2012,
In this paper we consider the well‐known single machine scheduling problem with...
Efficient Algorithms for Integer Programs with Two Variables per Constraint
Efficient Algorithms for Integer Programs with Two Variables per Constraint
2001,
Integer programs with m constraints, each with two variables, we present an O(mU) time...
Reactive Local Search for the Maximum Clique Problem
Reactive Local Search for the Maximum Clique Problem
2001,
A new Reactive Local Search ( LS ) algorithm is proposed for the solution of the...
Max‐ and Min‐Neighborhood Monopolies
Max‐ and Min‐Neighborhood Monopolies
2002,
Given a graph G=(V,E) and a set of vertices M ⊆ V , a vertex v ∈ V is said...
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
2012,
We consider a reformulation of mathematical programs with complementarity constraints,...
A parallel algorithm for two‐staged two‐dimensional fixed‐orientation cutting problems
A parallel algorithm for two‐staged two‐dimensional fixed‐orientation cutting problems
2012,
In this paper, we study the two‐staged two‐dimensional...
Solving an optimization packing problem of circles and non‐convex polygons with rotations into a multiply connected region
Solving an optimization packing problem of circles and non‐convex polygons with rotations into a multiply connected region
2012,
This paper deals with the packing problem of circles and non‐convex polygons,...
Applying the threshold accepting metaheuristic to curriculum based course timetabling
Applying the threshold accepting metaheuristic to curriculum based course timetabling
2012,
The article presents a study of local search algorithms for timetabling problems, with...
An IP‐based heuristic for the post enrolment course timetabling problem of the ITC2007
An IP‐based heuristic for the post enrolment course timetabling problem of the ITC2007
2012,
Track 2 of the international timetabling competition 2007 was a post enrolment course...
An improved multi‐staged algorithmic process for the solution of the examination timetabling problem
An improved multi‐staged algorithmic process for the solution of the examination timetabling problem
2012,
The efficient creation of examination timetables is a recurring and important problem...
An ILS heuristic for the traveling tournament problem with predefined venues
An ILS heuristic for the traveling tournament problem with predefined venues
2012,
The Traveling Tournament Problem with Predefined Venues (TTPPV) is a single round...
Local search and constraint programming for the post enrolment‐based course timetabling problem
Local search and constraint programming for the post enrolment‐based course timetabling problem
2012,
We present a variety of approaches for solving the post enrolment‐based course...
Local search neighbourhoods for dealing with a novel nurse rostering model
Local search neighbourhoods for dealing with a novel nurse rostering model
2012,
A novel nurse rostering model is developed to represent real world problem instances...
Flight gate scheduling with respect to a reference schedule
Flight gate scheduling with respect to a reference schedule
2012,
This paper considers the problem of assigning flights to airport gates. We examine the...
An effective greedy heuristic for the Social Golfer Problem
An effective greedy heuristic for the Social Golfer Problem
2012,
The Social Golfer Problem (SGP) is a combinatorial optimization problem that exhibits...
A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
2011,
This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery...
On the tour planning problem
On the tour planning problem
2012,
Increasingly, tourists are planning trips by themselves using the vast amount of...
Performance‐Driven Layer Assignment by Integer Linear Programming and Path‐Constrained Hypergraph Partitioning
Performance‐Driven Layer Assignment by Integer Linear Programming and Path‐Constrained Hypergraph Partitioning
1997,
Performance‐driven physical layout design is becoming increasingly important...
The travelling salesperson problem with hotel selection
The travelling salesperson problem with hotel selection
2012,
In this paper, we present the travelling salesperson problem with hotel selection...
Minimax optimisation approach for the Robust Vehicle Routing Problem with Time Windows and uncertain travel times
Minimax optimisation approach for the Robust Vehicle Routing Problem with Time Windows and uncertain travel times
2011,
This paper focuses on the Robust Vehicle Routing Problem with Time Windows...
Papers per page: