Sciweavers

544 search results - page 22 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
IAT
2007
IEEE
14 years 2 months ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings
IEAAIE
2010
Springer
13 years 5 months ago
Improving Timetable Quality in Scheduled Transit Networks
This work deals with an original problem with regard to the traditionally sequential planning process in public transit networks. This problem aims at modifying the network's ...
Valérie Guihaire, Jin-Kao Hao
IJCAI
2003
13 years 9 months ago
Backbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
Weixiong Zhang, Ananda Rangan, Moshe Looks
ICNC
2009
Springer
14 years 2 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
ICIC
2007
Springer
14 years 2 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu