Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions

References

• Abdolmaleki M, Masoud N, Yin Y (2019) Vehicle-to-vehicle wireless power transfer: Paving the way toward an electrified transportation system. Transportation Res. Part C Emerging Tech. 103(June):261–280.Crossref, Google Scholar
• Agatz N, Erera A, Savelsbergh M, Wang X (2010) Sustainable passenger transportation: Dynamic ride-sharing. ERIM Report ERS-2010-010-LIS, Erasmus Institute of Management, Erasmus University Rotterdam, Rotterdam, Netherlands.Google Scholar
• Agatz N, Erera AL, Savelsbergh MW, Wang X (2011) Dynamic ride-sharing: A simulation study in metro Atlanta. Procedia Soc. Behav. Sci. 17(9):532–550.Crossref, Google Scholar
• Agatz N, Erera A, Savelsbergh M, Wang X (2012) Optimization for dynamic ride-sharing: A review. Eur. J. Oper. Res. 223(2):295–303.Crossref, Google Scholar
• Alonso M, Amaris H, Germain JG, Galan JM (2014) Optimal charging scheduling of electric vehicles in smart grids by heuristic algorithms. Energies 7(4):2449–2475.Crossref, Google Scholar
• Alonso-Mora J, Samaranayake S, Wallar A, Frazzoli E, Rus D (2017) On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Natl. Acad. Sci. USA 114(3):462–467.Crossref, Google Scholar
• Amey A (2011) A proposed methodology for estimating rideshare viability within an organization, applied to the MIT community. Proc. Transportation Res. Board 90th Annual Meeting, (Transportation Research Board, Washington, DC), 1–16.Google Scholar
• An S, Nam D, Jayakrishnan R (2019) Impacts of integrating shared autonomous vehicles into a peer-to-peer ridesharing system. Procedia Comput. Sci. 151:511–518.Crossref, Google Scholar
• Armant V, Brown KN (2014) Minimizing the driving distance in ride sharing systems. 2014 IEEE 26th Internat. Conf. Tools Artificial Intelligence (IEEE, Piscataway, NJ), 568–575.Google Scholar
• Baldacci R, Maniezzo V, Mingozzi A (2004) An exact method for the car pooling problem based on Lagrangean column generation. Oper. Res. 52(3):422–439.Link, Google Scholar
• Bei X, Zhang S (2018) Algorithms for trip-vehicle assignment in ride-sharing. Proc. 32nd AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 3–9.Google Scholar
• Ben Cheikh S, Tahon C, Hammadi S (2017) An evolutionary approach to solve the dynamic multihop ridematching problem. Simulation 93(1):3–19.Crossref, Google Scholar
• Benjaafar S, Hu M (2020) Operations management in the age of the sharing economy: What is old and what is new? Manufacturing Service Oper. Management 22(1):93–101.Link, Google Scholar
• Benjaafar S, Bernhard H, Courcoubetis C (2017) Drivers, riders and service providers: The impact of the sharing economy on mobility. Proc. 12th Workshop on the Econom. of Networks, Systems and Computat. (ACM, New York), 1–6.Google Scholar
• Bimpikis K, Candogan O, Saban D (2019) Spatial pricing in ride-sharing networks. Oper. Res. 67(3):744–769.Link, Google Scholar
• Boyacı B, Zografos KG, Geroliminis N (2015) An optimization framework for the development of efficient one-way car-sharing systems. Eur. J. Oper. Res. 240(3):718–733.Crossref, Google Scholar
• Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.Link, Google Scholar
• Cachon GP, Daniels KM, Lobel R (2017) The role of surge pricing on a service platform with self-scheduling capacity. Manufacturing Service Oper. Management 19(3):368–384.Link, Google Scholar
• Calvo RW, de Luigi F, Haastrup P, Maniezzo V (2004) A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13):2263–2278.Crossref, Google Scholar
• Cangialosi E, Di Febbraro A, Sacco N (2016) Designing a multimodal generalised ride sharing system. IET Intelligent Transport Systems 10(4):227–236.Crossref, Google Scholar
• Chan ND, Shaheen SA (2012) Ridesharing in North America: Past, present, and future. Transportation Rev. 32(1):93–112.Crossref, Google Scholar
• Chang J, Yu M, Shen S, Xu M (2017) Location design and relocation of a mixed car-sharing fleet with a CO2 emission constraint. Service Sci. 9(3):205–218.Link, Google Scholar
• Chen Y, Hu M (2020) Pricing and matching with forward-looking buyers and sellers. Manufacturing Service Oper. Management, 22(4):717–734.Link, Google Scholar
• Chen W, Mes M, Schutten M, Quint J (2019) A ride-sharing problem with meeting points and return restrictions. Transportation Sci. 53(2):401–426.Link, Google Scholar
• Chou SK, Jiau MK, Huang SC (2016) Stochastic set-based particle swarm optimization based on local exploration for solving the carpool service problem. IEEE Trans. Cybernetics 46(8):1771–1783.Crossref, Google Scholar
• Clewlow RR, Mishra GS (2017) Disruptive transportation: The adoption, utilization, and impacts of ride-hailing in the United States. Research Report UCD-ITS-RR-17-07, Institute of Transportation Studies, University of California, Davis, Davis.Google Scholar
• Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573–586.Link, Google Scholar
• Correia GHDA, Jorge DR, Antunes DM (2014) The added value of accounting for users’ flexibility and information on the potential of a station-based one-way car-sharing system: An application in Lisbon, Portugal. J. Intelligent Transportation Systems 18(3):299–308.Crossref, Google Scholar
• Cui S, Li K, Yang L, Wang J (2019) Slugging: Casual carpooling for urban transit. Working paper, Georgetown University, Washington, DC.Google Scholar
• Desaulniers G, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6):1388–1405.Link, Google Scholar
• Di Febbraro A, Gattorna E, Sacco N (2013) Optimization of dynamic ridesharing systems. Transportation Res. Record 2359(1):44–50.Crossref, Google Scholar
• Duan R, Pettie S (2014) Linear-time approximation for maximum weight matching. J. ACM 61(1):1–23.Crossref, Google Scholar
• Duan R, Su HH (2012) A scaling algorithm for maximum weight matching in bipartite graphs. Rabani Y, ed. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1413–1424.Google Scholar
• Edmonds J (1965a) Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bureau Standards 69B(1–2):125–130.Google Scholar
• Edmonds J (1965b) Paths, trees, and flowers. Canadian J. Math. 17:449–467.Crossref, Google Scholar
• Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2):248–264.Crossref, Google Scholar
• Ersal T, Kolmanovsky I, Masoud N, Ozay N, Scruggs J, Vasudevan R, Orosz G (2020) Connected and automated road vehicles: State of the art and future challenges. Vehicle Systems Dynam. 58(5):672–704.Crossref, Google Scholar
• Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3):596–615.Crossref, Google Scholar
• Fu L (2002) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transportation Res. Part B Methodological 36(6):485–506.Crossref, Google Scholar
• Furuhata M, Dessouky M, Ordóñez F, Brunet ME, Wang X, Koenig S (2013) Ridesharing: The state-of-the-art and future directions. Transportation Res. Part B Methodological 57(November):28–46.Crossref, Google Scholar
• Gabow HN (1990) Data structures for weighted matching and nearest common ancestors with linking. Proc. 1st Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 434–443.Google Scholar
• Gabow HN, Tarjan RE (1989) Faster scaling algorithms for network problems. SIAM J. Comput. 18(5):1013–1036.Crossref, Google Scholar
• Gabow HN, Tarjan RE (1991) Faster scaling algorithms for general graph matching problems. J. ACM 38(4):815–853.Crossref, Google Scholar
• Ghoseiri K (2012) Dynamic rideshare optimized matching problem. Unpublished PhD thesis, University of Maryland, College Park.Google Scholar
• Gomes R (2014) Optimal auction design in two-sided markets. RAND J. Econom. 45(2):248–272.Crossref, Google Scholar
• Guda H, Subramanian U (2019) Your Uber is arriving: Managing on-demand workers through surge pricing, forecast communication, and worker incentives. Management Sci. 65(5):1995–2014.Abstract, Google Scholar
• He L, Mak HY, Rong Y, Shen ZJM (2017) Service region design for urban electric vehicle sharing systems. Manufacturing Service Oper. Management 19(2):309–327.Link, Google Scholar
• Healy P, Moll R (1995) A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83(1):83–104.Crossref, Google Scholar
• Herbawi W, Weber M (2011a) Ant colony vs. genetic multiobjective route planning in dynamic multi-hop ridesharing. 2011 IEEE 23rd Internat. Conf. Tools Artificial Intelligence (IEEE, Piscataway, NJ), 282–288.Google Scholar
• Herbawi W, Weber M (2011b) Evolutionary multiobjective route planning in dynamic multi-hop ridesharing. Merz P, Hao JK, eds. Eur. Conf. Evolutionary Comput. Combin. Optim. (Springer, Berlin), 84–95.Google Scholar
• Herbawi W, Weber M (2012) The ridematching problem with time windows in dynamic ridesharing: A model and a genetic algorithm. 2012 IEEE Congress Evolutionary Comput. (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Hopcroft JE, Karp RM (1973) An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4):225–231.Crossref, Google Scholar
• Hosni H, Naoum-Sawaya J, Artail H (2014) The shared-taxi problem: Formulation and solution methods. Transportation Res. Part B Methodological 70(December):303–318.Crossref, Google Scholar
• Jacob J, Roet-Green R (2018) Ride solo or pool: Designing price-service menus for a ride-sharing platform. Working Paper 3008136, Simon Business School, University of Rochester, Rochester.Google Scholar
• Jaw JJ, Odoni AR, Psaraftis HN, Wilson NH (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Res. Part B Methodological 20(3):243–257.Crossref, Google Scholar
• Jung J, Jayakrishnan R, Park JY (2016) Dynamic shared-taxi dispatch algorithm with hybrid-simulated annealing. Comput. Aided Civil Infrastructure Engrg. 31(4):275–291.Crossref, Google Scholar
• Kelly KL (2007) Casual carpooling—Enhanced. J. Public Transportation 10(4):119–130.Crossref, Google Scholar
• Ketabi R, Alipour B, Helmy A (2018) Playing with matches: Vehicular mobility through analysis of trip similarity and matching. Proc. 26th ACM SIGSPATIAL Internat. Conf. Adv. Geographic Inform. Systems (ACM, New York), 544–547.Google Scholar
• Kleiner A, Nebel B, Ziparo VA (2011) A mechanism for dynamic ride sharing based on parallel auctions. Walsh T, ed. Proc. 22nd Internat. Joint Conf. Artificial Intelligence, Vol. 1 (AAAI Press, Menlo Park, CA), 266–272.Google Scholar
• Lee A, Savelsbergh M (2015) Dynamic ridesharing: Is there a role for dedicated drivers? Transportation Res. Part B Methodological 81(Part 2, November):483–497.Crossref, Google Scholar
• Li S, Mi CC (2014) Wireless power transfer for electric vehicle applications. IEEE J. Emerging Selected Topics Power Electronics 3(1):4–17.Google Scholar
• Lloret-Batlle R, Masoud N, Nam D (2017) Peer-to-peer ridesharing with ride-back on high-occupancy-vehicle lanes: Toward a practical alternative mode for daily commuting. Transportation Res. Record 2668(1):21–28.Crossref, Google Scholar
• Long J, Tan W, Szeto W, Li Y (2018) Ride-sharing with travel time uncertainty. Transportation Res. Part B Methodological 118(December):143–171.Crossref, Google Scholar
• Ma S, Zheng Y, Wolfson O (2013) T-share: A large-scale dynamic taxi ridesharing service. 2013 IEEE 29th Internat. Conf. Data Engrg. (IEEE, Piscataway, NJ), 410–421.Google Scholar
• Madsen OB, Ravn HF, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60(1):193–208.Crossref, Google Scholar
• Masoud N, Jayakrishnan R (2016) Formulations for optimal shared ownership and use of autonomous or driverless vehicles. Proc. Transportation Res. Board 95th Annual Meeting (Transportation Research Board, Washington DC), 1–17.Google Scholar
• Masoud N, Jayakrishnan R (2017a) A decomposition algorithm to solve the multi-hop peer-to-peer ride-matching problem. Transportation Res. Part B Methodological 99(May):1–29.Crossref, Google Scholar
• Masoud N, Jayakrishnan R (2017b) A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system. Transportation Res. Part B Methodological 106(December):218–236.Crossref, Google Scholar
• Masoud N, Jayakrishnan R (2017c) Autonomous or driver-less vehicles: Implementation strategies and operational concerns. Transportation Res. Part E Logist. Transportation Rev. 108(December):179–194.Crossref, Google Scholar
• Masoud N, Lloret-Batlle R, Jayakrishnan R (2017a) Using bilateral trading to increase ridership and user permanence in ridesharing systems. Transportation Res. Part E Logist. Transportation Rev. 102(June):60–77.Crossref, Google Scholar
• Masoud N, Nam D, Yu J, Jayakrishnan R (2017b) Promoting peer-to-peer ridesharing services as transit system feeders. Transportation Res. Record 2650(1):74–83.Crossref, Google Scholar
• Masoud S, Son YJ, Masoud N, Jayakrishnan J (2019) Impact of traffic conditions and carpool lane availability on peer to peer ridesharing demand. Working paper, University of Arizona, Tucson.Google Scholar
• MirHassani S, Ebrazi R (2013) A flexible reformulation of the refueling station location problem. Transportation Sci. 47(4):617–628.Link, Google Scholar
• Mote JE, Whitestone Y (2011) The social context of informal commuting: Slugs, strangers and structuration. Transportation Res. Part A Policy Practice 45(4):258–268.Crossref, Google Scholar
• Najmi A, Rey D, Rashidi TH (2017) Novel dynamic formulations for real-time ride-sharing systems. Transportation Res. Part E Logist. Transportation Rev. 108(December):122–140.Crossref, Google Scholar
• Nam D, Yang D, An S, Yu JG, Jayakrishnan R, Masoud N (2018) Designing a transit-feeder system using multiple sustainable modes: Peer-to-peer (P2P) ridesharing, bike sharing, and walking. Transportation Res. Record 2672(8):754–763.Crossref, Google Scholar
• Nourinejad M, Roorda MJ (2015) Carsharing operations policies: A comparison between one-way and two-way systems. Transportation 42(3):497–518.Crossref, Google Scholar
• Nourinejad M, Roorda MJ (2016) Agent based model for dynamic ridesharing. Transportation Res. Part C Emerging Tech. 64(March):117–132.Crossref, Google Scholar
• Ordóñez F, Dessouky MM (2017) Dynamic ridesharing. Batta R, Peng J, eds. Leading Developments from INFORMS Communities, Tutorials in Operations Research (INFORMS, Catonsville, MD), 212–236.Abstract, Google Scholar
• Orlin JB (1993) A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2):338–350.Link, Google Scholar
• Orlin JB (1997) A polynomial time primal network simplex algorithm for minimum cost flows. Math. Programming 78(2):109–129.Crossref, Google Scholar
• Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• Parvez M, Mekhilef S, Tan NM, Akagi H (2014) Model predictive control of a bidirectional AC-DC converter for V2G and G2V applications in electric vehicle battery charger. 2014 IEEE Transportation Electrification Conf. Expo (IEEE, Piscataway, NJ), 1–6.Google Scholar
• Pelzer D, Xiao J, Zehe D, Lees MH, Knoll AC, Aydt H (2015) A partition-based match making algorithm for dynamic ridesharing. IEEE Trans. Intelligent Transportation Systems 16(5):2587–2598.Crossref, Google Scholar
• Qi W, Shen ZJM (2019) A smart-city scope of operations management. Production Oper. Management 28(2):393–406.Crossref, Google Scholar
• Regue R, Masoud N, Recker W (2016) Car2work: Shared mobility concept to connect commuters with workplaces. Transportation Res. Record 2542(1):102–110.Crossref, Google Scholar
• Ropke S, Cordeau J-F (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267–286.Link, Google Scholar
• Sanchez-Martin P, Sanchez G, Morales-España G (2012) Direct load control decision model for aggregated EV charging points. IEEE Trans. Power Systems 27(3):1577–1584.Crossref, Google Scholar
• Santi P, Resta G, Szell M, Sobolevsky S, Strogatz SH, Ratti C (2014) Quantifying the benefits of vehicle pooling with shareability networks. Proc. Natl. Acad. Sci. USA 111(37):13290–13294.Crossref, Google Scholar
• Sayarshad HR, Chow JY (2015) A scalable non-myopic dynamic dial-a-ride and pricing problem. Transportation Res. Part B Methodological 81(Part 2, November):539–554.Crossref, Google Scholar
• Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transportation Sci. 48(4):500–520.Link, Google Scholar
• Shaheen S, Chan N (2016) Mobility and the sharing economy: Potential to facilitate the first-and last-mile public transit connections. Built Environ. 42(4):573–588.Crossref, Google Scholar
• Shaheen SA, Cohen AP (2007) Growth in worldwide carsharing: An international comparison. Transportation Res. Record 1992(1):81–89.Crossref, Google Scholar
• Shaheen SA, Chan ND, Gaynor T (2016) Casual carpooling in the San Francisco Bay Area: Understanding user characteristics, behaviors, and motivations. Transport Policy 51(October):165–173.Crossref, Google Scholar
• Shaheen S, Cohen A, Jaffee M (2018) Innovative mobility: Carsharing outlook. UC Berkeley policy brief, University of California, Berkeley, Berkeley.Google Scholar
• Shaheen SA, Guzman S, Zhang H (2010) Bikesharing in Europe, the Americas, and Asia: Past, present, and future. Transportation Res. Record 2143(1):159–167.Crossref, Google Scholar
• Shen B, Huang Y, Zhao Y (2016) Dynamic ridesharing. SIGSPATIAL Special 7(3):3–10.Crossref, Google Scholar
• Stiglic M, Agatz N, Savelsbergh M, Gradisar M (2015) The benefits of meeting points in ride-sharing systems. Transportation Res. Part B Methodological 82(December):36–53.Crossref, Google Scholar
• Stiglic M, Agatz N, Savelsbergh M, Gradisar M (2016) Making dynamic ride-sharing work: The impact of driver and rider flexibility. Transportation Res. Part E Logist. Transportation Rev. 91(July):190–207.Crossref, Google Scholar
• Ströhle P, Flath CM, Gärttner J (2019) Leveraging customer flexibility for car-sharing fleet optimization. Transportation Sci. 53(1):42–61.Link, Google Scholar
• Stüdli S, Crisostomi E, Middleton R, Shorten R (2014) Optimal real-time distributed V2G and G2V management of electric vehicles. Internat. J. Control 87(6):1153–1162.Crossref, Google Scholar
• Sweda TM, Dolinskaya IS, Klabjan D (2017) Optimal recharging policies for electric vehicles. Transportation Sci. 51(2):457–479.Link, Google Scholar
• Ta N, Li G, Zhao T, Feng J, Ma H, Gong Z (2017) An efficient ride-sharing framework for maximizing shared route. IEEE Trans. Knowledge Data Engrg. 30(2):219–233.Crossref, Google Scholar
• Tafreshian A, Masoud N (2020) Trip-based graph partitioning in dynamic ridesharing. Transportation Res. Part C Emerging Tech. 114(May):532–553.Crossref, Google Scholar
• Tamannaei M, Irandoost I (2019) Carpooling problem: A new mathematical model, branch-and-bound, and heuristic beam search algorithm. J. Intelligent Transportation Systems 23(3):203–215.Crossref, Google Scholar
• Thangaraj RS, Mukherjee K, Raravi G, Metrewar A, Annamaneni N, Chattopadhyay K (2017) Xhare-a-ride: A search optimized dynamic ride sharing system with approximation guarantee. 2017 IEEE 33rd Internat. Conf. Data Engrg. (IEEE, Piscataway, NJ), 1117–1128.Google Scholar
• Wang H, Yang H (2019) Ridesourcing systems: A framework and review. Transportation Res. Part B Methodological 129(November):122–155.Crossref, Google Scholar
• Wang X, Agatz N, Erera A (2018a) Stable matching for dynamic ride-sharing systems. Transportation Sci. 52(4):850–867.Link, Google Scholar
• Wang X, Dessouky M, Ordonez F (2016a) A pickup and delivery problem for ridesharing considering congestion. Transportation Lett. 8(5):259–269.Google Scholar
• Wang X, Yang H, Zhu D (2018b) Driver-rider cost-sharing strategies and equilibria in a ridesharing program. Transportation Sci. 52(4):868–881.Link, Google Scholar
• Wang M, Ismail M, Zhang R, Shen X, Serpedin E, Qaraqe K (2016b) Spatio-temporal coordinated V2V energy swapping strategy for mobile PEVS. IEEE Trans. Smart Grid 9(3):1566–1579.Crossref, Google Scholar
• Weikl S, Bogenberger K (2013) Relocation strategies and algorithms for free-floating car sharing systems. IEEE Intelligent Transportation Systems Magazine 5(4):100–111.Crossref, Google Scholar
• Winter S, Nittel S (2006) Ad hoc shared-ride trip planning by mobile geosensor networks. Internat. J. Geographical Inform. Sci. 20(8):899–916.Crossref, Google Scholar
• Xia J, Curtin KM, Li W, Zhao Y (2015) A new model for a carpool matching service. PLoS One 10(6):e0129257.Crossref, Google Scholar
• Xing X, Warden T, Nicolai T, Herzog O (2009) SMIZE: A spontaneous ride-sharing system for individual urban transit. Braubach L, van der Hoek W, Petta P, Pokahr A, eds. Proc. 7th German Conf. Multiagent System Tech. (Springer, Berlin), 165–176.Google Scholar
• Xu Z, Yin Y, Ye J (2020) On the supply curve of ride-hailing systems. Transportation Res. Part B Methodological 132(February):29–43.Crossref, Google Scholar
• Xu J, Zhang Y, Xing C, Zhang G (2018) A real-time ride-sharing matching framework using simulated annealing genetic algorithm. Proc. 30th Internat. Conf. Software Engrg. Knowledge Engrg. (KSI Research, Philadelphia), 250–255.Google Scholar
• Zha L, Yin Y, Du Y (2018a) Surge pricing and labor supply in the ride-sourcing market. Transportation Res. Part B Methodological 117(Part B, November):708–722.Crossref, Google Scholar
• Zha L, Yin Y, Xu Z (2018b) Geometric matching and spatial pricing in ride-sourcing markets. Transportation Res. Part C Emerging Tech. 92(July):58–75.Crossref, Google Scholar
• Zha L, Yin Y, Yang H (2016) Economic analysis of ride-sourcing markets. Transportation Res. Part C Emerging Tech. 71(October):249–266.Crossref, Google Scholar