|
From: Niclas O. <gu...@ac...> - 2002-08-15 12:10:47
|
Laurent Caillette wrote: >>ASA however looks like a fairly simple algorithm (at >>least to understand), is this observation correct or >>simply an illusion based on good explanation in the >>paper? > > > The paper describes a generalistic approach, but does > not explain everything you should know about Tabu List > management or things like that. We had some hard times > for understanding what was *really* happening in the > system (though coding may appear simple). I know more now. I've read about generic approaches, local searchmethods, etc. > BTW we're interested by your feedback about JCL. We > believe that CSP is a *great* tool, and we want to > keep an eye on what's happening here. The honest feedback is that it's a programming disaster (to say the least), but works. I couldn't make sense of the algortithms implemented when comparing them to the psuedo code. So I trashed it and started on something new myself, sorry. I also like the way ILOG works with heuristics for instantiation so I have something like that now. I also like the propagation model ILOG uses so I added that. I used to do VRML earlier and the propagation works almost the same there, so I'm used to thinking in thouse terms. I'm also re-implementing all algorithms that I want, now using revertable objects. Might now be the fastest, but it sure makes it simple. I had the first algorithm, simple back tracking, working on this framework tow days ago now. But I like WASA a lot, in fact I like it more than any other I've seen so far. My boss likes it too. So we are probably going to work out a model where we can use our own, WASA, or ILOG JSolver depending on what the case might be. Cheers, /Niclas |