Sciweavers

544 search results - page 7 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
EUROCAST
2009
Springer
179views Hardware» more  EUROCAST 2009»
14 years 1 months ago
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
ICTAI
2003
IEEE
14 years 9 days ago
An Intelligent Early Warning System for Software Quality Improvement and Project Management
One of the main reasons behind unfruitful software development projects is that it is often too late to correct the problems by the time they are detected. It clearly indicates th...
Xiaoqing Frank Liu, Gautam Kane, Monu Bambroo
FUZZIEEE
2007
IEEE
13 years 8 months ago
Consistent, Complete and Compact Generation of DNF-type Fuzzy Rules by a Pittsburgh-style Genetic Algorithm
When a flexible fuzzy rule structure such as those with antecedent in conjunctive normal form is used, the interpretability of the obtained fuzzy model is significantly improved. H...
Jorge Casillas, Pedro Martínez
JAR
2000
149views more  JAR 2000»
13 years 6 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
CP
1998
Springer
13 years 11 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw