From: "Steffen Wolf" <stw@writeme.com>
Subject: Re: allocation algorithm
Date: Thu, 10 Aug 2000 12:35:16 +0200
Newsgroups: comp.theory,de.sci.mathematik,sci.math,z-netz.sprachen.algorithmen
Summary: [missing]

hi Christian Zenner (chzenner@gmx.de)

You wrote:
> Hello,
>
> I am looking for an allocation algorithm for goods to distribute them  to
> storehouses... the important aspect is, that the goods of the same kind do
> not have to be stored in one stock as a whole, instead, any division of the
> goods should be possible and taken into account. There's a certain utility
> function involved, composed of storage cost and the cost of moving the goods
> to the consumer, simply represented by the physical distance between stock
> and consumer. The allocation should be optimized for all storehouses.
> Is there a special algorithm for that? I hope you can help me, if not, maybe
> you know someone you could redirect me to?

If I understood you correctly, you're searching for an algorithm to
compute a Least-Cost-Route.

I'm studiing Informatics at HTWK Leipzig,
 and my prof showed us a good algorithm for that.

This is of polynomical complexity.

We used it to compute the Least-Cost-Route(s) through nets of
Transportation (with costs, special limitations such as upper limit or
"not less than this many!"), storehouses (which charge a little sum) an
the customers.


The Algorithm itself is not so difficult, but consists of several tasks
which cannot be understood without knowlegde about trees or
graph-theory.

So I'll give you two links,
 I've explained a homework of mine,
It's german, but since your eMail-adress end with .de  this shouldn't be
too hard for you:

http://www.imn.htwk-leipzig.de/~swolf/helpz/63/
http://www.imn.htwk-leipzig.de/~swolf/helpz/66/


If it's wanted I can post the algorithm in English,
 just say so.

cu,
 stw

---
Hi! I'm a .signature virus! Copy me into your ~/.signature to help me spread