An algorithm for route optimization of bicycle scheduling with multiple dispatching centers

In this paper, an algorithm for route optimization of public bicycle scheduling is studied to optimize dispatch, including number and route of trucks, the location and the schedule of departure of every truck etc. To solve the complex problem, a mathematical model is implemented. In addition, an improved adaptive hybrid ant colony optimization (IAHACO) algorithm is presented by using supplementary service strategy which firstly concerned in this paper, path weight and improved shuffled frog leaping algorithm (SFLA). The new algorithm is verified with 20 data sets and the results show that the IAHACO is an efficacious algorithm to solve the problem. The IAHACO can avoid the stagnation of ant colony optimization (ACO).


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01723843
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 27 2019 10:38AM