Optimal Fleet Sizing of Personal Rapid Transit System

1. Carnegie, J.A., Hoffman, P.S.: Viability of personal rapid transit in New Jersey. Technical report (2007)

   Google Scholar 

2. Lees-Miller, J.D.: Minimising average passenger waiting time in personal rapid transit systems. Annals of Operations Research 1–20 (2013)

   Google Scholar 

3. Mrad, M., Hidri, L.: Optimal consumed electric energy while sequencing vehicle trips in a personal rapid transit transportation system. Computers & Industrial Engineering 79, 1–9 (2015)

   Article  Google Scholar 

4. Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., Rei, W.: Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Computers & Operations Research 53, 9–23 (2015)

   Article  MathSciNet  Google Scholar 

5. Li, J., Chen, Y.S., Li, H., Andreasson, I., van Zuylen, H.: Optimizing the fleet size of a personal rapid transit system: a case study in port of rotterdam. In: 2010 13th International IEEE Conference on Intelligent Transportation Systems (ITSC), pp. 301–305. IEEE (2010)

   Google Scholar 

6. Demir, Y., Kürşat İşleyen, S.: Evaluation of mathematical models for flexible job-shop scheduling problems. Applied Mathematical Modelling 37(3), 977–988 (2013)

   Article  MathSciNet  Google Scholar 

7. Kara, I.: Two indexed polonomyal size formulationsfor vehicle routing problems. Technical Report. BaskentUniversity, Ankara/Turkey (2008)

   Google Scholar 

8. Fatnassi, E., Chebbi, O., Siala, J.C.: 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 Scholar 

9. Blazewicz, J., Dror, M., Weglarz, J.: Mathematical programming formulations for machine scheduling: a survey. European Journal of Operational Research 51(3), 283–300 (1991)

   Article  MATH  Google Scholar 

10. Pan, C.H.: A study of integer programming formulations for scheduling problems. International Journal of Systems Science 28(1), 33–41 (1997)

    Article  MATH  Google Scholar 

11. Keha, A.B., Khowala, K., Fowler, J.W.: Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering 56(1), 357–367 (2009)

    Article  Google Scholar 

12. Pan, J.C.H., Chen, J.S.: Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Computers & Operations Research 32(5), 1197–1212 (2005)

    Article  MathSciNet  MATH  Google Scholar 

13. Unlu, Y., Mason, S.J.: Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Computers & Industrial Engineering 58(4), 785–800 (2010)

    Article  Google Scholar 

14. Mrad, M., Chebbi, O., Labidi, M., Louly, M.: Synchronous routing for personal rapid transit pods. J. Applied Mathematics 2014 (2014)

    Google Scholar 

15. Floyd, R.W.: Algorithm 97: shortest path. Communications of the ACM 5(6), 345 (1962)

    Article  Google Scholar 

16. Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (2002)

    Google Scholar 

17. Almoustafa, S., Hanafi, S., Mladenovi, N.: New exact method for large asymmetric distance-constrained vehicle routing problem. European Journal of Operational Research (2012)

    Google Scholar 

18. Laporte, G., Nobert, Y., Taillefer, S.: A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem. Mathematical Modelling 9(12), 857–868 (1987)

    Article  MathSciNet  MATH  Google Scholar 

19. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960)

    Article  MathSciNet  MATH  Google Scholar 

20. Wilcoxon, F., Wilcox, R.A.: Some rapid approximate statistical procedures. Lederle Laboratories (1964)

    Google Scholar 

Download references