Sciweavers

544 search results - page 8 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
AIPS
2006
13 years 8 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
KES
2005
Springer
14 years 15 days ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
SGAI
2009
Springer
13 years 11 months ago
Improving Cooperative PSO using Fuzzy Logic
PSO is a population-based technique for optimization, which simulates the social behavior of the fish schooling or bird flocking. Two significant weaknesses of this method are: fir...
Zahra Afsahi, Mohammad Reza Meybodi
PRICAI
2004
Springer
14 years 11 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
14 years 1 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...