Abstract
Vehicle Routing and Scheduling Problem (VRP) is an NP-hard problem. In this paper, an adaptive quantum genetic algorithm is proposed to solve the problem of vehicle routing and scheduling. The algorithm uses a binary encoding scheme. In the case of quantum variation using quantum rotation gate, the self-adaptive angular acceleration algorithm (SAAA) is proposed according to the difference of fitness value between the current individual and the optimal individual. On this basis, the strategy of probability-based random reverse rotation is adopted when evolution stagnates, and the evolutionary stagnate escape algorithm (ESEA) is proposed. The experimental results show that the proposed algorithm has some advantages in terms of convergence speed and the ability to find the optimal solution in vehicle routing and scheduling. Finally, according to the pre-set requirements for evolutionary efficiency, the evolutionary efficiency assessment algorithm (EEAA) is proposed, which allows evolution to terminate and output the current optimal solution when the threshold is exceeded.
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.
