public class BicycleMessenger extends Object
Statement of the problem (see Stackoverflow: http://stackoverflow.com/questions/19080537/bicycle-messenger-tsppd-with-optaplanner/20412598#20412598):
Optimize the routes for a bicycle messenger service! Assume 5 messengers that have to pick up 30 envelopes distributed through the city. These 5 messengers are distributed through the city as well. Thus there is no single depot and they do not need to go back to their original starting location.
Additional hard constraints: 1) Every messenger can carry up to fifteen envelopes 2) The way an evelopes travels should be less than three times the direct route (so delivery does not take too long)
Thus this problem is basically a Capacitated VRP with Pickups and Deliveries, Multiple Depots, Open Routes and Time Windows/Restrictions.
| Constructor and Description |
|---|
BicycleMessenger() |
public static void main(String[] args) throws IOException
IOExceptionCopyright © 2013–2019. All rights reserved.