000123939 001__ 123939
000123939 005__ 20240720100807.0
000123939 0247_ $$2doi$$a10.1111/itor.12951
000123939 0248_ $$2sideral$$a124392
000123939 037__ $$aART-2023-124392
000123939 041__ $$aeng
000123939 100__ $$0(orcid)0000-0001-7603-9380$$aCalvete, H.I.$$uUniversidad de Zaragoza
000123939 245__ $$aThe school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic
000123939 260__ $$c2023
000123939 5060_ $$aAccess copy available to the general public$$fUnrestricted
000123939 5203_ $$aThe school bus routing problem (SBRP) involves interrelated decisions such as selecting the bus stops, allocating the students to the selected bus stops, and designing the routes for transporting the students to the school taking into account the bus capacity constraint, with the objective of minimizing the cost of the routes. This paper addresses the SBRP when the reaction of students to the selection of bus stops is taken into account, that is, when students are allowed to choose the selected bus stop that best suits them. A bilevel optimization model with multiple followers is formulated, and its transformation into a single-level mixed integer linear programming (MILP) model is proposed. A simple and effective metaheuristic algorithm is also developed to solve the problem. This algorithm involves solving four MILP problems at the beginning, which can be used to obtain tight upper bounds of the optimal solution. Extensive computational experiments on SBRP benchmark instances from the literature show the effectiveness of the proposed algorithm in terms of both the quality of the solution found and the required computing time.
000123939 536__ $$9info:eu-repo/grantAgreement/ES/DGA/E41-17R$$9info:eu-repo/grantAgreement/ES/DGA/E41-20R$$9info:eu-repo/grantAgreement/ES/MICINN/PID2019-104263RB-C43$$9info:eu-repo/grantAgreement/ES/MINECO/ECO2016-76567-C4-3-R
000123939 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/
000123939 590__ $$a3.1$$b2023
000123939 592__ $$a1.027$$b2023
000123939 591__ $$aMANAGEMENT$$b171 / 401 = 0.426$$c2023$$dQ2$$eT2
000123939 593__ $$aBusiness and International Management$$c2023$$dQ1
000123939 591__ $$aOPERATIONS RESEARCH & MANAGEMENT SCIENCE$$b34 / 106 = 0.321$$c2023$$dQ2$$eT1
000123939 593__ $$aComputer Science Applications$$c2023$$dQ1
000123939 593__ $$aStrategy and Management$$c2023$$dQ1
000123939 593__ $$aManagement Science and Operations Research$$c2023$$dQ1
000123939 593__ $$aManagement of Technology and Innovation$$c2023$$dQ2
000123939 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/publishedVersion
000123939 700__ $$0(orcid)0000-0002-5630-3719$$aGalé, C.$$uUniversidad de Zaragoza
000123939 700__ $$0(orcid)0000-0001-9993-9816$$aIranzo, J.A.$$uUniversidad de Zaragoza
000123939 700__ $$aToth, P.
000123939 7102_ $$12007$$2265$$aUniversidad de Zaragoza$$bDpto. Métodos Estadísticos$$cÁrea Estadís. Investig. Opera.
000123939 773__ $$g30, 2 (2023), 1092-1119$$pInt. trans. oper. res.$$tINTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH$$x0969-6016
000123939 8564_ $$s462501$$uhttps://zaguan.unizar.es/record/123939/files/texto_completo.pdf$$yVersión publicada
000123939 8564_ $$s2210400$$uhttps://zaguan.unizar.es/record/123939/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada
000123939 909CO $$ooai:zaguan.unizar.es:123939$$particulos$$pdriver
000123939 951__ $$a2024-07-19-18:36:40
000123939 980__ $$aARTICLE