A methodology for creating parking plans

Mathematical formulations of the two problems from the article

• Mathematical formulations (update 29th January 2015)

Test instances on the most constrained deliveries (extracted from industrial data)

• File format
• 2014-1:
  • Group positioning problem
    • DB
    • DC
    • DJ
    • DK
    • DV
  • Schedule assignment problem
    • DB   S03-S04/S05 
    • DC   S06  S50  S59 
    • DJ   S33  S34/S37  S35  S38  S50  S57  S59
    • DK   S05
    • DV   S59
• 2014-2:
  • Group positioning problem
    • DB
    • DC
    • DJ
    • DK
    • DV
  • Schedule assignment problem
    • DB   S03-S04/S05  S06
    • DC   S06  S50  S59
    • DJ   S33/S35  S34/S37  S38  S50  S57  S59
    • DK   S05
    • DV   S59
• 2014-3:
  • Group positioning problem
    • DB
    • DC
    • DJ
    • DK
    • DV
  • Schedule assignment problem
    • DB   S03-S04/S05/S06 
    • DC   S06  S50  S59
    • DJ   S301/S37  S35  S38  S50  S57  S59
    • DK   S05
    • DV   S59
• 2014-Auto:
  • Group positioning problem
    • DB
    • DC
    • DJ (more vehicles than available space)
    • DK
    • DV
  • Schedule assignment problem
    • DB   S03-S04/S05 
    • DC   S06  S50  S59
    • DJ   S34/S37  S35  S38  S50  S57  S59  (9 vehicles from S33 + 3 vehicles from S59 not positioned)
    • DK   S05
    • DV   S59
• 2015-1:
  • Group positioning problem
    • DB
    • DC
    • DJ
    • DK
    • DV
  • Schedule assignment problem
    • DB   S03-S04/S05/S06 
    • DC   S06  S50  S59
    • DJ   S301  S35/S37/S38  S50  S57  S59
    • DK   S05
    • DV   S59
• 2015-2:
  • Group positioning problem
    • DB
    • DC
    • DJ
    • DK
    • DV
  • Schedule assignment problem
    • DB   S03-S04/S05/S06 
    • DC   S06  S50  S59
    • DJ   S301  S35/S37/S38  S50  S57  S59
    • DK   S05
    • DV   S59

Example of constructed parking plans