skip to main content
10.1145/2908812.2908921acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Cellular Genetic Algorithm for Solving a Routing On-Demand Transit Problem

Published:20 July 2016Publication History

ABSTRACT

To provide sustainable and efficient urban logistics and transportation services, urban mobility tools are facing challenges on reducing carbon emission, waiting time for passengers and transit time. The emergence of many new intelligent and electric transportation system offers many new possible solutions to achieve urban sustainability. This paper proposes to treat the Personal Rapid Transit System (PRT) as an efficient sustainable transportation tool for urban areas. This paper proposes to deal with static problem of routing PRT' vehicles to minimize total energy consumption while considering the battery capacity of vehicles. For that purpose, we describe a multiple crossover Cellular Genetic Algorithm combined with a local search. Numerical experiments on 1320 instances show that our hybrid algorithm is efficient in which the average percent deviations relative to the lower bound over 1320 instances is about 1.632%, and the average running time is about 26.3 seconds.

References

  1. R. Aiex, M. Resende, and C. Ribeiro. Ttt plots: a perl program to create time-to-target plots. Optimization Letters, 1(4):355--366, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Al-Naqi, A. T. Erdogan, and T. Arslan. Dynamic fault-tolerant three-dimensional cellular genetic algorithms. Journal of Parallel and Distributed Computing, (0):--, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. Alba and B. Dorronsoro. Computing nine new best-so-far solutions for capacitated vrp with a cellular genetic algorithm. Information Processing Letters, 98(6):225 -- 230, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. Alba and M. Tomassini. Parallelism and evolutionary algorithms. Evolutionary Computation, IEEE Transactions on, 6(5):443--462, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Almoustafa, S. Hanafi, and N. Mladenović. New exact method for large asymmetric distance-constrained vehicle routing problem. European Journal of Operational Research, 226(3):386--394, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  6. O. Chebbi and J. Chaouachi. Optimal fleet sizing of personal rapid transit system. In Computer Information Systems and Industrial Management, pages 327--338. Springer, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  7. O. Chebbi and J. Chaouachi. Reducing the wasted transportation capacity of personal rapid transit systems: An integrated model and multi-objective optimization approach. Transportation Research Part E: Logistics and Transportation Review, In Press, 2015.Google ScholarGoogle Scholar
  8. E. Fatnassi, J. Chaouachi, and W. Klibi. Planning and operating a shared goods and passengers on-demand rapid transit system for sustainable city-logistics. Transportation Research Part B: Methodological, 81, Part 2:440 -- 460, 2015. Optimization of Urban Transportation Service Networks Optimization of Urban Transportation Service Networks.Google ScholarGoogle Scholar
  9. E. Fatnassi, O. Chebbi, and J. Chaouachi. Discrete honeybee mating optimization algorithm for the routing of battery-operated automated guidance electric vehicles in personal rapid transit systems. Swarm and Evolutionary Computation, 26:35 -- 49, 2016.Google ScholarGoogle Scholar
  10. E. Fatnassi, O. Chebbi, and J. C. Siala. Evaluation of different vehicle management strategies for the personal rapid transit system. In Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on, pages 1--5. IEEE, 2013.Google ScholarGoogle Scholar
  11. E. Fatnassi, O. Chebbi, and J. C. Siala. Comparison of two mathematical formulations for the offline routing of personal rapid transit system vehicles. In The International Conference on Methods and Models in Automation and Robotics, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  12. T. A. Feo, M. G. Resende, and S. H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42(5):860--878, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Hoos and T. Stützle. On the empirical evaluation of las vegas algorithms-position paper. Technical report, Citeseer, 1998.Google ScholarGoogle Scholar
  14. G. Laporte, Y. Nobert, and S. Taillefer. A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem. Mathematical Modelling, 9(12):857 -- 868, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  15. J. D. Lees-Miller. Minimising average passenger waiting time in personal rapid transit systems. Annals of Operations Research, pages 1--20, 2013.Google ScholarGoogle Scholar
  16. M. Mrad, O. Chebbi, M. Labidi, and M. A. Louly. Synchronous routing for personal rapid transit pods. Journal of Applied Mathematics, 2014(1):1--8, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  17. M. Mrad and L. Hidri. Optimal consumed electric energy while sequencing vehicle trips in a personal rapid transit transportation system. Computers & Industrial Engineering, 79:1--9, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  18. V.-P. Nguyen, C. Prins, and C. Prodhon. A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Engineering Applications of Artificial Intelligence, 25(1):56--71, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C. Prins. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12):1985 -- 2002, 2004.Google ScholarGoogle Scholar
  20. C. Prins, P. Lacomme, and C. Prodhon. Order-first split-second methods for vehicle routing problems: A review. Transportation Research Part C: Emerging Technologies, 40(0):179 -- 200, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  21. F. Wilcoxon. Individual comparisons by ranking methods. Biometrics bulletin, pages 80--83, 1945.Google ScholarGoogle Scholar

Index Terms

  1. Cellular Genetic Algorithm for Solving a Routing On-Demand Transit Problem

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016
        July 2016
        1196 pages
        ISBN:9781450342063
        DOI:10.1145/2908812

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 20 July 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        GECCO '16 Paper Acceptance Rate137of381submissions,36%Overall Acceptance Rate1,669of4,410submissions,38%

        Upcoming Conference

        GECCO '24
        Genetic and Evolutionary Computation Conference
        July 14 - 18, 2024
        Melbourne , VIC , Australia

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader