Sciweavers

944 search results - page 2 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
13 years 12 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
CLUSTER
2008
IEEE
13 years 11 months ago
A comparison of search heuristics for empirical code optimization
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
Keith Seymour, Haihang You, Jack Dongarra
EOR
2008
91views more  EOR 2008»
13 years 5 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
IJAIT
2010
167views more  IJAIT 2010»
13 years 3 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 5 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma