Marcin Cwiek, Jakub Nalepa, Marcin Dublanski

How to Generate Benchmark for Complex Routing Problems? (submitted to ACIIDS 2016)

Problem instances used during the qualifying round of Deadline24, generated using HeBeG:

• r1
  
• r2
  
• r3
  
• r4
  
• r5
  
• r6
  
• r7
  
• r8
  
• r9
  
• r10
  

Input description:

The first line contains two number separated with a single whitespace: N Q

The second line contains two number separated with a single whitespace: position of the depot

Each of the following lines contains: client ID, its position, time window, demand, and service time