This week's lab involved solving a Vehicle Routing Problem (VRP). VRPs are used here to determine optimal routes for fleets of delivery vehicles using a single depot. Originally, the VRP solver was run with strict route zone restrictions generating an output where several orders were not filled, but profit was maximized. A second scenario (show at right) was used to allow more flexibility in routing and generated a solution in which all orders were filled. Customer service is important, thus the second scenario is the more desirable one.
No comments:
Post a Comment