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.
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- E. Alba and M. Tomassini. Parallelism and evolutionary algorithms. Evolutionary Computation, IEEE Transactions on, 6(5):443--462, 2002. Google ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarCross Ref
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- H. Hoos and T. Stützle. On the empirical evaluation of las vegas algorithms-position paper. Technical report, Citeseer, 1998.Google Scholar
- 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 ScholarCross Ref
- J. D. Lees-Miller. Minimising average passenger waiting time in personal rapid transit systems. Annals of Operations Research, pages 1--20, 2013.Google Scholar
- 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 ScholarCross Ref
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- C. Prins. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12):1985 -- 2002, 2004.Google Scholar
- 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 ScholarCross Ref
- F. Wilcoxon. Individual comparisons by ranking methods. Biometrics bulletin, pages 80--83, 1945.Google Scholar
Index Terms
- Cellular Genetic Algorithm for Solving a Routing On-Demand Transit Problem
Recommendations
Application of a memetic algorithm to the fleet size and mix vehicle routing problem with electric modular vehicles
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference CompanionElectric vehicles have emerged as a new promising technology guaranteeing sustainable transport activities. To save the environment and avoid our dependence on foreign oil, new laws and regulations concerning the emission of greenhouse gases are made in ...
Adaptive probabilities of crossover and mutation in genetic algorithm for solving stochastic vehicle routing problem
The vehicle routing problem vehicle routing problem, VRP in remainder of this paper is a combinatorial optimisation problem and operational research. It belongs to the category of transportation problems, as the travelling salesman problem travelling ...
Genetic Algorithm based EV Scheduling for On-Demand Public Transit System
Computational Science – ICCS 2019AbstractThe popularity of real-time on-demand transit as a fast evolving mobility service has paved the way to explore novel solutions for point-to-point transit requests. In addition, strict government regulations on greenhouse gas emission calls for ...
Comments