Sciweavers

14548 search results - page 373 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2003
Springer
15 years 12 months ago
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...
Kumara Sastry, David E. Goldberg
IPCO
1993
98views Optimization» more  IPCO 1993»
15 years 8 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
145
Voted
DSS
2007
122views more  DSS 2007»
15 years 6 months ago
A stochastic beam search for the berth allocation problem
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
Fan Wang, Andrew Lim
ASIAMS
2008
IEEE
16 years 1 months ago
Optimization of a Kraft Pulping System: Using Particle Swarm Optimization and Differential Evolution
Expectation of profit is the economic driving force motivating business activity in a free-enterprise economy. An increase in this profit for a given organization can be accomplis...
Millie Pant, Radha Thangaraj, Ajith Abraham
EMO
2003
Springer
162views Optimization» more  EMO 2003»
15 years 12 months ago
PISA: A Platform and Programming Language Independent Interface for Search Algorithms
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
Stefan Bleuler, Marco Laumanns, Lothar Thiele, Eck...