Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!nntp.sei.cmu.edu!news.psc.edu!hudson.lm.com!news.math.psu.edu!news.cac.psu.edu!newsserver.jvnc.net!newsserver2.jvnc.net!howland.reston.ans.net!news.sprintlink.net!in2.uu.net!newshost.marcam.com!zip.eecs.umich.edu!umn.edu!news
From: "James Albert Larson" <larso171@maroon.tc.umn.edu>
Subject: Re: Hill Climbing Refs Wanted
To: chouck@eos.ncsu.edu
Message-ID: <38846.larso171@maroon.tc.umn.edu>
X-Minuet-Version: Minuet1.0_Beta_16
Sender: news@news.cis.umn.edu (Usenet News Administration)
Nntp-Posting-Host: dialup-4-62.gw.umn.edu
X-Popmail-Charset: English
Organization: University of Minnesota, Twin Cities
Date: Sat, 12 Aug 1995 12:45:52 GMT
Lines: 29

On 11 Aug 1995 13:31:52 GMT, 
Christopher Houck  <chouck@eos.ncsu.edu> wrote:

>I am currently working on a project using Genetic Algorithms 
>in conjunction with hill-climbing/local-improvement algorithms.

Michalewicz's Genetic Algorithms + Data Sturctures = Evolution Programs" 
2nd Extended Edition, Springer-Verlag, 1994 ISBN 3-540-58090-5 includes 
hillclimber techniques in his Genocop program.  Maybe in other problems 
too, I don't recall.  (Come to think of it, I suppose you know that, coming 
from ncsu.edu).

"A Genetic Algorithm Solution to the Unit Commitment Problem", by S.A. 
Kazarlis, A.G. Bakirtzis, V. Petridis, Paper 95WM 152-9 PWRS, 1995 (to be 
published in the IEEE Transactions on Power Systems (3 months from now is 
a good guess), available from the IEEE before then; and online I believe 
at: 

 ftp site:  elecserv.eng.auth.gr Directory:  pub/   File:  unitcom.ps.Z

a]though I haven't been able to access it for a long time (from Minnesota).
The above paper finds great improvement from using problem-specific 
hillclimber operators in solving the very difficult unit commitment problem 
(the problem of scheduling an electric utility's generators for a period of 
1 to 5 days in the future to meet the forecasted system load for that 
period at minimum cost).

Jim Larson

