Miroslaw Blocho, Jakub Nalepa

A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows (submitted to the EuroMPI conference, EuroMPI 2015)

New world's best results of 800-customer Li and Lim's tests: instance ID (routes#/total distance): GES variant

• lc1_8_2 (77/33329.26)
  
• lr1_8_6 (41/40488.25)
  
• lr1_8_7 (31/33431.22)
  
• lrc1_8_1 (66/35901.74)
  
• lrc1_8_3 (48/29276.29)
  
• lrc1_8_4 (34/23099.15)
  
• lrc1_8_5 (59/34909.37)
  
• lrc1_8_7 (52/33168.61)
  
• lrc1_8_8 (47/29814.93)
  
• lrc1_8_9 (46/29423.38)
  
• lrc2_8_3 (15/36127.35)
  
• lrc2_8_4 (11/39818.37)
  
• lrc2_8_5 (17/41062.80)
  

Updated: May 3, 2015