{"title":"Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions","authors":"Farnaz Farzadnia, Jens Lysgaard","doi":"10.1016/j.ejtl.2021.100054","DOIUrl":null,"url":null,"abstract":"<div><p>This paper addresses a school bus routing problem, which is classified as a location–allocation–routing problem. The problem consists of selecting pickup locations, allocating students to them, and generating a route that traverses between them. The proposed model is for a single school and a single-route. The objective is to find the subset of pickup stops aiming to minimize the total distance walked by all students from their homes to the respective pickup stops, subject to an upper bound on the route distance of connecting selected stops. We present an exact and heuristic algorithms which are developed based on a layered graph. Computational results are conducted on a series of generated benchmark instances and test data from Norway that demonstrate a good performance of the proposed approach.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100054","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437621000236","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 2
Abstract
This paper addresses a school bus routing problem, which is classified as a location–allocation–routing problem. The problem consists of selecting pickup locations, allocating students to them, and generating a route that traverses between them. The proposed model is for a single school and a single-route. The objective is to find the subset of pickup stops aiming to minimize the total distance walked by all students from their homes to the respective pickup stops, subject to an upper bound on the route distance of connecting selected stops. We present an exact and heuristic algorithms which are developed based on a layered graph. Computational results are conducted on a series of generated benchmark instances and test data from Norway that demonstrate a good performance of the proposed approach.
期刊介绍：
The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
