Show simple item record

Taxi dispatching strategies with compensations

dc.contributor.authorBillhardt, Holger
dc.contributor.authorFernández, Alberto
dc.contributor.authorOssowski, Sascha
dc.contributor.authorPalanca, Javier
dc.contributor.authorBajo, Javier
dc.date.accessioned2023-12-26T16:52:25Z
dc.date.available2023-12-26T16:52:25Z
dc.date.issued2019-01-03
dc.identifier.citationHolger Billhardt, Alberto Fernández, Sascha Ossowski, Javier Palanca, Javier Bajo: Taxi dispatching strategies with compensations. Expert Syst. Appl. 122: 173-182 (2019)es
dc.identifier.issn1873-6793
dc.identifier.issn0957-4174
dc.identifier.urihttps://hdl.handle.net/10115/27866
dc.descriptionThis work was supported by the Autonomous Region of Madrid (grant "MOSI-AGIL-CM" (S2013/ICE-3019) co-funded by EU Structural Funds FSE and FEDER), project "SURF" (TIN2015-65515-C4-X-R (MINECO /FEDER)) funded by the Spanish Ministry of Economy and Competitiveness, and through the Excellence Research Group GES2ME (Ref. 30VCPIGI05) co-funded by URJC and Santander Bank.es
dc.description.abstractUrban mobility efficiency is of utmost importance in big cities. Taxi vehicles are key elements in daily traffic activity. The advance of ICT and geo-positioning systems has given rise to new opportunities for improving the efficiency of taxi fleets in terms of waiting times of passengers, cost and time for drivers, traffic density, CO2 emissions, etc., by using more informed, intelligent dispatching. Still, the explicit spatial and temporal components, as well as the scale and, in particular, the dynamicity of the problem of pairing passengers and taxis in big towns, render traditional approaches for solving standard assignment problem useless for this purpose, and call for intelligent approximation strategies based on domain-specific heuristics. Furthermore, taxi drivers are often autonomous actors and may not agree to participate in assignments that, though globally efficient, may not be sufficently beneficial for them individually. This paper presents a new heuristic algorithm for taxi assignment to customers that considers taxi reassignments if this may lead to globally better solutions. In addition, as such new assignments may reduce the expected revenues of individual drivers, we propose an economic compensation scheme to make individually rational drivers agree to proposed modifications in their assigned clients. We carried out a set of experiments, where several commonly used assignment strategies are compared to three different instantiations of our heuristic algorithm. The results indicate that our proposal has the potential to reduce customer waiting times in fleets of autonomous taxis, while being also beneficial from an economic point of view.es
dc.language.isoenges
dc.publisherElsevieres
dc.rightsAtribución 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectCoordinationes
dc.subjectDynamic fleet managementes
dc.subjectDynamic optimizationes
dc.subjectMulti-agent systemses
dc.subjectOpen systemses
dc.subjectTaxi assignmentes
dc.titleTaxi dispatching strategies with compensationses
dc.typeinfo:eu-repo/semantics/articlees
dc.identifier.doi10.1016/j.eswa.2019.01.001es
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses


Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución 4.0 InternacionalExcept where otherwise noted, this item's license is described as Atribución 4.0 Internacional