Abstract
As a powerful measure to alleviate greenhouse gas emissions and global warming issue, new energy vehicle (NEV) has aroused extensive attention from the whole society in recent years. In the past few decades, many studies have been conducted on the dispatch of traditional fuel-driven vehicles. As a means of transportation, NEV has the characteristics of fuel-driven vehicles, but the dispatch is different because of its unique refueling manner. With the popularization of NEV, its unique dispatch research is imminent. This paper comprehensively considers electricity and charging piles during the NEV dispatch (NEVD) process. An NEVD framework containing a novel dispatch model is proposed, which elaborates the application service of NEV. To the best of our knowledge, this study is the first to combine NEVD with service system. Based on the formulated model, an efficient ant colony system (EACS) approach enhanced by pre-selection strategy and local pruning strategy is designed to dispatch NEVs to passengers. Experiments are carried out to investigate the applicable scenarios of ACS-based algorithms. The results verify that the proposed EACS algorithm is an effective and efficient approach to solve the NEVD problem.
Highlights
W ITH the growing travel needs and the development of mobile internet technology, online taxi booking has become very popular in current daily life [1]
As efficient ant colony system (EACS) is different from ant colony system (ACS) in the pre-selection strategy and local pruning strategy to reduce the running time on resource-rich scenario (i.e., M is much larger than N), the EACS is only applied in the resource-rich scenario and is to compare with FCFS, greedy algorithm, multi-agent assignment
In order to investigate the effectiveness of two strategies in the proposed EACS, a further comparison is conducted between EACS and its variants on test D11-D15
Summary
W ITH the growing travel needs and the development of mobile internet technology, online taxi booking has become very popular in current daily life [1]. Vehicle dispatch is usually performed by a centralized service platform in order to facilitate the unified management of vehicle resources This global dispatch mode provides customers with strong security and high efficiency, while it imposes heavy computational burden to the dispatch center. Some heuristic algorithms are proposed to solve taxi dispatch problem [24]–[26]. LIANG et al.: EFFICIENT ACS APPROACH FOR NEVD PROBLEM approach combining simulated annealing and insertion heuristic to assign passenger requests in real time. As NEV dispatch (NEVD) problem can be modeled as a COP similar to taxi dispatch (i.e., taxipassenger matching) problem, ACS is applicable and suitable to solve it. The NEVD problem is much more challenge than traditional fuel-driven taxi dispatch due to its more complex constraints such as electricity and charging facilities.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
