Journal of Shanghai Jiaotong University ›› 2017, Vol. 51 ›› Issue (2): 174-.

Previous Articles     Next Articles

Scheduling Algorithm for Vehicles in Cybernetic Transportation System

LI Shuanga,YANG Mingb,WANG Chunxianga,WANG Bingb   

  1. a. Research Institute of Robotics; b. Department of Automation, Shanghai Key Laboratory of
     Navigation and  Location Services, Shanghai Jiao Tong University, Shanghai 200240, China
  • Online:2017-02-28 Published:2017-02-28

Abstract:

Combining the advantage of greedy algorithm with that of genetic algorithm, this paper presents a new algorithm named proximity cluster greedy and genetic algorithm. This paper also designs a simulation system for cybernetic transportation system to test all the three algorithms and collect the experiment results. The results show that when the system tends to be steady, the proximity cluster greedy and genetic algorithm can efficiently decrease the response time and avoid the requests’ starving, so this algorithm is a good choice for the cybernetic transportation system.

Key words: vehicles, scheduling, cybernetic transportation system (CTS), proximity cluster reedy and genetic algorithm, simulation system

CLC Number: