Hello, looking at your model, I would suggest considering the following solution approaches:
- a time windowing heuristic, which will try to find a solution for a first time windows, fixes the solution for a first part of the time windows and then moves the window for which a solution is sought - a column generation approach (see Column Generation, Guy Desaulniers, Jacques Desrosiers und Marius M. Solomon, Springer, ISBN-13: 978-1441937995) Best regards Xypron -------- Original-Nachricht -------- > Datum: Mon, 14 May 2012 07:40:00 -0700 (PDT) > Betreff: [Help-glpk] "The conflict graph is either empty or too big" > > Hi, > > I'm running a simulation and it's taking quite a while... > > I'm running on Gusek, which is the only way I found to use GLPK (couldn't > figure out how to install on win) > > > The program seems to found a solution : > > OPTIMAL SOLUTION FOUND > Integer optimization begins... > Gomory's cuts enabled > MIR cuts enabled > Cover cuts enabled > Clique cuts enabled > Creating the conflict graph... > The conflict graph is either empty or too big > > > But then it goes on searching for quite a while : > http://old.nabble.com/file/p33830878/simul.mod simul.mod > > Time used: 1294.0 secs. Memory used: 55.1 Mb. > +176120: mip = not found yet >= 5.813433080e+004 (195; 6) > +176321: mip = not found yet >= 5.813433080e+004 (196; 6) > > I have no clue if it's close to the solution, if it's taking too long or > if > I should wait or ... ? > > Does anybody know if it is normal ? > > my code is attached. > > Thank you. -- NEU: FreePhone 3-fach-Flat mit kostenlosem Smartphone! Jetzt informieren: http://mobile.1und1.de/?ac=OM.PW.PW003K20328T7073a _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
