## 4 The Algorithms
### The DSR-Fle Variant Algorithm
#### 4.2.3 Improvement on the Spl-DSR-Fle Algorithm
(1997) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. _Transp. Sci._**1997**, _31_, 170-186. [CrossRef]
* [PERSON] and [PERSON] (2006) [PERSON]; [PERSON] A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. _Comput. Oper. Res._**2006**, _33_, 875-893. [CrossRef]
* [PERSON] et al. (2014) [PERSON]; [PERSON]; [PERSON] The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. _Transp. Sci._**2014**, _48_, 500-520. [CrossRef]
* [PERSON] et al. (2016) [PERSON]; [PERSON]; [PERSON]; [PERSON] Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. _Oper. Res._**2016**, _64_, 1388-1405. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON] [PERSON]; [PERSON] Iterative Local-Search Heuristic for Weighted Vehicle Routing Problem. _IEEE Trans. Intell. Transp. Syst._**2020**, in press. * [PERSON] et al. (2010) [PERSON] [PERSON]; [PERSON]; [PERSON] Dynamic pickup and delivery problems. _Eur. J. Oper. Res._**2010**, _202_, 8-15. [CrossRef]
* [PERSON] et al. (2014) [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] Quantifying the benefits of vehicle pooling with shareability networks. _Proc. Natl. Acad. Sci. USA_**2014**, _111_, 13290-13294. [CrossRef] [PubMed]
* [PERSON] (1973) [PERSON] [PERSON]; [PERSON] [PERSON] \(\mathrm{n}\)\(5/2\) Algorithm for Maximum Matchings in Bipartite Graphs. _SIAM J. Comput._**1973**, \(2\), 225-231. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Minimizing Latency in Online Ride and Delivery Services. In Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, 23-27 April 2018; pp. 379-388. * [PERSON] et al. (2006) [PERSON]; [PERSON]; [PERSON] A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. _Eur. J. Oper. Res._**2006**, _174_, 1117-1139. [CrossRef]* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Community-Based Trip Sharing for Urban Commuting. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), New Orleans, LA, USA, 2-7 February 2018; pp. 6589-6597. * _[PERSON] and [PERSON] (2013)_ [PERSON]; [PERSON] Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI'13, Beijing, China, 3-9 August 2013; pp. 2885-2891. * _[PERSON] et al. (2019)_ [PERSON]; [PERSON]; [PERSON] ZAC: A Zone Path Construction Approach for Effective Real-Time Ridesharing. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2018, Berkeley, CA, USA, 11-15 July 2019; pp. 528-538. * _[PERSON] et al. (2019)_ [PERSON]; [PERSON]; [PERSON] An Online Ride-Sharing Path-Planning Strategy for Public Vehicle Systems. _IEEE Trans. Intell. Transp. Syst._**2019**, _20_, 616-627. [CrossRef]
* _[PERSON] (1977)_ [PERSON]; [PERSON] Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization. _J. ACM_**1977**, _24_, 192-198. [CrossRef]
* _[PERSON] and Johnson (1990)_ [PERSON]; [PERSON] Computers and Intractability: A Guide to the Theory of NP-Completeness; In Mathematical Sciences, W.H.Freeman: New York, NY, USA, 1990. * _[PERSON] (1998)_ [PERSON]; [PERSON] Collective dynamics of'small-world' networks. _Nature_**1998**, _393_, 440-442. [CrossRef] [PubMed]

**Publisher's Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. **