Abstract
Vehicle routing is a key success factor in logistics problems. A variation of vehicle routing problem (VRP), the heterogeneous fixed fleet VRP in which the vehicles available for distribution activities are characterised by different capacities and costs, is tackled. A hybrid firefly algorithm for optimising the routing of heterogeneous fixed fleet of vehicles in logistics distribution systems is presented. The principles and key steps of the proposed firefly algorithm are introduced in detail. Experimental results from solving the heterogeneous fixed fleet vehicle routing problem when tested on benchmark datasets are demonstrated. Moreover, the algorithm is compared with other algorithms solving similar problems in order to prove the effectiveness of the proposed hybrid firefly algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Industrial and Systems Engineering
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.