GradientDescent

Max Orders Route

Selection + vehicle routingRunning
Sep 21
Oct 31

Constraints

  • Every van starts and ends at the depot.
  • A van carries at most 120 orders.
  • A van drives at most 300 miles, round trip.
  • Each order is served by at most one van.

Runtime limits

  • Time limit per instance: 30s plus 0.2s per order.
  • 4 CPU cores and 2 GB of memory.
  • No network access during a run.
  • Write your code in one of Python, C, C++, or Java.

Scoring

  • A van that breaks capacity or distance scores 0, but the other vans still count.
  • Serving the same order with two vans voids the whole submission.
  • Timeouts, crashes, and errors in solve() score 0.
  • Feasible solutions are ranked by orders served. If two tie, the lower total distance wins.