A Local Search-based Metaheuristic Algorithm Framework for the School Bus Routing Problem

School bus service is divided into many kinds of operation modes, such as single school, single load multiple schools and mixed load multiple schools and so on. When it comes to plan bus routes satisfying various constraints and different objectives, there are many applications of school bus routing...

Full description

Saved in:
Bibliographic Details
Published in:Engineering letters Vol. 30; no. 1; p. 17
Main Authors: Hou, Yane, Liu, Bingbing, Dang, Lanxue, He, Wenwen, Gu, Wenbo
Format: Journal Article
Language:English
Published: Hong Kong International Association of Engineers 24.02.2022
Subjects:
Algorithms
Buses (vehicles)
Data structures
Heuristic methods
Route planning
School buses
Searching
Simulated annealing
Vehicle routing
ISSN:1816-093X, 1816-0948
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract School bus service is divided into many kinds of operation modes, such as single school, single load multiple schools and mixed load multiple schools and so on. When it comes to plan bus routes satisfying various constraints and different objectives, there are many applications of school bus routing problem (SBRP). It is generally recognized that middle and large sacle SBRP applications are resolved by heuristic algorithms, because SBRP is a NP-hard problem. This paper proposes a local search-based metaheuristic algorithm framework for SBRP on the basis of analysis of SBRP problem models. The framework, which is implemented by C#, is made up of basic data structures, operation functions, neighborhood operators, initial solution construction algorithm components and heuristic strategies, etc. The neighborhoodcentered metaheuristic algorithms, such as simulated annealing (SA), iterated local search (ILS), variable neighborhood search (VNS), can be designed based on the framework to solve a certain problem type of SBRP. Using this framework, we can solve three operation modes SBRP with homogeneous or heterogeneous bus fleet. Moreover, the proposed metaheuristic framework also provides the development of metaheuristic for the capacitated vehicle routing problem(CVRP) by reducing or modifying the constraints of SBRP. The experimental results of a set of instances show that the metaheuristic algorithm built based on the proposed framework, can be quickly realized and applied to different SBRP applications. Meanwhile, the designed metaheuristic framework is also very effective and extensible.
AbstractList School bus service is divided into many kinds of operation modes, such as single school, single load multiple schools and mixed load multiple schools and so on. When it comes to plan bus routes satisfying various constraints and different objectives, there are many applications of school bus routing problem (SBRP). It is generally recognized that middle and large sacle SBRP applications are resolved by heuristic algorithms, because SBRP is a NP-hard problem. This paper proposes a local search-based metaheuristic algorithm framework for SBRP on the basis of analysis of SBRP problem models. The framework, which is implemented by C#, is made up of basic data structures, operation functions, neighborhood operators, initial solution construction algorithm components and heuristic strategies, etc. The neighborhoodcentered metaheuristic algorithms, such as simulated annealing (SA), iterated local search (ILS), variable neighborhood search (VNS), can be designed based on the framework to solve a certain problem type of SBRP. Using this framework, we can solve three operation modes SBRP with homogeneous or heterogeneous bus fleet. Moreover, the proposed metaheuristic framework also provides the development of metaheuristic for the capacitated vehicle routing problem(CVRP) by reducing or modifying the constraints of SBRP. The experimental results of a set of instances show that the metaheuristic algorithm built based on the proposed framework, can be quickly realized and applied to different SBRP applications. Meanwhile, the designed metaheuristic framework is also very effective and extensible.
Author Gu, Wenbo
He, Wenwen
Liu, Bingbing
Dang, Lanxue
Hou, Yane
Author_xml – sequence: 1
  givenname: Yane
  surname: Hou
  fullname: Hou, Yane
– sequence: 2
  givenname: Bingbing
  surname: Liu
  fullname: Liu, Bingbing
– sequence: 3
  givenname: Lanxue
  surname: Dang
  fullname: Dang, Lanxue
– sequence: 4
  givenname: Wenwen
  surname: He
  fullname: He, Wenwen
– sequence: 5
  givenname: Wenbo
  surname: Gu
  fullname: Gu, Wenbo
