Sciweavers

3433 search results - page 201 / 687
» Heuristics for a bidding problem
Sort
View
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 6 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
AEI
2000
120views more  AEI 2000»
15 years 6 months ago
A neural network approach for a robot task sequencing problem
This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loadin...
Oded Maimon, Dan Braha, Vineet Seth
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
16 years 23 days ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
16 years 23 days ago
Concept-based multi-objective problems and their solution by EC
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...
Amiram Moshaiov, Gideon Avigad
NOMS
2006
IEEE
16 years 19 days ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...