Abstract
The mixed fleet stochastic vehicle routing problem is considered in the paper. It is assumed that operations are performed by vehicles of different types. The model developed is based on the “route first — cluster second” approach. A heuristic algorithm based on space-filling curves is used to produce a giant Travelling Salesman tour. The giant tour is divided into smaller parts using the generalized Floyd algorithm. The final set of routes may be chosen after making a suitable multi-attribute decision making analysis.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
