Decision Optimization

Decision Optimization

Delivers prescriptive analytics capabilities and decision intelligence to improve decision-making.


#Analytics
#DecisionOptimization
#DecisionOptimization
 View Only

  • 1.  Error in Cplex

    Posted 11/04/14 07:58 AM

    Originally posted by: giannil


    Hallo,

    We tried to find a solution for our problem but Cplex  gave us always error 1001 : out of memory. Is there a simple solution for this problem or do we have to change things in our code? 

    This is our code : 

    //Data
     int AantalFG = ...;
     int AantalPodia = ...;
     int AantalTijdsblokken = ...;
     int AantalArtiesten = ...;
     
     int Voorkeuren [0 .. AantalFG-1][0 .. AantalArtiesten-1] = ...;
     
      //Conflicten is een matrix waarin op plaats ij het aantal festivalgangers staan die zowel optreden i als optreden j willen bijwonen
     
     int Conflicten[a in 0 .. AantalArtiesten-1][b in 0 .. AantalArtiesten-1]= sum(c in 0 .. AantalFG-1) Voorkeuren[c][a]*Voorkeuren[c][b];
     
    //Decision Variables
      //Oijk = 1, als optreden i plaatsvind op podium j tijdens tijdslot k
     
      dvar int O[0 .. AantalArtiesten-1][0 .. AantalPodia-1][0 .. AantalTijdsblokken-1] in 0 .. 1;
     
      //Xij = 1, als optreden i plaatsvindt tijdens hetzelfde tijdsblok als optreden j
     
      dvar int X[0 .. AantalArtiesten-1][0 .. AantalArtiesten-1] in 0 .. 1;
     
      //Yij = 1, als optreden j volgt op optreden i
     
      dvar int Y[0 .. AantalArtiesten-1][0 .. AantalArtiesten-1] in 0 .. 1;
     
      //Wij = 1, als optreden i en j op hetzelfde podium doorgaan
     
      dvar int W[0 .. AantalArtiesten-1][0 .. AantalArtiesten-1] in 0 .. 1;
     
      //Zij = 1, als optreden j volgt op i op een verschillend podium
     
      dvar int Z[0 .. AantalArtiesten-1][0 .. AantalArtiesten-1] in 0 .. 1;
     
    //Objective Function
     
    minimize sum(i,j in 0 .. AantalArtiesten-1)Conflicten[i][j]*X[i][j]+sum(i,j in 0 .. AantalArtiesten-1)Conflicten[i][j]*Z[i][j]+sum(i,j in 0 .. AantalArtiesten-1)1000*Y[i][j]+sum(i,j in 0 .. AantalArtiesten-1)1000*W[i][j];
     
    //Constraints
     
    subject to{
     
      //Uniciteit
    //Elke artiest moet 1 podium en 1 tijdsblok toegewezen krijgen
     
    forall( i in 0 .. AantalArtiesten-1)
     sum(j in 0 .. AantalPodia-1, k in 0 .. AantalTijdsblokken-1)O[i][j][k] == 1;
     
    //Er mag maar 1 artiest per podium en per tijdsblok zijn
     
    forall( j in 0 .. AantalPodia-1, k in 0 .. AantalTijdsblokken-1)
     sum( i in 0 .. AantalArtiesten-1) O[i][j][k] == 1;
     
      //Compleetheid
    //Voor elk podium moet de som van het aantal optreden gelijk zijn aan het aantal tijdsblokken
     
    forall(j in 0 .. AantalPodia-1)
     sum(i in 0 .. AantalArtiesten-1,k in 0 .. AantalTijdsblokken-1)O[i][j][k] == AantalTijdsblokken;
     
    //Voor elk tijdsblok moet de som van het aantal optreden gelijk zijn aan het aantal podia
     
    forall(k in 0 .. AantalTijdsblokken-1)
     sum(i in 0 .. AantalArtiesten-1,j in 0 .. AantalPodia-1)O[i][j][k] == AantalPodia;
     
    //Er moeten in totaal evenveel optredens zijn als artiesten
     
    sum(i in 0 .. AantalArtiesten-1,j in 0 .. AantalPodia-1,k in 0 .. AantalTijdsblokken-1)O[i][j][k] == AantalArtiesten;
     
      //__________________________________________________________________
      //Constraints die waarden van de hulpvariabelen bepalen
      
      //De overlapvariabele: forall k in Timeslots: 1 + O[i,j] >= sum(p in Podiums) X[i,p,k] + sum(p in Podiums) X[j,p,k] 
     
      forall(k in  0 .. AantalTijdsblokken-1, i,a in 0 .. AantalArtiesten-1)
       1+X[i][a] >= sum( j in 0 .. AantalPodia-1)O[i][j][k]+ sum(j in 0 .. AantalPodia-1)O[a][j][k];
     
      //Vallen 2 optredens in opeenvolgende tijdsblokken?
     
        forall(k in  0 .. AantalTijdsblokken-2, i,a in 0 .. AantalArtiesten-1)
         1+Y[i][a] >= sum(j in 0 .. AantalPodia-1)O[i][j][k]+sum(j in 0 .. AantalPodia-1)O[a][j][k+1];
     
      //Vallen 2 optredens op hetzelfde podium
     
      forall(j in  0 .. AantalPodia-1, i,a in 0 .. AantalArtiesten-1)
       1+W[i][a] >= sum( k in 0 .. AantalTijdsblokken-1)O[i][j][k]+ sum(k in 0 .. AantalTijdsblokken-1)O[a][j][k];
     
      //De VolgOpVerschillendPodiumVariabele
     
      forall(i,a in 0 .. AantalArtiesten-1)
      Z[i][a] >= Y[i][a] - W[i][a];
     
      //_______________________________________________________________________
      // Constraints op de extra variabelen
     
      //1: Het maximaal aantal optredens dat tegelijk kan plaatsvinden is gelijk aan het aantal podia: Horizontaal
     
    forall(i in 0 .. AantalArtiesten-1)
     sum(j in 0 .. AantalArtiesten-1)X[i][j] == AantalPodia;
    //2: Het maximaal aantal optredens dat tegelijk kan plaatsvinden is gelijk aan het aantal podia: Verticaal
     
    forall(j in 0 .. AantalArtiesten-1)
     sum(i in 0 .. AantalArtiesten-1)X[i][j] == AantalPodia;
     
    //3: Het maximaal optredens dat op 1 optreden volgt op andere podia is kleiner dan het aantal podia: Horizontaal
     
    forall(i in 0 .. AantalArtiesten-1)
      sum(j in 0 .. AantalArtiesten-1)Z[i][j] <= AantalPodia-1;
      
    //4: De volgvariabele is niet symmetrisch rond de diagonaal, gezien als j op i volgt i niet op j kan volgen
     
    forall(i,j in 0 .. AantalArtiesten-1)
    Z[i][j]+Z[j][i] <= 1;
     
    //5: Als i tegelijk valt met j dan moet j ook gelijk vallen met i
     
    forall(i,j in 0 .. AantalArtiesten-1)
     X[i][j] == X[j][i];
     
    //6: Een optreden valt uiteraard samen mat zichzelf
     
    forall(i in 0 .. AantalArtiesten-1)
    X[i][i] == 1;
     
    //7: Een optreden kan zichzelf niet opvolgen op een ander podium
     
    forall(i in 0 .. AantalArtiesten-1)
     Z[i][i] == 0;
     
    //8: Elk optreden heeft (AantalPodia-1) optredens die volgen op een ander podium, behalve de optredens die als laatste gescheduled zijn
     
    sum(i, j in 0 .. AantalArtiesten-1)Z[i][j] == AantalPodia*(AantalPodia-1)*(AantalTijdsblokken-1);
     
    //9: Elk optrede kan maar opvolger op een ander podium zijn van (AantalPodia-1) optredens (Verticaal)
     
    forall(i in 0 .. AantalArtiesten-1)
      sum(j in 0 .. AantalArtiesten-1)Z[j][i] <= AantalPodia-1;
      
    //10: Een optreden kan niet samenvallen met een ander optreden en tegelijk opvolger zijn op een ander podium
     
    forall(i,j in 0 .. AantalArtiesten-1)
    Z[i][j]+X[i][j] <= 1;
     
     
    //11: Een optrede kan niet tegelijk geen opvolgers en geen voorgangers hebben
     
    forall(i in  0 .. AantalArtiesten-1)
    sum(j in 0 .. AantalArtiesten-1)Z[i][j]+sum(j in 0 .. AantalArtiesten-1)Z[j][i] >= AantalPodia-1;
     
     
     
    }
     
    Thanks!

    #CPLEXOptimizers
    #DecisionOptimization


  • 2.  Re: Error in Cplex

    Posted 11/05/14 04:31 PM

     

    One possible cause might be the node file (branch and bound tree) getting too large. There are CPLEX parameters that let you tell CPLEX to compress the file in memory or to write portions to disk as needed. There is also a parameter that adjusts the limit on hire large the node file is allowed to get. If you search this forum for "node file", you should find older posts with details.


    #CPLEXOptimizers
    #DecisionOptimization


  • 3.  Re: Error in Cplex

    Posted 11/08/14 05:06 AM

    Originally posted by: giannil


    I tried to change all these settings but ik keeps giving the error. Sometimes it stops now at 67%...

    Are there other things we can do because we need tot do it after this with more data?

    Thanks


    #CPLEXOptimizers
    #DecisionOptimization


  • 4.  Re: Error in Cplex

    Posted 11/10/14 02:13 AM

    What exactly are the parameter settings you are using right now?

    At which point do you see the out-of-memory? At the root node, in the tree search? Could you post the engine log up to the point at which the out-of-memory occurs?


    #CPLEXOptimizers
    #DecisionOptimization


  • 5.  Re: Error in Cplex

    Posted 11/10/14 08:27 AM

    Originally posted by: giannil


    I use mostly the standard parameters, the things I changed are :

    Memory available : 2000

    Node storage file on 3 : node file on disc and compressed

    MIP node selection strategy on 2: best estimate search

    MIP variable selection strategy on 3: strong branching

    Where can I see of the out-of-memory is caused by the root node of in the tree search?

    Thanks


    #CPLEXOptimizers
    #DecisionOptimization


  • 6.  Re: Error in Cplex

    Posted 11/10/14 03:23 PM

    Originally posted by: giannil


    This is our engine log :

    Tried aggregator 2 times.

    MIP Presolve eliminated 720 rows and 49 columns.

    MIP Presolve modified 678 coefficients.

    Aggregator did 66 substitutions.

    Reduced MIP has 1327 rows, 606 columns, and 9858 nonzeros.

    Reduced MIP has 606 binaries, 0 generals, 0 SOSs, and 0 indicators.

    Presolve time = 0.06 sec. (13.08 ticks)

    Found incumbent of value 276836.000000 after 0.23 sec. (39.83 ticks)

    Probing time = 0.02 sec. (3.32 ticks)

    Tried aggregator 1 time.

    Reduced MIP has 1327 rows, 606 columns, and 9858 nonzeros.

    Reduced MIP has 606 binaries, 0 generals, 0 SOSs, and 0 indicators.

    Presolve time = 0.03 sec. (4.00 ticks)

    Probing time = 0.01 sec. (3.32 ticks)

    Clique table members: 90.

    MIP emphasis: balance optimality and feasibility.

    MIP search method: dynamic search.

    Parallel mode: deterministic, using up to 4 threads.

    Root relaxation solution time = 0.03 sec. (6.64 ticks)

     

    Nodes Cuts/

    Node Left Objective IInf Best Integer Best Bound ItCnt Gap

     

    * 0+ 0 276836.0000 12303.0000 177 95.56%

    * 0+ 0 90804.0000 12303.0000 177 86.45%

    0 0 12765.0000 29 90804.0000 12765.0000 177 85.94%

    * 0+ 0 75844.0000 12765.0000 177 83.17%

    0 0 12765.0000 24 75844.0000 Cuts: 60 223 83.17%

    0 0 12765.0000 48 75844.0000 Cuts: 90 303 83.17%

    * 0+ 0 75840.0000 12765.0000 303 83.17%

    0 0 12765.0000 44 75840.0000 ZeroHalf: 9 368 83.17%

    0 0 12765.0000 44 75840.0000 Cuts: 93 438 83.17%

    * 0+ 0 75836.0000 12765.0000 438 83.17%

    * 0+ 0 75830.0000 12765.0000 438 83.17%

    0 2 12765.0000 24 75830.0000 12765.0000 438 83.17%

    Elapsed time = 3.00 sec. (447.19 ticks, tree = 0.02 MB, solutions = 6)

    * 3+ 3 75814.0000 12765.0000 762 83.16%

    7 9 21768.0000 90 75814.0000 12765.0000 1668 83.16%

    14 16 21767.0000 62 75814.0000 12765.0000 2675 83.16%

    24 24 25772.0000 77 75814.0000 16765.0000 7400 77.89%

    40 40 26075.5000 132 75814.0000 16765.0000 11858 77.89%

    58 58 26448.6667 119 75814.0000 16765.0000 17390 77.89%

    71 69 27283.0000 84 75814.0000 16765.0000 21757 77.89%

    85 81 30462.3333 114 75814.0000 16765.0000 26284 77.89%

    107 103 42802.0000 93 75814.0000 16765.0000 29939 77.89%

    127 123 32460.2778 119 75814.0000 16765.0000 32454 77.89%

    218 214 38939.1250 114 75814.0000 16765.0000 41979 77.89%

    Elapsed time = 20.05 sec. (3693.67 ticks, tree = 0.19 MB, solutions = 7)

    312 277 30997.3889 172 75814.0000 21772.0000 56501 71.28%

    377 340 36788.0000 60 75814.0000 21772.0000 69450 71.28%

    466 427 46298.0000 103 75814.0000 21772.0000 78019 71.28%

    567 527 54793.0000 81 75814.0000 21772.0000 88763 71.28%

    694 630 54786.0000 102 75814.0000 21772.0000 97080 71.28%

    843 744 67469.6667 126 75814.0000 21772.0000 104893 71.28%

    971 852 65055.2500 110 75814.0000 21772.0000 112835 71.28%

    1123 962 68958.5000 128 75814.0000 21772.0000 122036 71.28%

    1271 1073 54787.0000 64 75814.0000 21772.0000 129940 71.28%

    1388 1169 75813.0000 150 75814.0000 21772.0000 137667 71.28%

    Elapsed time = 88.72 sec. (13357.81 ticks, tree = 0.66 MB, solutions = 7)

    1509 1271 58788.0000 56 75814.0000 21772.0000 144205 71.28%

    1646 1392 57795.0000 54 75814.0000 21772.0000 151514 71.28%

    1785 1504 66973.1667 85 75814.0000 21772.0000 158835 71.28%

    1947 1640 70467.5833 121 75814.0000 21772.0000 164529 71.28%

    2085 1734 61792.5000 44 75814.0000 21772.0000 171595 71.28%

    2263 1817 15015.0000 38 75814.0000 21772.0000 180294 71.28%

    2302 1598 33911.4868 182 75814.0000 22374.2424 195684 70.49%

    2373 1597 45561.8704 200 75814.0000 22374.2424 213651 70.49%

    2494 1667 57787.0000 195 75814.0000 22374.2424 222673 70.49%

    2638 1701 74792.5000 143 75814.0000 22374.2424 230645 70.49%

    Elapsed time = 153.73 sec. (24156.12 ticks, tree = 4.70 MB, solutions = 7)

    2717 1716 37772.5000 125 75814.0000 22374.2424 240936 70.49%

    2824 1782 50810.0000 96 75814.0000 22374.2424 250709 70.49%

    2948 1812 35283.2500 88 75814.0000 22374.2424 257277 70.49%

    3048 1845 67785.5000 94 75814.0000 22374.2424 263180 70.49%

    3157 1885 38776.0000 89 75814.0000 22374.2424 267659 70.49%

    3282 1948 52070.2063 164 75814.0000 22374.2424 272805 70.49%

    3430 2005 40289.3889 120 75814.0000 22374.2424 276784 70.49%

    3552 2058 59139.6667 89 75814.0000 22374.2424 283625 70.49%

    3661 2093 53803.9375 152 75814.0000 23869.5596 292613 68.52%

    3781 2136 42788.8333 133 75814.0000 23869.5596 301061 68.52%

    Elapsed time = 218.75 sec. (33829.81 ticks, tree = 17.80 MB, solutions = 7)

    3908 2189 26141.0791 150 75814.0000 24764.0000 305917 67.34%

    4034 2254 41127.3333 99 75814.0000 24764.0000 311766 67.34%

    4154 2301 36243.8750 162 75814.0000 24770.3333 319366 67.33%

    4281 2362 27519.3206 153 75814.0000 24770.3333 323648 67.33%

    4395 2411 37289.2423 161 75814.0000 24774.0000 333175 67.32%

    4529 2477 41131.1250 121 75814.0000 24774.0000 337576 67.32%

    4684 2539 71314.5000 97 75814.0000 24774.0000 345804 67.32%

    4805 2578 36617.8333 103 75814.0000 24774.0000 354749 67.32%

    4934 2615 33280.5000 85 75814.0000 24774.0000 361757 67.32%

    5064 2683 69054.9444 152 75814.0000 24774.0000 367931 67.32%

    Elapsed time = 287.20 sec. (43595.88 ticks, tree = 34.25 MB, solutions = 7)

    .......

    .......

    .......

    Elapsed time = 18677.59 sec. (7070372.37 ticks, tree = 11411.29 MB, solutions = 7)

    Nodefile size = 9407.70 MB (8277.03 MB after compression)

    900562 675413 60313.5000 110 75814.0000 24877.1907 57812045 67.19%

    902621 676702 59782.0833 120 75814.0000 24877.1907 57948901 67.19%

    904547 678091 67665.3250 147 75814.0000 24877.1907 58079695 67.19%

    906446 679494 56547.7500 122 75814.0000 24877.1907 58197802 67.19%

    908348 680868 60795.9375 121 75814.0000 24877.1907 58331874 67.19%

    910385 682411 57051.7500 116 75814.0000 24877.1907 58438753 67.19%

    912208 683640 50452.5000 91 75814.0000 24877.1907 58559260 67.19%

    914137 684945 49777.7500 83 75814.0000 24877.1907 58695346 67.19%

    916005 686237 50296.5417 114 75814.0000 24877.1907 58814016 67.19%

    917896 687596 63117.6667 137 75814.0000 24877.1907 58951491 67.19%

    Elapsed time = 19095.56 sec. (7223069.00 ticks, tree = 11643.18 MB, solutions = 7)

    Nodefile size = 9639.81 MB (8480.72 MB after compression)

    919799 689022 54558.2857 123 75814.0000 24877.1907 59084110 67.19%

    921729 690346 43453.3333 102 75814.0000 24877.1907 59214815 67.19%

    923573 691715 67291.2000 113 75814.0000 24877.1907 59335125 67.19%

    925465 693114 43451.6667 76 75814.0000 24877.1907 59463491 67.19%

    927452 694504 54282.4722 93 75814.0000 24877.1907 59598461 67.19%

    929346 695839 45513.4583 117 75814.0000 24877.1907 59727629 67.19%

    931361 697314 74326.0000 124 75814.0000 24877.1907 59854641 67.19%

    933329 698701 51740.7172 148 75814.0000 24877.1907 59978487 67.19%

    935318 700149 61293.3125 99 75814.0000 24877.1907 60108316 67.19%

    937189 701452 60778.5430 146 75814.0000 24877.1907 60242724 67.19%

    Elapsed time = 19477.83 sec. (7375916.06 ticks, tree = 11884.27 MB, solutions = 7)

    Nodefile size = 9880.50 MB (8693.04 MB after compression)

    939082 702830 48286.6667 126 75814.0000 24877.1907 60365354 67.19%

    941015 704093 38273.3125 115 75814.0000 24877.1907 60502980 67.19%

    942697 705332 38031.0000 103 75814.0000 24877.1907 60649495 67.19%

    944394 706705 63790.2500 108 75814.0000 24877.1907 60765979 67.19%

    946311 708297 69280.2500 103 75814.0000 24877.1907 60864613 67.19%

    948097 709731 44189.4902 118 75814.0000 24877.1907 60968579 67.19%

    949927 711209 54113.0000 137 75814.0000 24877.1907 61075505 67.19%

    951666 712621 49786.5000 93 75814.0000 24877.1907 61181504 67.19%

    953508 714107 60783.6162 158 75814.0000 24877.1907 61292319 67.19%

    955391 715618 54971.1282 154 75814.0000 24877.1907 61399199 67.19%

    Elapsed time = 19898.45 sec. (7528718.02 ticks, tree = 12114.54 MB, solutions = 7)

    Nodefile size = 10111.15 MB (8896.63 MB after compression)

    957241 717110 43438.6169 126 75814.0000 24877.1907 61507731 67.19%

    959085 718486 42109.5000 98 75814.0000 24877.1907 61627070 67.19%

    960934 719887 62287.6875 132 75814.0000 24877.1907 61742130 67.19%

    962812 721353 63783.1026 124 75814.0000 24877.1907 61859825 67.19%

    964638 722792 48420.1522 93 75814.0000 24877.1907 61967372 67.19%

    966432 724176 61290.0000 114 75814.0000 24877.1907 62087757 67.19%

    968356 725654 71289.1875 120 75814.0000 24877.1907 62194558 67.19%

    970299 727139 43660.7009 126 75814.0000 24877.1907 62293843 67.19%

    972168 728553 43972.6250 117 75814.0000 24877.1907 62415147 67.19%

    973963 729816 41788.0000 86 75814.0000 24877.1907 62536378 67.19%

    Elapsed time = 20322.88 sec. (7681536.14 ticks, tree = 12361.55 MB, solutions = 7)

    Nodefile size = 10357.84 MB (9114.82 MB after compression)

    975737 731080 42998.5103 116 75814.0000 24877.1907 62663529 67.19%

    977466 732383 50494.7000 99 75814.0000 24877.1907 62784851 67.19%

    979274 733715 66303.2500 108 75814.0000 24877.1907 62902115 67.19%

    981119 735011 59776.4000 129 75814.0000 24877.1907 63017519 67.19%

    982869 736280 45290.8056 126 75814.0000 24877.1907 63137292 67.19%

    984711 737665 47539.8333 83 75814.0000 24877.1907 63246130 67.19%

    986547 739130 60625.0000 117 75814.0000 24877.1907 63370771 67.19%

    988349 740560 51283.1429 113 75814.0000 24877.1907 63489548 67.19%

    990123 741969 66875.2372 145 75814.0000 24877.1907 63597688 67.19%

    992062 743467 55172.5000 130 75814.0000 24877.1907 63717815 67.19%

    Elapsed time = 20716.34 sec. (7834373.69 ticks, tree = 12598.50 MB, solutions = 7)

    Nodefile size = 10594.99 MB (9324.83 MB after compression)

    993876 744813 50286.5455 118 75814.0000 24877.1907 63847389 67.19%

    995678 746225 45708.0714 107 75814.0000 24877.1907 63961154 67.19%

    997474 747574 49798.5417 118 75814.0000 24877.1907 64071216 67.19%

    999291 748914 68294.7564 128 75814.0000 24877.1907 64185657 67.19%

    1001057 750188 55786.0833 113 75814.0000 24877.1907 64305220 67.19%

    1002843 751483 50786.9000 95 75814.0000 24877.1907 64436283 67.19%

    1004678 752848 62989.7667 140 75814.0000 24877.1907 64554463 67.19%

    1006507 754214 47283.5000 63 75814.0000 24877.1907 64662124 67.19%

    1008288 755506 75209.3056 122 75814.0000 24877.1907 64780733 67.19%

    1010152 756870 44272.0556 107 75814.0000 24877.1907 64900561 67.19%

    Elapsed time = 21134.59 sec. (7987240.19 ticks, tree = 12829.79 MB, solutions = 7)

    Nodefile size = 10826.46 MB (9529.44 MB after compression)

    1011999 758262 65293.2500 142 75814.0000 24877.1907 65026334 67.19%

    1013865 759675 48780.7000 105 75814.0000 24877.1907 65146897 67.19%

    1015717 761136 48888.8125 134 75814.0000 24877.1907 65252166 67.19%

    1017565 762569 43784.0000 58 75814.0000 24877.1907 65366677 67.19%

    1019494 764066 41159.0667 126 75814.0000 24877.1907 65493203 67.19%

    1021394 765495 69131.1667 142 75814.0000 24877.1907 65617887 67.19%

    1023249 766904 41774.8649 129 75814.0000 24877.1907 65730910 67.19%

    1024917 768111 68796.0000 87 75814.0000 24877.1907 65861098 67.19%

    1026863 769530 48696.3000 118 75814.0000 24877.1907 65982638 67.19%

    1028658 770801 50037.5000 120 75814.0000 24877.1907 66108441 67.19%

    Elapsed time = 21527.78 sec. (8140080.94 ticks, tree = 13071.26 MB, solutions = 7)

    Nodefile size = 11068.06 MB (9742.99 MB after compression)

    1030395 772024 66047.2500 63 75814.0000 24877.1907 66246956 67.19%

    1032332 773548 64298.0000 61 75814.0000 24877.1907 66349802 67.19%

    1034302 774956 50289.0000 110 75814.0000 24877.1907 66465858 67.19%

    1036291 776423 75813.0000 77 75814.0000 24877.1907 66573890 67.19%

    1038326 777650 62046.6071 84 75814.0000 24877.1907 66703329 67.19%

    1040295 778806 65539.1667 134 75814.0000 24877.1907 66833538 67.19%

    1042273 780013 67798.0000 54 75814.0000 24877.1907 66968286 67.19%

    1044311 781246 53288.7917 118 75814.0000 24877.1907 67090947 67.19%

    1046290 782569 67295.8762 94 75814.0000 24877.1907 67218266 67.19%

    1048054 783854 47041.7500 105 75814.0000 24877.1907 67343529 67.19%

    Elapsed time = 21936.66 sec. (8292973.22 ticks, tree = 13295.87 MB, solutions = 7)

    Nodefile size = 11292.94 MB (9941.69 MB after compression)

    1049893 785091 53283.7692 109 75814.0000 24877.1907 67475071 67.19%

    1051552 786157 52784.4167 115 75814.0000 24877.1907 67620853 67.19%

    1053368 787409 67294.4545 128 75814.0000 24877.1907 67747655 67.19%

    1055191 788656 61285.0000 100 75814.0000 24877.1907 67882528 67.19%

    1057080 790059 52788.0000 91 75814.0000 24877.1907 67999676 67.19%

    1059002 791345 44052.1971 115 75814.0000 24877.1907 68130726 67.19%

    1060874 792682 44115.0625 118 75814.0000 24877.1907 68257847 67.19%

    1062607 793880 42281.1667 105 75814.0000 24877.1907 68386150 67.19%

    1064459 795111 45772.6250 112 75814.0000 24877.1907 68518423 67.19%

    1066384 796493 62625.6667 119 75814.0000 24877.1907 68646557 67.19%

    Elapsed time = 22330.44 sec. (8445970.18 ticks, tree = 13514.78 MB, solutions = 7)

    Nodefile size = 11511.53 MB (10135.15 MB after compression)

    1068170 797775 44776.5294 123 75814.0000 24877.1907 68768949 67.19%

    1070068 799147 64659.1333 123 75814.0000 24877.1907 68894884 67.19%

    1071973 800442 60565.4000 124 75814.0000 24877.1907 69033399 67.19%

    1073835 801856 66134.3333 107 75814.0000 24877.1907 69142760 67.19%

    1075768 803190 65999.2857 127 75814.0000 24877.1907 69263500 67.19%

    1077639 804443 55786.5000 95 75814.0000 24877.1907 69391258 67.19%

    1079540 805833 46545.5000 124 75814.0000 24877.1907 69513592 67.19%

    1081404 807190 70910.6250 138 75814.0000 24877.1907 69632803 67.19%

     

    There may be further error information in the clone logs.

     

    Cover cuts applied: 11

    Zero-half cuts applied: 129

    Gomory fractional cuts applied: 9

    Warning: MIP starts not constructed because of out-of-memory status.

     

    Root node processing (before b&c):

    Real time = 3.01 sec. (446.59 ticks)

    Parallel b&c, 4 threads:

    Real time = 22667.83 sec. (8569007.11 ticks)

    Sync time (average) = 0.00 sec.

    Wait time (average) = 0.00 sec.

    ------------

    Total (root+branch&cut) = 22670.84 sec. (8569453.70 ticks)

    Freeing branch-and-bound tree with 117468 nodes

    48000 nodes freed

    66000 nodes freed

    96000 nodes freed

    115000 nodes freed

     


    #CPLEXOptimizers
    #DecisionOptimization


  • 7.  Re: Error in Cplex

    Posted 11/11/14 02:49 AM

    OK, so you are running out of memory because the search tree gets too large. Can you post your .ops settings file here? Did you add the .ops file to your run configuration (otherwise it is just ignored)?

    You could also change the "directory for working files" to something like /tmp/mydir (the directory must exist) and then check whether CPLEX writes any files there at all. If no files are created there during the solve then something is wrong with your parameter settings.


    #CPLEXOptimizers
    #DecisionOptimization


  • 8.  Re: Error in Cplex

    Posted 11/11/14 09:54 AM

    Originally posted by: giannil


    When I set the parameter from selecting the variables on automatic it managed to give us a solution. Now I am trying it with more data. How can I see id the .ops file is added to our run configuration? I think it is because after changing the setting it worked.


    #CPLEXOptimizers
    #DecisionOptimization


  • 9.  Re: Error in Cplex

    Posted 11/17/14 08:44 AM

    Originally posted by: giannil


    After using more data we get this error again. Is it possible to make our code more efficient or is there anything else we can do?


    #CPLEXOptimizers
    #DecisionOptimization


  • 10.  Re: Error in Cplex

    Posted 11/21/14 03:51 AM

    Have you checked that CPLEX actually writes node files to disk?

    One option to improve things in general would be to check whether you can find a better/tighter formulation of your problem or whether you can implement a heuristic that quickly finds feasible solution CPLEX cannot find easily. These things can help to trim down the size of the search tree and thus save memory.


    #CPLEXOptimizers
    #DecisionOptimization


Related Content