1 |
Bodin, L. D. and Sexton, T. R.(1983), The Multi-vehicle subscriber dial-a-ride problem, Monterey, California, Naval Postgraduate School.
|
2 |
Calvo, R. W. and Colorni, A.(2007), "An Effective and fast heuristic for the Dial-a-Ride problem", A Quarterly Journal of Operations Research, vol. 5, no. 1. pp.61-73.
|
3 |
Lee, Y. J., Meskar, M., Nickkar, A. and Saheb, S.(2019), "Development of an algorithm for optimal demand responsive relocatable feeder transit networks serving multiple trainsand stations", Urban Rail Transit, vol. 5, no. 3. pp.186-201.
DOI
|
4 |
Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T. A. M. T.(2002), "A Fast and elitist multiobjective genetic algorithm: NSGA-II", IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp.182-197.
DOI
|
5 |
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E. and Rus, D.(2017), "On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment", Proceedings of the National Academy of Sciences, vol. 114, no. 3, pp.462-467.
DOI
|
6 |
Chen, T., Zhang, B., Pourbabak, H., Kavousi-Fard, A. and Su, W.(2016), "Optimal routing and charging of an electric vehicle fleet for high-efficiency dynamic transit systems", IEEE Transactions on Smart Grid, vol. 9, no. 4, pp.3563-3572.
DOI
|
7 |
Coslovich, L., Pesenti, R. and Ukovich, W.(2006), "A Two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem", European Journal of Operational Research, vol. 175, no. 3, pp.1605-1615.
DOI
|
8 |
Dondo, R. and Cerda, J.(2007), "A Cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows", European Journal of Operational Research, vol. 176, no. 3, pp.1478-1507.
DOI
|
9 |
Konak, A., Coit, D. W. and Smith, A. E.(2006), "Multi-objective optimization using genetic algorithms: A tutorial", Reliability Engineering & System Safety, vol. 91, no. 9, pp.992-1007.
DOI
|
10 |
Fan, W. and Machemehl, R. B.(2006), "Optimal transit route network design problem with variable transit demand: Genetic algorithm approach", Journal of Transportation Engineering, vol. 132, no. 1, pp.40-51.
DOI
|
11 |
Wang, L., Wirasinghe, S. C., Kattan, L. and Saidi, S.(2018), "Optimization of demand-responsive transit systems using zonal strategy", International Journal of Urban Sciences, vol. 22, no. 3, pp.366-381.
DOI
|
12 |
Mahmoudi, M. and Zhou, X.(2016), "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations", Transportation Research Part B: Methodological, vol. 89, pp.19-42.
DOI
|
13 |
Parvasi, S. P., Mahmoodjanloo, M. and Setak, M.(2017), "A Bi-level school bus routing problem with bus stops selection and possibility of demand outsourcing", Applied Soft Computing, vol. 61, pp.222-238.
DOI
|
14 |
Sheffi, Y.(1985), Urban transportation networks: Equilibrium analysis with mathematical programming methods, Prentice Hall.
|
15 |
Taplin, J. H. and Sun, Y.(2019), "Optimizing bus stop locations for walking access: Stops-first design of a feeder route to enhance a residential plan", Environment and Planning B: Urban Analytics and City Science, vol. 47, no. 7, pp.1237-1259.
DOI
|
16 |
Deb, K. and Jain, H.(2013), "An Evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints", IEEE Transactions on Evolutionary Computation, vol. 18, no. 4, pp.577-601.
|
17 |
Arbex, R. O. and Da Cunha, C. B.(2015), "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm", Transportation Research Part B: Methodological, vol. 81, no. 2, pp.355-376.
DOI
|
18 |
Ban, J. and Jayakrishnan, R., http://www.bgu.ac.il/~bargera/tntp/, 2021.11.22.
|
19 |
Kuah, G. K. and Perl, J.(1989), "The Feeder-bus network-design problem", Journal of the Operational Research Society, vol. 40, no. 8, pp.751-767.
DOI
|
20 |
Ministry of Land, Infrastructure and Transport(2013), Traffic impact analysis.improvement strategy guideline.
|
21 |
Horn, M. E.(2002), "Fleet scheduling and dispatching for demand-responsive passenger services", Transportation Research Part C: Emerging Technologies, vol. 10, no. 1, pp.35-63.
DOI
|
22 |
Dou, X., Gong, X., Guo, X. and Tao, T.(2017), "Coordination of feeder bus schedule with train service at integrated transport hubs", Transportation Research Record, vol. 2648, no. 1, pp.103-110.
DOI
|
23 |
Das, I. and Dennis, J. E.(1998), "Normal-boundary Intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems", SIAM Journal on Optimization, vol. 8, no. 3, pp.631-657.
DOI
|
24 |
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, vol. 38, no. 6, pp.539-557.
DOI
|
25 |
Diana, M., Dessouky, M. M. and Xia, N.(2006), "A Model for the fleet sizing of demand responsive transportation services with time windows", Transportation Research Part B: Methodological, vol. 40, no. 8, pp.651-666.
DOI
|
26 |
Dumas, Y., Desrosiers, J. and Soumis, F.(1991), "The Pickup and delivery problem with time windows", European Journal of Operational Research, vol. 54, no. 1, pp.7-22.
DOI
|
27 |
Holland, J. H.(1975), Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence, MIT Press.
|
28 |
Wardrop, J. G.(1952), "Road paper. Some theoretical aspects of road traffic research", Proceedings of the Institution of Civil Engineers, vol. 1, no. 3, pp.325-362.
|
29 |
Qiu, F., Li, W. and Zhang, J.(2014), "A Dynamic station strategy to improve the performance of flex-route transit services", Transportation Research Part C: Emerging Technologies, vol. 48, pp.229-240.
DOI
|
30 |
Pan, S., Yu, J., Yang, X., Liu, Y. and Zou, N.(2015), "Designing a flexible feeder transit system serving irregularly shaped and gated communities: Determining service area and feeder route planning", Journal of Urban Planning and Development, vol. 141, no. 3.
|
31 |
Savelsbergh, M. and Sol, M.(1998), "Drive: Dynamic routing of independent vehicles", Operations Research, vol. 46, no. 4, pp.474-490.
DOI
|
32 |
Srinivas, N. and Deb, K.(1994), "Multi-objective function optimization using non-dominated sorting genetic algorithms", Evolutionary Computation Journal, vol. 2, no. 3, pp.221-248.
DOI
|
33 |
Sun, B., Wei, M., Yang, C., Xu, Z. and Wang, H.(2018), "Personalised and coordinated demand-responsive feeder transit service design: A genetic algorithms approach", Future Internet, vol. 10, no. 7, p.61.
DOI
|
34 |
Transportation Networks for Research Core Team, Transportation Networks for Research, https://github.com/bstabler/TransportationNetworks, 2021.11.22.
|
35 |
Wang, H.(2017), "Routing and scheduling for a last-mile transportation system", Transportation Science, vol. 53, no. 1, pp.131-147.
DOI
|
36 |
Yannibelli, V., Pacini, E., Monge, D., Mateos, C. and Rodriguez, G.(2020), "A Comparative analysis of NSGA-II and NSGA-III for autoscaling parameter sweep experiments in the cloud", Scientific Programming, vol. 2020, 4653204.
|
37 |
Bureau of Public Roads(1964), Traffic Assignment Manual, United States, Department of Commerce, Urban Planning Division, Washington D.C.
|
38 |
Chebbi, O. and Chaouachi, J.(2016), "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, vol. 89, pp.236-258.
DOI
|
39 |
Chiang, T. C. and Hsu, W. H.(2014), "A Knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows", Computers & Operations Research, vol. 45, pp.25-37.
DOI
|
40 |
Cordeau, J. F.(2006), "A Branch-and-cut algorithm for the dial-a-ride problem", Operations Research, vol. 54, no. 3 pp.573-586.
DOI
|
41 |
Celebi, M. E., Kingravi, H. A. and Vela, P. A.(2013), "A comparative study of efficient initialization methods for the k-means clustering algorithm", Expert Systems with Applications, vol. 40, no. 1, pp.200-210.
DOI
|