Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/7597
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÖner, Nihat-
dc.contributor.authorGültekin, Hakan-
dc.contributor.authorKoç, Çağrı-
dc.date.accessioned2021-09-11T15:58:08Z-
dc.date.available2021-09-11T15:58:08Z-
dc.date.issued2020en_US
dc.identifier.issn0020-7543-
dc.identifier.issn1366-588X-
dc.identifier.urihttps://doi.org/10.1080/00207543.2020.1841317-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/7597-
dc.description.abstractThis paper introduces the airport shuttle bus scheduling problem (ASBSP) as a new practical scheduling variant. In this problem, a number of identical vehicles that have a specific number of available seats provides transfer service between the airport and the city centre. After making a transfer in one direction, the vehicle can either make a new transfer in the opposite direction depending on the availability and the schedule of the passengers or make an empty return to make a new transfer in the same direction. The vehicles can wait in either location until their next transfer. The passengers have certain time windows for the transfer in relation to their flight times and operational rules to satisfy customer satisfaction. This is a profit-seeking service where transfer requests can also be rejected. The ASBSP aims to prepare a daily schedule for the available vehicles and to assign passengers to these vehicles with the objective of maximising the total profit. This paper presents two alternative mixed integer programming formulations and proposes two valid inequalities to get better bounds. Furthermore, it develops a hybrid metaheuristic that integrates multi-start, simulated annealing and large neighbourhood search for its solution. Extensive computational experiments on real-life benchmark instances have been made to test the performances of the formulations and the hybrid metaheuristic. Furthermore, the impacts of several problem parameters including the number of vehicles, vehicle capacity, transfer fee, transportation time and allowable passenger waiting times on the problem complexity and results have been investigated.en_US
dc.description.sponsorshipScientific Research Projects Coordination Unit of Social Sciences University of Ankara [SBF-2019-190]en_US
dc.description.sponsorshipThe authors gratefully acknowledge funding provided by the Scientific Research Projects Coordination Unit of Social Sciences University of Ankara under grant SBF-2019-190.en_US
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofInternational Journal of Production Researchen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAirport shuttle bus serviceen_US
dc.subjectschedulingen_US
dc.subjecthybrid metaheuristicen_US
dc.titleThe airport shuttle bus scheduling problemen_US
dc.typeArticleen_US
dc.departmentFaculties, Faculty of Engineering, Department of Industrial Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümütr_TR
dc.authorid0000-0002-5416-3249-
dc.authorid0000-0002-7377-204X-
dc.identifier.wosWOS:000590284200001en_US
dc.identifier.scopus2-s2.0-85096158645en_US
dc.institutionauthorGültekin, Hakan-
dc.identifier.doi10.1080/00207543.2020.1841317-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.dept02.4. Department of Industrial Engineering-
Appears in Collections:Endüstri Mühendisliği Bölümü / Department of Industrial Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record

CORE Recommender

SCOPUSTM   
Citations

1
checked on Sep 23, 2022

WEB OF SCIENCETM
Citations

4
checked on Sep 24, 2022

Page view(s)

22
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.