Abstract
This work describes an application of a multi-depot heterogeneous fixed fleet open vehicle routing problem. A contractor owns a fleet of vehicles with different capacities and running costs. The fleet is used to transport craftsmen from their homes to assigned project sites and back, with some of the craftsmen appointed as drivers while others are passengers. An optimisation model is described that enables the contractor to minimise the transportation costs, and a computational study shows that the model can be solved to optimality for realistically sized instances using a standard mixed-integer programming solver. A variant of the problem is also considered, where the assignment of craftsmen to projects is not fixed a priori. For this variant, several simple heuristic rules are investigated to generate project assignments, and computational results show that they are able to find improved assignments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Operations Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
