1,047
Views
6
CrossRef citations to date
0
Altmetric
Research Articles

The airport shuttle bus scheduling problem

ORCID Icon, ORCID Icon & ORCID Icon
Pages 7400-7422 | Received 28 Jan 2020, Accepted 15 Oct 2020, Published online: 18 Nov 2020

References

  • Agatz, N., A. Erera, M. Savelsbergh, and X. Wang. 2012. “Optimization for Dynamic Ride-Sharing: A Review.” European Journal of Operational Research 223: 295–303. doi: 10.1016/j.ejor.2012.05.028
  • Antalya Shuttle. 2020. Antalya Transfer Club, <https://www.antalyatransferclub.com/>.
  • Cakici, E., J. M. Scott, W. F. John, and H. N. Geismar. 2013. “Batch Scheduling on Parallel Machines with Dynamic Job Arrivals and Incompatible Job Families.” International Journal of Production Research 51: 2462–2477. doi: 10.1080/00207543.2012.748227
  • Chen, H. P., B. Du, and Q. H. George. 2010. “Metaheuristics to Minimise Makespan on Parallel Batch Processing Machines with Dynamic Job Arrivals.” International Journal of Computer Integrated Manufacturing 23: 942–956. doi: 10.1080/0951192X.2010.495137
  • Diri Kenger, Z., Ç. Koç, and E. Özceylan. 2020. “Integrated Disassembly Line Balancing and Routing Problem.” International Journal of Production Research, in press.
  • Dong, G., J. Tang, K. K. Lai, and Y. Kong. 2011. “An Exact Algorithm for Vehicle Routing and Scheduling Problem of Free Pickup and Delivery Service in Flight Ticket Sales Companies Based on Set-Partitioning Model.” Journal of Intelligent Manufacturing 22: 789–799. doi: 10.1007/s10845-009-0311-9
  • Dowsland, K. A., and J. M. Thompson. 2012. “Simulated Annealing.” In Handbook of Natural Computing, 1623–1655. Berlin: Springer.
  • Furuhata, M., M. Dessouky, F. Ordóñez, M. E. Brunet, X. Wang, and S. Koenig. 2013. “Ridesharing: The State-of-the-Art and Future Directions.” Transportation Research Part B 57: 28–46. doi: 10.1016/j.trb.2013.08.012
  • Ikura, Y., and M. Gimple. 1986. “Efficient Scheduling Algorithms for A Single Batch Processing Machine.” Operations Research Letters 5: 61–65. doi: 10.1016/0167-6377(86)90104-5
  • Koç, Ç., O. Jabali, and G. Laporte. 2018. “Long-Haul Vehicle Routing and Scheduling with Idling Options.” Journal of the Operational Research Society 69: 235–246. doi: 10.1057/s41274-017-0202-y
  • Koç, Ç., and G. Laporte. 2018. “Vehicle Routing with Backhauls: Review and Research Perspectives.” Computers & Operations Research 91: 79–91. doi: 10.1016/j.cor.2017.11.003
  • Koç, Ç., G. Laporte, and İ. Tükenmez. 2020. “A Review on Vehicle Routing with Simultaneous Pickup and Delivery.” Computers & Operations Research 122: 104–987. doi: 10.1016/j.cor.2020.104987
  • KPMG. 2018. The Aviation Industry Leaders Report 2018. <https://home.kpmg.com/ie/en/home/insights/2018/01/airlines.html>.
  • Mathirajan, M., and A. Sivakumar. 2006. “A Literature Review, Classification and Simple Meta-Analysis on Scheduling of Batch Processors in Semiconductor.” International Journal of Advanced Manufacturing Technology 29: 990–1001. doi: 10.1007/s00170-005-2585-1
  • Perez-Gonzalez, P., V. Fernandez-Viagas, M. Z. García, and J. M. Framinan. 2019. “Constructive Heuristics for the Unrelated Parallel Machines Scheduling Problem with Machine Eligibility and Setup Times.” Computers & Industrial Engineering 131: 131–145. doi: 10.1016/j.cie.2019.03.034
  • Potts, C. N., and M. Y. Kovalyov. 2000. “Scheduling with Batching: A Review.” European Journal of Operational Research 120: 228–249. doi: 10.1016/S0377-2217(99)00153-8
  • Savelsbergh, M., and T. Van Woensel. 2016. “City Logistics: Challenges and Opportunities.” Transportation Science 50: 579–590. doi: 10.1287/trsc.2016.0675
  • Shahvari, O., and R. Logendran. 2017. “A Bi-Objective Batch Processing Problem with Dual-Resources on Unrelated-Parallel Machines.” Applied Soft Computing 61: 174–192. doi: 10.1016/j.asoc.2017.08.014
  • Song, D. P., J. Dinwoodie, and M. Roe. 2007. “Integrated Vehicle Fleet-Sizing, Leasing and Dispatching Policy in a Shuttle Service System.” International Journal of Logistics: Research and Applications 10: 29–40. doi: 10.1080/13675560601081482
  • Tang, J., Y. Yu, and J. Li. 2015. “An Exact Algorithm for the Multi-Trip Vehicle Routing and Scheduling Problem of Pickup and Delivery of Customers to the Airport.” Transportation Research Part E 73: 114–132. doi: 10.1016/j.tre.2014.11.001
  • Thomasson, O., M. Battarra, G. Erdoğan, and G. Laporte. 2018. “Scheduling Twin Robots in a Palletising Problem.” International Journal of Production Research 56: 518–542. doi: 10.1080/00207543.2017.1401249
  • Toth, P., and D. Vigo. 2014. Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, Philadelphia.
  • Trindade, R. S., O. C. B. de Araùjo, M. H. C. Fampa, and F. P. Müller. 2018. “Modelling and Symmetry Breaking in Scheduling Problems on Batch Processing Machines.” International Journal of Production Research 56: 7031–7048. doi: 10.1080/00207543.2018.1424371
  • Turkish Airlines. 2020. Shuttle Service. <https://shuttle.turkishairlines.com/about-shuttle#about>.
  • Xiao, Z., and H. Shao. 2013. “Two-Dimensional Scheduling: A Review.” Research Journal of Applied Sciences, Engineering and Technology 6: 1566–1572. doi: 10.19026/rjaset.6.3870
  • Yu, J. M., R. Huang, and D. H. Lee. 2017. “Iterative Algorithms for Batching and Scheduling to Minimise the Total Job Tardiness in Two-Stage Hybrid Flow Shops.” International Journal of Production Research 55: 3266–3282. doi: 10.1080/00207543.2017.1304661
  • Zhang, J., X. Yao, and Y. Li. 2020. “Improved Evolutionary Algorithm for Parallel Batch Processing Machine Scheduling in Additive Manufacturing.” International Journal of Production Research 58: 2263–2282. doi: 10.1080/00207543.2019.1617447

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.