Preview

Operating a Fleet of Electric Taxis

Good Essays
Open Document
Open Document
9144 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Operating a Fleet of Electric Taxis
OPERATING A FLEET OF ELECTRIC TAXIS
´ ´ BERNAT GACIAS AND FREDERIC MEUNIER

Abstract. The deployment of electric taxi fleets is highly desirable from a sustainable point of view. Nevertheless, the weak autonomy of this kind of vehicles requires a careful operation. The way of managing such a fleet and the question of locating charging terminals for the vehicles are addressed in this paper. Methods for dealing with these tasks are proposed and their efficiency is proved through simulations.

1. Introduction 1.1. Context. Centrale OO 1 is a pioneering project aiming to deploy in Paris a fleet of 100 % electric taxis. The company in charge of the management of the fleet is the Soci´t´ du Taxi Electrique Parisien (STEP). ee The deployment of such fleets finds is main motivation in sustainable issues: electric vehicles release almost no air pollutants at the place where they are operated and have less noise pollution than internal combustion engine vehicles. However, the main drawback of an electric vehicle is its weak autonomy – 80 km in the case of the Centrale OO project. In taxi fleet management, two kinds of requests can be differentiated: booking requests and opportunistic requests. The first ones can be immediate or in advance of travel and have to be processed by the taxi dispatching system which assigns the request to a taxi. The opportunistic requests correspond to the traditional taxi services picking up passengers at cab-ranks or from the side of the road. Of course, this kind of requests is not processed by the dispatching system. The constraints of the management, as expressed by the STEP, are • A taxi must never break down • An opportunistic demand inside Paris and its suburbs must always be satisfied (legal environment of Paris) • The number of booking demands accepted has to be maximized The charging problem of the taxis must therefore be carefully addressed. At a tactical level, a good assignment of the trips to the taxis is crucial. We propose an efficient way



References: [AAR09] A. Alshamsi, S. Abdallah, and I. Rahwan, Multiagent self-organization for a taxi dispatch system, 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2009. [CR74] R. L. Church and C. ReVelle, The maximal covering location problem, Papers of the Regional Science Association 32 (1974), 101–118. [DS81] M. S. Daskin and E. H. Stern, A hierarchical objective set covering model for emergency medical service vehicle deployment, Transportation Science 15 (1981), no. 2, 137–152. [GLS97] M. Gendreau, G. Laporte, and F. Semet, Solving an ambulance location model by tabu search, Location Science 5 (1997), no. 2, 75–88. [Hak64] S. L. Hakimi, Optimum locations of switching centers and the absolute centers and medians of a graph, Operations Research 12 (1964), no. 3, 450–459. [Hor02] M. E. T. Horn, Fleet scheduling and dispatching for demand-responsive passenger services, Transportation Research Part C: Emerging Technologies 10 (2002), no. 1, 35–63. 14 [HR86] K. Hogan and C. S. ReVelle, Concept and applications of backup coverage, Management Science 32 (1986), no. 11, 1434–1444. [Jia08] Y. Jia, Improvement program of urban taxi stops based on simulated annealing algorithm in the context of china, Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (Washington, DC, USA), IEEE Computer Society, 2008, pp. 356–359. [LE96] P. Lopez and P. Esquirol, Consistency enforcing in scheduling: A general formulation based on energetic reasoning, 5th International Workshop on Projet Management and Scheduling (PMS’96) (Poznan (Poland)), 1996, pp. 155–158. [LSP08] J. H. Lee, I. H. Shin, and G. L. Park, Pick-up pattern for taxi location recommendation, 4th International Conference on Networked Computing and Advanced Information Management, 2008. [LWCT04] D.-H. Lee, H. Wang, R. L. Cheu, and S. H. Teo, Taxi dispatch system based on current demands and real-time traffic conditions, Transportation Research Record (2004), no. 1882, 193–200. [MMYH10] Q. Meng, S. Mabu, L. Yu, and K. Hirasawa, A novel taxi dispatch system integrating a multicustomer strategy and genetic network programming, Journal of Advanced Computational Intelligence and Intelligent Informatics 14 (2010), no. 5. [NSZ02] K. Neumann, C. Schwindt, and J. Zimmermann, Project Scheduling with Time Windows and Scarce Resources, Springer, 2002. [OD98] S. H. Owen and M. S. Daskin, Strategic facility location: A review, European Journal of Operational Research 111 (1998), no. 3, 423–447. [Sav92] M. W. P. Savelsbergh, The vehicle routing problem with time windows: Minimizing route duration, INFORMS Journal on Computing 4 (1992), no. 2, 146–154. [SCMK97] M. Shrivastava, P. K. Chande, A. S. Monga, and H. Kashiwagi, Taxi dispatch: A fuzzy approach, IEEE Conference on Intelligent Transportation System, 1997. [SDL10] K. T. Seow, N. H. Dang, and D.-H. Lee, A collaborative multiagent taxi-dispatch system, IEEE Transactions on Automation Science and Engineering 7 (2010), no. 3, 607–616. [SVB93] D. A. Schilling, J. Vaidyanathan, and R. Barkhi, A review of covering problems in facility location, Location Science 1 (1993), no. 1, 25–55. [VP10] C. N. Vijeyamurthy and R. Panneerselvam, Literature review of covering problem in operations management, International Journal of Services, Economics and Management 2 (2010), no. 3-4, 267–285. [WC74] J. A. White and K. E. Case, On covering problems and the central facilities location problems, Geographical Analysis 6 (1974), no. 3, 281–294. [Web29] A. Webber, Uber den Standort der Industrien (Alfred Weber’s Theory of the Location of Industries), 1929. [WLC09] H. Wang, D.-H. Lee, and R. Cheu, PDPTW based taxi dispatch modeling for booking service, Proceedings of the 5th international conference on Natural computation (Piscataway, NJ, USA), ICNC’09, IEEE Press, 2009, pp. 242–247. ´ ´ ´ Universite Paris Est, CERMICS, 6-8 avenue Blaise Pascal, Cite Descartes, 77455 Marne-la-Vallee, Cedex 2, France E-mail address: bernat.gacias@gmail.com ´ ´ ´ Universite Paris Est, CERMICS, 6-8 avenue Blaise Pascal, Cite Descartes, 77455 Marne-la-Vallee, Cedex 2, France E-mail address: frederic.meunier@cermics.enpc.fr hal-00721875, version 2 - 31 Jul 2012 15

