Datasets and results

Vehicle routing

• Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S. (2016) The capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. EURO Journal on Transportation and Logistics 5(2), 231-255. (doi:10.1007/s13676-014-0064-2)
• Instances (10-20 customers)


• Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S. (2017) Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. Networks 69(3), 301-316. (doi:10.1002/net.21738)
• Instances (50-100 customers)
• Detailed results on 10-20 customer instances

Integrated order picking - vehicle routing

• PhD Stef Moons
• PhD text
• Instances chapter 3
• Instances chapter 4 (set 1)
• Instances chapter 4 (set 2)
• Instances chapter 5


• Moons, S., Ramaekers, K., Caris, A., Arda, Y. (2017) Integration of order picking and vehicle routing in a B2C e-commerce context. Flexible Services and Manufacturing Journal (Forthcoming, doi:10.1007/s10696-017-9287-5)
• Instances


• Moons, S., Braekers, K., Ramaekers, K., Caris, A., Arda, Y. (2018) The value of integrating order picking and vehicle routing decisions in a B2C e-commerce environment. Submitted.
• Instances


• Ramaekers, K., Caris, A., Moons, S., van Gils, T. (2018) Using an integrated order picking-vehicle routing problem to study the impact of delivery time windows in e-commerce. Submitted.
• Instances

Home care scheduling

• Braekers, K., Hartl, R.F., Parragh, S.N., Tricoire, F. (2016) A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience. European Journal of Operational Research 248(2), 428-443. (doi:10.1016/j.ejor.2015.07.028)
• Instances
• Reference sets

Dial-a-ride problems / demand responsive transportation

• Braekers, K., Caris, A., Janssens, G.K. (2014) Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological 67, 166-186. (doi:10.1016/j.trb.2014.05.007)
• DARP instances
  • 20 pr instances (Cordeau and Laporte, 2003)
    • Instance are available here
    • Previous best known solutions are available here
    • New best known solutions: pr05, pr10, pr15, pr16, pr18, pr20
  • a and b instances (Cordeau, 2006)
    • Instance are available here
• H-DARP instances
• U, E and I instances up to 48 requests (Parragh, 2011): here
• New instances up to 96 requests: dataset U, dataset E, dataset I
• MD-H-DARP instances
• Same as H-DARP instances except no single vehicle depot at (0,0), but four vehicle depots at (-5,-5), (5,5), (-5,5) and (5,-5). For each instance, the available vehicles are assigned to the four depots as follows: the first vehicle to the first depot, the second vehicle to the second depot, ..., the fifth vehicle to the first depot, and so on.


• Neven, A., Braekers, K., Declercq, K., Wets, G., Janssens, D., Bellemans, T. (2015) Impact of different policy decisions on the resource requirements of a Demand Responsive Transport system. Transport Policy 44, 48-57. (doi:10.1016/j.tranpol.2015.06.011)
  • Results for an average weekend day: here
  
  
• Braekers, K., Kovacs A.A. (2016) A multi-period dial-a-ride problem with driver consistency. Transportation Research Part B: Methodological 94, 355-377. (doi:10.1016/j.trb.2016.09.010)
  • instances
  • detailed results

Drayage operations

• Braekers, K., Caris, A., Janssens, G.K. (2013) Integrated planning of loaded and empty container movements. OR Spectrum 35(2), 457-478. (doi:10.1007/s00291-012-0284-5)
• Problem instances
• Structure
• 48 instances


• Braekers, K., Caris, A., Janssens, G.K. (2014) Bi-objective optimization of drayage operations in the service area of intermodal terminals. Transportation Research Part E: Logistics and Transportation Review 65, 50-69. (doi:10.1016/j.tre.2013.12.012)
• Problem instances
  
• Structure
• 48 instances (from paper OR Spectrum)
• 16 additional large-scale instances
• Results
• Three solution algorithms:
  
• Results of the IM algorithm: summary
• Results of the DA algorithm: summary
• Results of the DA-TS algorithm: summary
• Analysis of improvements:
  
• Results of DA + intra-route: summary
• Results of DA + tabu search: summary
• Results of DA + reduce T_max: summary
• Large-scale instances:
  
• Results of the DA-TS algorithm: summary
• Reference sets
• Normalized hypervolume indicator:
• For each instance, the reference point is equal to the set of the worst objective values over all six variants of the algorithm (after dominated solutions have been deleted)
• Unary epsilon indicator
• The reference set consists of the set of non-dominated solutions obtained over all six variants of the algorithm together

Contact information