BookMark eNo9jV1LwzAYRoNMcM79h4DXhXy26WUdToWK4hT0auTN3q7VtplJin9_A8Wr55yb81yS2ehHPCNzbniesVKZ2T_L9wuyjLEDplQhdcn0nHxUtPbO9nSDNrg2AxtxRx8x2Ran0MXUOVr1ex-61A50HeyAPz580cYHmlqkG9d639ObKdIXP6Vu3NPn4KHH4YqcN7aPuPzbBXlb376u7rP66e5hVdXZgRuZMmsUutLyBkACgHPAZb5zxjkuwFinipMVueAcjEYpc2ACCqZVbpRutJELcv3bPQT_PWFM208_hfF0uRW5EqUslWDyCC7kUhA
ContentType Journal Article
Copyright Copyright International Association of Engineers Feb 24, 2022
Copyright_xml – notice: Copyright International Association of Engineers Feb 24, 2022
DBID 7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DatabaseName Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Civil Engineering Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1816-0948
GroupedDBID 29G
2WC
5GY
5VS
7SC
7TB
8FD
AAKPC
ABDBF
ACIWK
ACUHS
ADMLS
ALMA_UNASSIGNED_HOLDINGS
EOJEC
ESX
FR3
I-F
JQ2
KQ8
KR7
L7M
L~C
L~D
MK~
OBODZ
OK1
OVT
P2P
TR2
TUS
~8M
ID FETCH-LOGICAL-p183t-a84ec9a1fbb3bbbccb136dc8cc12b8ac476dc76211b85e336b02b70546845f583
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000762167900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1816-093X
IngestDate Mon Jun 30 05:20:34 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p183t-a84ec9a1fbb3bbbccb136dc8cc12b8ac476dc76211b85e336b02b70546845f583
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2642939420
PQPubID 2049041
ParticipantIDs proquest_journals_2642939420
PublicationCentury 2000
PublicationDate 2022-02-24
PublicationDateYYYYMMDD 2022-02-24
PublicationDate_xml – month: 02
  year: 2022
  text: 2022-02-24
  day: 24
PublicationDecade 2020
PublicationPlace Hong Kong
PublicationPlace_xml – name: Hong Kong
PublicationTitle Engineering letters
PublicationYear 2022
Publisher International Association of Engineers
Publisher_xml – name: International Association of Engineers
SSID ssib044735905
ssj0000314636
Score 2.1987739
Snippet School bus service is divided into many kinds of operation modes, such as single school, single load multiple schools and mixed load multiple schools and so...
SourceID proquest
SourceType Aggregation Database
StartPage 17
SubjectTerms Algorithms
Buses (vehicles)
Data structures
Heuristic methods
Route planning
School buses
Searching
Simulated annealing
Vehicle routing
Title A Local Search-based Metaheuristic Algorithm Framework for the School Bus Routing Problem
URI https://www.proquest.com/docview/2642939420
Volume 30
WOSCitedRecordID wos000762167900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1816-0948
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044735905
  issn: 1816-093X
  databaseCode: M~E
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV05b9swFCaaoEM7BE0PtM0BDkEXgYBo0jpGp3CQQXEyOK07GSRNNQZS2bWlxFN-ex4PHUaAIB26CBIlCIK-j-89Pr4DoRMppVKwPiZxSHPCU6Zgzoke0SzWVAnOuC3q8yOLR6NkMkmv_HbB2rYTiIsi2WzS5X-FGsYAbJM6-w9wNy-FATgH0OEIsMPxRcAPgszop8AFEhOjpmbBhS7Fja5cWeZgcPt7sZqXN3-M3epis5pwQ1-W87RaByZayHgSrlzTmS0nflvGMLi1GUGNbX6-qKxcF-2GfTa3Q6fwtKxVpfWOO0GTiWJTtQSzLtafurj3WWreJwHLWZPj3fokt52ZHZ7ZaEn_gR1fJFgZEQlT2xgYlFJ3zJXhrEW138LpUtLJXZf_uV1Oe3Q5PbvOsul4OBl_W_4lptOY2ZH3bVd20A4LTbeFi4dhLYG4acSceglodTmjpqKaWbXX3_hEaVtLZPwO7fklBB446PfRK128R287iHxAvwbYkgB3SYC3SIAbEuCGBBhIgIEE2JEAAwmwJwH2JPiIrs-G4-_nxDfRIEuQ1iURCdcqFTSXktmJKSmLZipRivZkIhSP4Qo0IqUy6WvGIhn2ZAyGfJTwft5P2Ce0WywK_RlhwXgaqpnSNM-55lToKGYa5jic5nImvqDD-s9M_YRYT8HgBosy5b3w6_O3D9CblkqHaLdcVfoIvVZ35Xy9OrYwPQJFbWOO
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Local+Search-based+Metaheuristic+Algorithm+Framework+for+the+School+Bus+Routing+Problem&rft.jtitle=Engineering+letters&rft.au=Hou%2C+Yane&rft.au=Liu%2C+Bingbing&rft.au=Dang%2C+Lanxue&rft.au=He%2C+Wenwen&rft.date=2022-02-24&rft.pub=International+Association+of+Engineers&rft.issn=1816-093X&rft.eissn=1816-0948&rft.volume=30&rft.issue=1&rft.spage=17&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1816-093X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1816-093X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1816-093X&client=summon