. Wang, G. Comparative Study on Solving the Minimum Fleet of Shared Autonomous Vehicles, pages 522-534.

Paper doi abstract bibtex

Paper doi abstract bibtex

Assuming that all travel demands are met by shared autonomous vehicle (SAV), the paper compares graph theory method and the multiple travelling salesman problem (MTSP) method in solving the minimum fleet size problem. With the trajectory data of 50 new energy private cars in Shanghai for 1 year, travel demands are extracted. A specific method for calculating whether two trips can be served by one SAV is developed. Then, the minimum fleet size problem are transformed into the minimum path cover problem on directed graph (graph theory method) and MTSP shortest path problem (MTSP method). Hopcroft-Karp algorithm is adopted in graph theory method, while genetic algorithm (GA) is adopted in the MTSP method. Results show that graph theory method outperforms the MTSP method both in the quality of solution and the computing time. Results indicate that a SAV can replace 2.5 traditional private cars on average.

@inbook{Wang_ComparativeStudy, author = {Guan Wang }, title = {Comparative Study on Solving the Minimum Fleet of Shared Autonomous Vehicles}, booktitle = {CICTP 2020}, chapter = {}, pages = {522-534}, doi = {10.1061/9780784483053.045}, URL = {https://ascelibrary.org/doi/abs/10.1061/9780784483053.045}, eprint = {https://ascelibrary.org/doi/pdf/10.1061/9780784483053.045}, abstract = { Assuming that all travel demands are met by shared autonomous vehicle (SAV), the paper compares graph theory method and the multiple travelling salesman problem (MTSP) method in solving the minimum fleet size problem. With the trajectory data of 50 new energy private cars in Shanghai for 1 year, travel demands are extracted. A specific method for calculating whether two trips can be served by one SAV is developed. Then, the minimum fleet size problem are transformed into the minimum path cover problem on directed graph (graph theory method) and MTSP shortest path problem (MTSP method). Hopcroft-Karp algorithm is adopted in graph theory method, while genetic algorithm (GA) is adopted in the MTSP method. Results show that graph theory method outperforms the MTSP method both in the quality of solution and the computing time. Results indicate that a SAV can replace 2.5 traditional private cars on average. } }

Downloads: 0

{"_id":"GsYNtvsB3PcDfHPxE","bibbaseid":"wang-comparativestudyonsolvingtheminimumfleetofsharedautonomousvehicles","author_short":["Wang, G."],"bibdata":{"bibtype":"inbook","type":"inbook","author":[{"firstnames":["Guan"],"propositions":[],"lastnames":["Wang"],"suffixes":[]}],"title":"Comparative Study on Solving the Minimum Fleet of Shared Autonomous Vehicles","booktitle":"CICTP 2020","chapter":"","pages":"522-534","doi":"10.1061/9780784483053.045","url":"https://ascelibrary.org/doi/abs/10.1061/9780784483053.045","eprint":"https://ascelibrary.org/doi/pdf/10.1061/9780784483053.045","abstract":"Assuming that all travel demands are met by shared autonomous vehicle (SAV), the paper compares graph theory method and the multiple travelling salesman problem (MTSP) method in solving the minimum fleet size problem. With the trajectory data of 50 new energy private cars in Shanghai for 1 year, travel demands are extracted. A specific method for calculating whether two trips can be served by one SAV is developed. Then, the minimum fleet size problem are transformed into the minimum path cover problem on directed graph (graph theory method) and MTSP shortest path problem (MTSP method). Hopcroft-Karp algorithm is adopted in graph theory method, while genetic algorithm (GA) is adopted in the MTSP method. Results show that graph theory method outperforms the MTSP method both in the quality of solution and the computing time. Results indicate that a SAV can replace 2.5 traditional private cars on average. ","bibtex":"@inbook{Wang_ComparativeStudy,\nauthor = {Guan Wang },\ntitle = {Comparative Study on Solving the Minimum Fleet of Shared Autonomous Vehicles},\nbooktitle = {CICTP 2020},\nchapter = {},\npages = {522-534},\ndoi = {10.1061/9780784483053.045},\nURL = {https://ascelibrary.org/doi/abs/10.1061/9780784483053.045},\neprint = {https://ascelibrary.org/doi/pdf/10.1061/9780784483053.045},\n abstract = { Assuming that all travel demands are met by shared autonomous vehicle (SAV), the paper compares graph theory method and the multiple travelling salesman problem (MTSP) method in solving the minimum fleet size problem. With the trajectory data of 50 new energy private cars in Shanghai for 1 year, travel demands are extracted. A specific method for calculating whether two trips can be served by one SAV is developed. Then, the minimum fleet size problem are transformed into the minimum path cover problem on directed graph (graph theory method) and MTSP shortest path problem (MTSP method). Hopcroft-Karp algorithm is adopted in graph theory method, while genetic algorithm (GA) is adopted in the MTSP method. Results show that graph theory method outperforms the MTSP method both in the quality of solution and the computing time. Results indicate that a SAV can replace 2.5 traditional private cars on average. }\n}\n\n\n\n\n\n\n\n","author_short":["Wang, G."],"key":"Wang_ComparativeStudy","id":"Wang_ComparativeStudy","bibbaseid":"wang-comparativestudyonsolvingtheminimumfleetofsharedautonomousvehicles","role":"author","urls":{"Paper":"https://ascelibrary.org/doi/abs/10.1061/9780784483053.045"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inbook","biburl":"https://bibbase.org/network/files/EwQtTLjCR56yu8afT","dataSources":["Jt47k4jCiBxRQqLJE","NigsKECsozzsGvF7X"],"keywords":[],"search_terms":["comparative","study","solving","minimum","fleet","shared","autonomous","vehicles","wang"],"title":"Comparative Study on Solving the Minimum Fleet of Shared Autonomous Vehicles","year":null}