Abstract
The Vehicle Routing Problem (VRP) is a well-known discrete optimization problem that has an impact on theoretical and practical applications. In this paper, a freight distribution model that includes a charging system located at the depot, making it feasible for real world-implementation, is proposed. Two different solution methods are proposed and compared: a genetic algorithm (GA) and a population-based simulated annealing (PBSA) with the number of moves increasing during the iterations. Among the variety of algorithm used to solve the VRP, population-based search methods are the most useful, due to the ability to update the memory at each iteration. To demonstrate the practical aspects of the proposed solution a case study is solved using travel time on a real network to evaluate the potentiality for a real-world application.
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.
