Skip to main content
SpringerLink
Log in

High Coverage Point-To-Point Transit: Hybrid evolutionary approach to local vehicle routing

  • Transportation Engineering
  • Published:
KSCE Journal of Civil Engineering Aims and scope

Abstract

High Coverage Point-to-Point Transit (HCPPT) is a new design of alternative transportation, which involves a sufficient number of deployed small vehicles in real-time response. This paper focuses on a hybrid evolutionary approach to improve the existing local vehicle routing algorithm of HCPPT. A hybrid Genetic Algorithm (GA) is proposed by utilizing an insertion heuristic method as a genetic operator. First, two genetic operation schemes, Random Feasible Position (RFP) and Best Feasible Position (BFP), are designed and tested on a simulation framework that we have developed recently. The simulation result shows the effectiveness of BFP in terms of system performance and computational efficiency. Next, we investigate a combined scheme that builds the initial BFP population based on an insertion heuristic. The second simulation reveals that the proposed initial population method provides considerably better solution qualities over the various problem constraints. The simulations in this study are performed with various demand levels based on SCAG (Southern California Association of Governments) transportation network and OCTA (Orange County Transportation Authority) trip demands.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Black, A. (1995). An urban mass transportation planning, McGraw-Hill Series in Transportation. McGraw-Hill, New York.

    Google Scholar 

  • Cervero, R. (1997). Paratransit in America: Redefining mass transportation, Praeger Publishers, Westport, Conn.

    Google Scholar 

  • Cheng, R. and Gen, M. (1994). “Evolution program for resource constrained project scheduling problem.” Evolutionary Computation in IEEE World Congress, pp. 736–741.

    Google Scholar 

  • Colorni, A. and Righini, G. (2001). “Modeling and optimizing dynamic dial-a-ride problems.” Intl. Trans. in Op. Res., Vol. 8, Issue 2, pp. 155–166.

    Article  MATH  MathSciNet  Google Scholar 

  • Cordeau, J. F. and Laporte, G. (2007). “The dial-a-ride problems: Models and algorithms.” Ann. Oper. Res., Vol. 153, Issue 1, pp. 29–46.

    Article  MATH  MathSciNet  Google Scholar 

  • Cortés, C. E. (2003). High-Coverage Point-to-Point Transit (HCPPT): A new design concept and simulation-evaluation of operational schemes for future technological deployment, PhD Thesis, UCI.

    Google Scholar 

  • CortésC.E.andJayakrishnanR.2002.“Designandoperationalconceptsofhigh-coveragepoint-to-pointtransitsystem.”TransportationResearchRecordJournaloftheTransportationResearchBoard, No. 1783, Transportation Research Board of the National Academies, Washington, D.C.}, pp. 178–18

    Google Scholar 

  • Dial, R. B. (1995). “Autonomous dial-a-ride transit introductory overview.” Transportation Research, Vol. 3C, No. 5, pp. 261–275.

    Article  Google Scholar 

  • Diana, M. and Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research Part B: Methodological 38.

    Google Scholar 

  • Eiben, A. E., Aarts, E. H. L., and Van Hee, K. M. (1991). “Global convergence of genetic algorithms: A Markov chain analysis.” Lecture Notes in Computer Science, Vol. 496, pp. 3–12.

    Article  Google Scholar 

  • Gendreau, M. and Potvin, J.-Y. (1998). “Dynamic vehicle routing and dispatching.” Fleet Management and Logistics, Kluwer, Boston, pp. 115–126.

    Chapter  Google Scholar 

  • Ghiani, G., Guerriero, F., Laporte, G., and Musmanno, R. (2003). “Vehicle routing: Solution concepts, algorithms and parallel computing strategies.” European Journal of Operational Research, Vol. 151, No. 1, pp. 1–11.

    Article  MATH  Google Scholar 

  • Ichoua, S., Gendreau, M., and Potvin, J.-Y. (2002). “Diversion issues in real-time vehicle dispatching.” Transportation Science, Vol. 34, No. 4, pp. 426–438.

    Article  Google Scholar 

  • Jaw, J., Odoni, A., Psaraftis, H., and Wilson, H. (1986). “A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows.” Transportation Research, Vol. 20B, No. 3, pp. 243–257.

    Article  Google Scholar 

  • Jih, W. and Hsu, J. Y. (1999). “Dynamic vehicle routing using hybrid genetic algorithms.” Proceedings of the 1999 IEEE International Conference on Robotics & Automation, IEEE Computer Society, Detroit, Michigan, pp. 453–458.

    Google Scholar 

  • Jung, J. and Jayakrishnan, R. (2011). “High coverage point-to-point transit: Study of path-based vehicle routing through multiple hubs.” Transportation Research Record: Journal of the Transportation Research Board, No. 2218, Transportation Research Board of the National Academies, Washington, D.C., pp. 78–87.

    Google Scholar 

  • Lund, H. M., Cervero, R., and Wilson, R. W. (2004). Travel characteristics of transit-oriented development in California, California Department of Transportation, Sacramento, CA.

    Google Scholar 

  • Pagés, L., Jayakrishnan, R., and Cortés, C. E. (2006). “Real-time mass transport network optimization problems.” Transportation Research Record: Journal of the Transportation Research Board, No. 1964, Transportation Research Board of the National Academies, Washington, D.C., pp. 229–237.

    Google Scholar 

  • Pillac, V., Gendreau, M., Guéret, C., and Medaglia, A. L. (2013). “A review of dynamic vehicle routing problems.” European Journal of Operational Research 225, pp. 1–11.

    Article  MATH  MathSciNet  Google Scholar 

  • Potvin, J.-Y. and Bengio, S. (1996). “The vehicle routing problem with time windows-Part II: Genetic search.” Informs Journal on Computing, Vol. 8, No. 2, pp. 165–172.

    Article  MATH  Google Scholar 

  • Psaraftis, H. (1980). “A dynamic-programming solution to the single vehicle many-to-many immediate request dial-a-ride problem.” Transportation Science, Vol. 14, No. 2, pp. 130–154.

    Article  Google Scholar 

  • Psaraftis, H. (1988). “Dynamic vehicle routing problems.” Vehicle Routing: Methods and Studies, Elsevier Science Publishers B.V.

    Google Scholar 

  • Quadrifoglio, L., Dessouky, M., and Palmer, K. (2007). “An insertion heuristic for scheduling MAST service.” Journal of Scheduling, Vol. 10, Issue 1, pp. 25–40.

    Article  MATH  MathSciNet  Google Scholar 

  • Rudolph, G. (1994). “Convergence of non-elitist strategies.” Proceedings of the First IEEE International Conference on Evolutionary Computation, IEEE Press, pp. 63–66.

    Google Scholar 

  • Solomon, M. M. and Desrosiers, J. (1988). “Survey paper — Time window constrained routing and scheduling problems.” Transportation Science, Vol. 22, No. 1, pp. 1–13.

    Article  MATH  MathSciNet  Google Scholar 

  • Stone, J. R., Nalevanko, A., and Tsai, J. (1993). Assessment of software for computerized paratransit operations, Transportation Research Record 1378, TRB, National Research Council, Washington, D.C., pp. 1–9.

    Google Scholar 

  • Wilson, N. H. M. and Colvin, N. H. (1977). Computer control of the Rochester dial-a-ride system, Technical Report R77-31, Dept. of Civil Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts.

    Google Scholar 

  • Wilson, N. H., Sussman, J. M., Higonnet, B. T., and Goodman, L. A. (1970). “Simulation of a Computer-Aided Routing Systems (CARS).” Transportation Research Record: Journal of the Transportation Research Board. No. 318, TRB National Research Council, Washington, D.C., pp. 66–76.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Transportation Studies, University of California, Irvine, 92697, USA

    Jaeyoung Jung

  2. Dept. of Civil and Environmental Engineering, University of California, Irvine, 92697, USA

    R. Jayakrishnan

  3. Dept. of Information System Engineering, Hansung University, Seoul, 136-792, Korea

    Doohee Nam

Authors
  1. Jaeyoung Jung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Jayakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Doohee Nam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Doohee Nam.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jung, J., Jayakrishnan, R. & Nam, D. High Coverage Point-To-Point Transit: Hybrid evolutionary approach to local vehicle routing. KSCE J Civ Eng 19, 1882–1891 (2015). https://doi.org/10.1007/s12205-014-0069-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12205-014-0069-2

Keywords

Search

Navigation