Sciweavers

EVOW
2012
Springer
12 years 6 months ago
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...
Martin Schwengerer, Sandro Pirkwieser, Günthe...
JACIII
2007
103views more  JACIII 2007»
13 years 11 months ago
Dynamically Adjusting Migration Rates for Multi-Population Genetic Algorithms
In this paper, the issue of adapting migration parameters for MGAs is investigated. We examine, in particular, the effect of adapting the migration rates on the performance and so...
Tzung-Pei Hong, Wen-Yang Lin, Shu-Min Liu, Jiann-H...
MP
2006
90views more  MP 2006»
13 years 11 months ago
Solving multistage asset investment problems by the sample average approximation method
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
Jörgen Blomvall, Alexander Shapiro
AAAI
1996
14 years 15 days ago
Monitoring the Progress of Anytime Problem-Solving
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
Eric A. Hansen, Shlomo Zilberstein
IJCAI
2003
14 years 16 days ago
Increasing Dialogue Efficiency in Case-Based Reasoning Without Loss of Solution Quality
Increasing dialogue efficiency in case-based reasoning (CBR) must be balanced against the risk of commitment to a sub-optimal solution. Focusing on incremental query elicitation i...
David McSherry
NIPS
2008
14 years 18 days ago
Biasing Approximate Dynamic Programming with a Lower Discount Factor
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
Marek Petrik, Bruno Scherrer
ICCBR
1995
Springer
14 years 2 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
IEEEPACT
1998
IEEE
14 years 3 months ago
A New Heuristic for Scheduling Parallel Programs on Multiprocessor
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
Jing-Chiou Liou, Michael A. Palis
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
14 years 3 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...
CEC
2005
IEEE
14 years 4 months ago
On improving genetic programming for symbolic regression
This paper reports an improvement to genetic programming (GP) search for the symbolic regression domain, based on an analysis of dissimilarity and mating. GP search is generally di...
Steven Gustafson, Edmund K. Burke, Natalio Krasnog...