Sciweavers

14739 search results - page 238 / 2948
» An optimization problem on the sphere
Sort
View
77
Voted
ATAL
2007
Springer
15 years 3 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 2 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 2 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
ATMOS
2007
129views Optimization» more  ATMOS 2007»
15 years 20 days ago
Solving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 13 days ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier