[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: HA: [Help-glpk] transportation problem
|
From: |
Ivo van Baren |
|
Subject: |
Re: HA: [Help-glpk] transportation problem |
|
Date: |
Mon, 31 May 2010 16:24:17 +0200 |
Hello mr. Нестеренко,
Below is a pointer to the Andrew Goldberg's Network Optimization Library, CS2 in the library is an extremely fast routine to solve min. cost flow and therefore the "transportation" problem, and has been built into at least one proprietary transportation planner. You can't just embed the CS2 routine in GLPK. It has totally different data structures and it makes use of pointer artithmic in a specific way.
It is not free software! There are copyright rules to be obeyed.
If you mean other types of transport problems such as vehicle routing etc, the library is not of immediate use.
Succes!
Best regards,
Ivo van Baren
Netherlands
2010/3/3 Нестеренко Геннадий Витальевич
<address@hidden>
Hello, Andrew!
>>> Does any of you know if there is a free
>>> library that implements a solver for
>>> the transportation problem?
>>
>> The transportation problem is a particular case of the minimum cost
>> flow problem, which can be solved either with the standard simplex or
>> with a specialized algorithm like the network simplex. Currently glpk
>> includes the api routine glp_mincost_okalg that implements the
>> out-of-kilter algorithm. For more details see the document "Graph and
>> Network Routines" (doc/graphs.pdf) included in the glpk distribution.
>
>See also the following page:
>http://people.brunel.ac.uk/~mastjjb/jeb/or/netflow.html
Would you tell me pls, is it possible to use command "printf" if I run glpsol.exe with switch --mincost? I use exe-file made by Xypron http://sourceforge.net/projects/winglpk/ (10x to him).