Online Stochastic Routing

Description
Unlike in static Vehicle Routing Problem like in&#160;https://algorithmia.com/bounties/54 where the customers are known and fixed. In Online Stochastic Routing problem, customers arrive dynamically as the algorithm proceeds. Each customer request has a time window during which it can be served and, obviously, a request cannot be served before it occurs. Upon arrival, the algorithm must decide whether to accept or reject the request. If the request is accepted, the online algorithm must serve it before the time horizon. However, online algorithm must not commit a vehicle nor commit to a specific order with the routing plan upon acceptance [1].<div><br/></div><div>The input format is based on Solomon benchmark data&#160;(http://w.cba.neu.edu/~msolomon/problems.htm).</div><div><br/></div><div>The output acts like a service where with the given new request(s) for each moment, the online algorithm will return a new plan based on the new input.</div><div><div><br/></div><div>[1]&#160;Hentenryck, Pascal Van, and Russell Bent. Online stochastic combinatorial optimization. The MIT Press, 2009.</div></div>
Discussion
  • {{comment.username}}
Status
Active
submission(s) pending review
Bounty expires in
Bounty expired
Bounty
0
Tags
(no tags)