Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: heuristics: local search
Found
320 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Hybridising GRASP and network flows in the solution of a medical school scheduling problem
2012,
Thompson Jonathan
This paper tackles the problem of allocating medical students to clinical specialities...
An estimation of distribution algorithm for lot‐streaming flow shop problems with setup times
2012,
Ruiz Rubn
Lot‐streaming flow shops have important applications in different industries...
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
2012,
Ribeiro Celso
Run time distributions or time‐to‐target plots are very useful tools to...
Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows
2010,
Srensen Kenneth
Creating digital maps often requires driving around the streets in a so‐called...
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
2010,
Subramanian A
This paper presents a parallel approach for solving the Vehicle Routing Problem with...
Estimation‐based metaheuristics for the probabilistic traveling salesman problem
2010,
Dorigo Marco
The probabilistic traveling salesman problem (PTSP) is a central problem in stochastic...
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
2010,
Toth Paolo
Given an undirected graph whose edges are labeled or colored, edge weights indicating...
Adaptive large neighborhood search for service technician routing and scheduling problems
2012,
Doerner Karl
Motivated by the problem situation faced by infrastructure service and maintenance...
Variable neighborhood search for location routing
2013,
Mladenovic Nenad
In this paper we propose various neighborhood search heuristics (VNS) for solving the...
Breakout Local Search for maximum clique problems
2013,
Hao Jin-Kao
The maximum clique problem (MCP) is one of the most popular combinatorial optimization...
Solution approaches for the cutting stock problem with setup cost
2013,
Ekici Ali
In this paper, we study the Cutting Stock Problem with Setup Cost (CSP‐S) which...
A new heuristic for solving the p‐median problem in the plane
2013,
Drezner Zvi
This paper presents a new local search for solving the continuous p‐median...
Scatter search for the cutwidth minimization problem
2012,
Mart Rafael
The cutwidth minimization problem consists of finding a linear layout of a graph so...
A dynamic vehicle routing problem with multiple delivery routes
2012,
Potvin Jean-Yves
This paper considers a vehicle routing problem where each vehicle performs delivery...
Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies
2012,
Drugan Mdlina M
Pareto local search (PLS) methods are local search algorithms for...
Design and statistical analysis of a hybrid local search algorithm for course timetabling
2012,
Schaerf Andrea
We propose a hybrid local search algorithm for the solution of the...
Cliques with maximum/minimum edge neighborhood and neighborhood density
2012,
Martins Pedro
This paper addresses maximum/minimum edge neighborhood and neighborhood density...
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
2012,
Laporte Gilbert
The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the...
Extended local search algorithm based on nonlinear programming for two‐dimensional irregular strip packing problem
2012,
Zhang Defu
This paper presents an extended local search algorithm (ELS) for the irregular strip...
A multiobjective metaheuristic for a mean‐risk multistage capacity investment problem with process flexibility
2012,
Claro Joo
In this paper, we propose a multiobjective local search metaheuristic for a...
An efficient local search for minimizing completion time variance in permutation flow shops
2012,
Sharma Prabha
This paper illustrates that by exploiting the structure of hard combinatorial...
Restricted dynamic programming: A flexible framework for solving realistic VRPs
2012,
Kok A L
Most successful solution methods for solving large vehicle routing and scheduling...
Variable neighbourhood search for the variable sized bin packing problem
2012,
Blum Christian
The variable sized bin packing problem is a generalisation of the...
An effective shuffled frog‐leaping algorithm for resource‐constrained project scheduling problem
2012,
Wang Ling
In this paper, we propose an effective heuristic based on the framework of the...
First Page
3
4
5
6
7
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers