Sciweavers

715 search results - page 91 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
COR
2010
155views more  COR 2010»
14 years 9 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 3 months ago
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
A. E. Eiben, Marc Schoenauer, Juan Luís Jim...
IAT
2006
IEEE
15 years 3 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
GECCO
2004
Springer
15 years 3 months ago
The Lens Design Using the CMA-ES Algorithm
This paper presents a lens system design algorithm using the covariance matrix adaptation evolution strategy (CMA-ES), which is one of the most powerful self-adaptation mechanisms....
Yuichi Nagata
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
14 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre