Abstract
Vehicle routing problem with soft time windows (VRPSTW) is represented as a multi-objective optimization problem which both considering the number of vehicles and the total cost (distance). We simultaneously propose an improved genetic algorithm to solve this problem. In this algorithm, we solve the multi-objective optimization problem by variation of fitness function. We are not only increase the search ability of the algorithm but also satisfied the requirement of population diversity by using the improved crossover operator. We add the local search algorithm to make complete for the deficiency of the weak ability. The experiment result states that the algorithm is efficient for VRPSTW and can provide the useful support to make a better decision of transport problems.
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.
