|Top Previous Next|
In OR-terms we solve the generalized vehicle routing problem (VRP). Not to optimality, but rather trying to find a "good" solution.
4 main kind of tasks are supported:
There is a lot of flexibility added:
•A resource period can start / stop at different depots (office, home address etc) or being open ended
•Resource types (typically vehicles) can have different capacities and costs
•Resources and jobs can have competences associated with them, so only resources with the correct competence gets matched with a job
•A job can pick up goods from one location and deliver it to another location (mixed pickup and delivery)
•A job can have multiple time windows defined (execute the job during one time window or another)
•Service time (time to execute a job) can be defined very flexible
This setup covers a lot of scheduling tasks in many industries, such as school bus routing, scheduling of maintenance jobs, delivery of various goods etc. In the chapter describing the input XML these are explained in more detail.
To minimize cost as defined by the resource types.