A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

Calvete, H.I. (Universidad de Zaragoza) ; Gale, C. (Universidad de Zaragoza) ; Iranzo, J.A. (Universidad de Zaragoza) ; Toth, P.

Resumen: This paper addresses the school bus routing problem with bus stop selection, which jointly handles the problems of determining the set of bus stops to visit, allocating each student to one of these bus stops and computing the routes that visit the selected bus stops, so that the total routing cost is minimized and the walking distance of the students is limited by a given value. A fast and efficient matheuristic is developed based on an innovative approach that first partially allocates the students to a set of active stops that they can reach, and computes a set of routes that minimizes the routing cost. Then, a refining process is performed to complete the allocation and to adapt the routes until a feasible solution is obtained. The algorithm is tested on a set of benchmark instances. The computational results show the efficiency of the algorithm in terms of the quality of the solutions yielded and the computing time.

Idioma: Inglés

DOI: 10.3390/math8081214

Año: 2020

Publicado en: Mathematics 8, 8 (2020), 1214 [20 pp]
ISSN: 2227-7390

Factor impacto JCR: 2.258 (2020)

Categ. JCR: MATHEMATICS rank: 24 / 330 = 0.073 (2020) - Q1 - T1

Factor impacto SCIMAGO: 0.495 - Mathematics (miscellaneous) (Q2)

Financiación: info:eu-repo/grantAgreement/ES/DGA/E41-20R
Financiación: info:eu-repo/grantAgreement/ES/MINECO/ECO2016-76567-C4-3-R

Tipo y forma: Artículo (Versión definitiva)

Área (Departamento): Área Estadís. Investig. Opera. (Dpto. Métodos Estadísticos)