You May Also Find These Documents Helpful

  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Brs Mdm3 Tif Ch05

    • 1872 Words
    • 12 Pages

    2) Which of the following models determines the path through the network that connects all the points?…

    • 1872 Words
    • 12 Pages
    Good Essays
  • Satisfactory Essays

    I believe using this architecture which embraces; Data/Application/Technology would be very useful for the business in the sense that using current technology such as GPS/Smart phones, each driver could be tracked geographically and monitored for example for security purposes. Each driver could be informed of a new collection which is close to their current location therefore avoiding the trip back to the warehouse and so on, this would allow greater flexibility and adaptation as the driver’s routes can be changed when ever required.…

    • 387 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    In the past times, take a taxi is uncomfortable and even a dangerous thing. On one side, drivers do not wear uniforms and dressed sloppily behind the wheel, this result in a less-than-professional image. On the other side, cars were always dirty and smelt unpleasant. The most important, there were some cases involved drivers committing crimes against passengers. But now the situation changed a lot. The drivers are people-oriented. You can see drivers wear uniforms which made them be looked very professional. The cars are clean and spacious. The drivers provided personal service such as buying breakfast for clients without charging extra. Moreover, taking taxi become safer than before. If they are ferrying female passengers, they will not depart until their passengers were safely in their homes.…

    • 425 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Veestel Case Summary

    • 2624 Words
    • 11 Pages

    * If we can negotiate better rate for a particular truck, we could use only one type of truck. This will make the planning simpler. There will also be cost saving (such as maintenance) due to the usage of a single truck…

    • 2624 Words
    • 11 Pages
    Powerful Essays
  • Powerful Essays

    References: Aarts, E.H.L., Korst, J.H.M. and Laarhoven, P.J.M. van. (1997). Simulated annealing. Pages 91– 120 in: Local Search in Combinatorial Optimization (E.H.L. Aarts, and J.K.L. Lenstra, Eds.) John Wiley & Sons, New York. Anderson, C. and McShea, D.W. Individual versus social complexity, with particular reference to ant colonies. Biol. Rev. (Camb), in press. Appleby, S. and Steward, S. (1994). Mobile software agents for control in telecommunications networks. BT Technol. J. 12: 104–113. Bartholdi, J. J., III. (1993) Interactive program to balance assembly lines. Int. J. Prod. Res. 31: 2447–2461. Bartholdi, J.J., III and Eisenstein, D.D. (1996). A production line that balances itself. Oper. Res. 44: 21–34. Bartholdi, J. J., III, Bunimovich, L.A. and Eisenstein, D.D. (1999). Dynamics of two- and threeworker "bucket brigade" production lines. Oper. Res. 47: 488–491. Bartholdi, J. J., III, Eisenstein, D.D. and Foley, R. A. Performance of bucket brigades when work is stochastic. Oper. Res., in press. Beebe, W. (1921). Edge of the Jungle. Henry Holt and Company, New York. Bonabeau, E. (1998). Social insect colonies as complex adaptive systems. Ecosystems 1: 437– 443. Bonabeau, E., and Théraulaz, G. (2000). Swarm smarts. Sci. Am. 282: 72–79. Bonabeau, E., Dorigo, M. and Théraulaz, G., 1999. Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute on the Sciences of Complexity. Oxford University Press, New York. Bonabeau, E., Dorigo, M. and Théraulaz, G. (2000). Inspiration for optimization from social insect behaviour. Nature 406: 39–42.…

    • 8717 Words
    • 35 Pages
    Powerful Essays
  • Good Essays

    Many questions arise when we think about optimization problem in healthcare industry. Like how to decide the best location for OPD and emergency vehicles…

    • 523 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Uber

    • 277 Words
    • 2 Pages

    “Will On-demand Ridesharing Services Replace the Taxi?” by Zaina K. is an article that illustrates the demand and familiarity of passengers using public transportation such Taxi Cab or TNC (Uber, Lyft or Sidecar). It also shows some factors to consider, knowledge and statistics in order to attract riders getting their service.…

    • 277 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Cost of a Parking Space

    • 3536 Words
    • 15 Pages

    Student team: Stephen Cannon, Shakeb Rehman, Alberto Mendez, Vincent Vo, Ana Maria Ordoñez, Amit Singh Faculty Advisor: George L. Donohue Department of Systems Engineering and Operations Research Client Advisor: Kenneth E. Bumgarner George Mason University University Services Fairfax, VA kbumgarn@gmu.edu KEYWORDS: Urban affairs, system engineering, parking, George Mason University, Transportation, Decision-making, Optimization, Monte Carlo Simulation, Eventoriented Model, Parking System ABSTRACT The users of George Mason University’s parking system are quickly outgrowing the capacity of the system and are dissatisfied with the quality of the service this system provides, yet George Mason parking services are still in debt from previous expansion projects. Plans are already underway to increase the capacity of the system but not without great financial expense. Our objective is to provide a more effective means of distributing the resources of the parking system at George Mason University that is relatively inexpensive and that will work in conjunction with the existing plans to expand George Mason’s parking system. Our system design consists of a series of policies to be enacted on the George Mason University parking system by 2004. These policies are: providing carpooling incentives, restricting resident students from parking in the most valuable parking spaces, selling reserved spaces via a uniform price sealed bid auction, and differentiating the decal prices into several value groups. The effect of these policies was modeled using a computer simulation that replicated the acquisition of the system’s parking spaces by George Mason University (GMU) plans to grow to 30,000 students by 2007 and decrease its teacher to student ratio to 1:14. The effective growth rate between 2002 and 2007 will be approximately 1000 a year. Figure 1 displays the historic and projected student…

    • 3536 Words
    • 15 Pages
    Powerful Essays
  • Good Essays

    Case Study of Uber

    • 742 Words
    • 3 Pages

    • From the computer scientist’s point of view, the process is a noble attempt at solving the complicated traveling-salesman problem, in which you’re trying to determine the shortest path visiting each location only once. “Each car has its own traveling-salesman problem,” Kalanick told Wired.…

    • 742 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Current, J., and M. O’Kelly (1992). “Locating Emergency Warning Sirens.” Decision Sciences 23, 221-234. Daskin, M. (1983). “A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution.” Transportation Science 17, 4869. Daskin, M.S., K. Hogan, and C. ReVelle (1988). “Integration of multiple, excess, backup, and expected covering models.” Environment and Planning B: Planning and Design 15, 15-35. Downs B.T., and J.D. Camm (1996). “An Exact Algorithm for the Maximal Covering Problem.” Naval Research Logistics 43, 435-461. Eaton, D.J., R.L. Church, V.L. Bennett, B.L. Hamon, and L.G.V. Lopez (1981). “On the Deployment of Health Resources in Rural Valle Del Cauca, Colombia.” TIMS Studies in the Management Sciences 17, 331-359. Hogan, K., and C. ReVelle (1986). "Concepts and Applications of Backup Coverage." Management Science 32, 1434-1444. Plane, D. R., and T.E. Hendrick (1974). “Mathematical programming and the location of fire companies for the Denver fire department,” Management Scinec Report Series, University of Colorado, Bolder, Colorado. (also published in Operations Research). Roth, R. (1969). "Computer Solutions to Minimum-Cover Problems." Operations Research 17, 455-465. Toregas, C. (1970). "A Covering Formulation for the Location of Public Service Facilities." M.S. Thesis, Cornell University, Ithaca, NY. Toregas, C. (1971). "Location Under Maximal Travel Time Constraints." Ph.D. Dissertation, Cornell University, Ithaca, NY. Toregas, C., and C. ReVelle (1972). "Optimal Location Under Time or Distance Constraints." Papers of the Regional Science Association 28, 133-143. Toregas, C., and C. ReVelle (1973). "Binary Logic Solutions to a Class of Location Problem." Geographical Analysis 5, 145-155. Underhill, L. (1994). "Optimal and Suboptimal Reserve Selection Algorithms." Biological Conservation 70, 85-87.…

    • 9638 Words
    • 39 Pages
    Good Essays
  • Better Essays

    Tsp - Problem

    • 6143 Words
    • 25 Pages

    One of the most common problems in urban service systems is the design of routes for vehicles or people. In some instances, these routes must be designed so that they traverse in an exhaustive way the streets in a neighborhood or in a specific part of a city or, occasionally, in a whole city. Alternatively, the objective may be to visit a set of given geographical points in a city in order to provide some service there or to deliver or collect goods.…

    • 6143 Words
    • 25 Pages
    Better Essays
  • Powerful Essays

    Abstract—The Kiva Mobile Fulfillment System (Kiva MFS) uses a breakthrough new approach to order fulfillment - one that simultaneously improves productivity, speed, accuracy, and flexibility. With the Kiva MFS, operators stand still while the products come to them. Pallets, cases, and orders are stored on inventory pods that are picked up and moved by hundreds of mobile robotic drive units. As a result, any product can go to any operator. The largest installation to date is a 500 robot system for an office supply company in the United States. Videos and other related information may be found at www.kivasystems.com.…

    • 2058 Words
    • 9 Pages
    Powerful Essays
  • Powerful Essays

    This project is being considered in order to reduce and totally eliminate loss of customers to competitors, and save the company from folding up. The current system is manual and it is time consuming. It is also cost ineffective, and average return is low and diminishing. Currently, customers can call or walk-in in order to rent or reserve a vehicle. The staff of the company will check their file to see which vehicle is available for rental. The current system is error prone and customers are dissatisfied. The goal of this project is to automate vehicle rental and reservation so that customers do not need to walk-in or call in order to reserve a vehicle.…

    • 2052 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    Ola Cabs Case Study

    • 918 Words
    • 4 Pages

    OlaCabs is an online cab aggregator based out of Mumbai and among the fastest growing taxi hiring firms in India. Taxi booking facility can be availed through app, website or through calls. Olacabs provides different types of cab service ranging from economic to luxury travel. The cabs can be reserved through a web browser or a mobile app. This cab service supports both cash and cashless payment options with Ola money. It claims to clock an average of more than 150,000 bookings per day and commands 60 percent of the market share in India.…

    • 918 Words
    • 4 Pages
    Satisfactory Essays