A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
A matching-based heuristic algorithm for school bus routing problems
[article]
2018
pre-print
Preserved Fulltext
A novel two-step heuristic adopting the trip compatibility idea is presented to solve the school bus routing problem. ...
The first step finds an initial solution using an iterative minimum cost matching-based insertion heuristic. ...
In this study, we develop a two-step heuristic algorithm for solving the school bus routing problem with the consideration of trip compatibility. ...
doi:10.1016/j.trb.2018.09.004
arXiv:1807.05311v1
fatcat:fhpbpatdfvh3xjoopl43am7p7u
Balanced scheduling of school bus trips using a perfect matching heuristic
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper proposes a Mixed Integer Programming (MIP) model and a matching-based heuristic algorithm to solve the balanced school bus scheduling problem in a multi-school setting. ...
In the school bus scheduling problem, the main contributing factor to the cost is the number of buses needed for the operations. ...
Due to the complexity of the problem, for larger instances, a matching based heuristic algorithm is proposed. ...
arXiv:1708.09338v3
fatcat:ime6umw27nd3dbequexy5rhkla
A Bounded Formulation for The School Bus Scheduling Problem
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper proposes a new formulation for the school bus scheduling problem (SBSP) which optimizes school start times and bus operation times to minimize transportation cost. ...
Based on a strengthened version of the linear relaxation of the ILP, we develop a dependent randomized rounding algorithm that yields near-optimal solutions for large-scale problem instances. ...
The authors thank the administrative staff of Evanston/Skokie Public School District 65. ...
arXiv:1803.09040v2
fatcat:eyasa6nggjhgjlbtccqetss6be
School bus Routing Problem: Contemporary Trends and Research Directions
2019
Omega : The International Journal of Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
From Table 6 , 30% of the SBRP bus route generation papers use insertion heuristics in route construction. Shafahi et al. [90] provide a minimum cost matching-based insertion heuristic. ...
[49] solve a bus stop selection problem using a heuristic procedure and a mixed load routing problem with a GA. Chalkia et al. ...
doi:10.1016/j.omega.2019.03.014
fatcat:sfldjf3l4vamnfdp5747bcq5la
Open Vehicle Routing Problem by Ant Colony Optimization
2014
International Journal of Advanced Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A key aspect of this algorithm is to plan the routes of buses that must pick up and deliver the school students from various bus stops on time, especially in the case of far distance covered by the vehicle ...
This work proposes the Ant Colony Optimization (ACO)-TSP algorithm to eliminate the tour loop for Open Vehicle routing Problem (OVRP). ...
Taehyeong Kim and Bum-Jin Park 2013 [13] " Model and Algorithm for Solving School Bus Problem" presents the model for school bus routing problem is proposed, and a heuristic algorithm for solving the ...
doi:10.14569/ijacsa.2014.050308
fatcat:6vbsjprf3ja4tp74afatbhkvxu
Heuristic solutions to the problem of routing school buses with multiple objectives
2002
Journal of the Operational Research Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper, we address the problem of routing school buses in a rural area. We approach this problem with a node routing model with multiple objectives that arise from conflicting viewpoints. ...
We develop a solution procedure that considers each objective separately and search for a set of efficient solutions instead of a single optimum. ...
Constructive Heuristic H1 This heuristic is based on a clustering mechanism. ...
doi:10.1057/palgrave.jors.2601324
fatcat:7xdcgj4zp5benai3qmai7kntsi
Shareability Network Based Decomposition Approach for Solving Large-scale Single School Routing Problems
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2009.13468v1 fatcat:ypgfo225zbep3ov2zbvktwnb6e
To scale this method to large-scale problem instances, we propose i) a node compression method for the shareability network based decomposition approach, and ii) heuristic-based edge pruning techniques ...
We consider the Single School Routing Problem (SSRP) where students from a single school are picked up by a fleet of school buses, subject to a set of constraints. ...
Government assumes no liability for the contents or use thereof. The authors would also like to thank Yang Liu for his comments on the paper. ...
arXiv:2009.13468v2
fatcat:rdejfkeu6bb5nkyxbelwn5ecvm
Solving School Bus Routing Problem by Intelligent Water Drops Algorithm
2020
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The School Bus Routing Problem (SBRP) is an essential subject in the development of transportation. ...
bus capacity and the time window of a school. ...
Ethics This manuscript is allowed to be acceseed based on the rules of the sience publications. Readers also can inquery the authors about anything related to this publication. ...
doi:10.3844/jcssp.2020.25.34
fatcat:uwxbozp6yvbn5g5my4k5whk774
Page 908 of The Journal of the Operational Research Society Vol. 54, Issue 8
[page]
2003
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The procedure is based on the Christo- fides> approximation algorithm for the traveling salesman problem (TSP) and has a worst-case performance ratio of 3 2. Finally, Corberan et al? ...
Such problems are routing where several children living on the same street must be
common in school bus
collected by stopping at each house, but also groups of
children who have to walk from their home ...
Trends in Models and Algorithms for Fleet Management
2011
Procedia - Social and Behavioral Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For example, with reference to the classical Vehicle Routing Problem (VRP), representing the most relevant problem in freight distribution in road transport, the research community has turned to variants ...
Many fleet management problems correspond to combinatorial optimization problems, such as vehicle routing and scheduling, that are notoriously difficult to solve, even in a static context. ...
The paper by Park and Kim (2010) aims to provide a comprehensive review of the school bus routing problem. ...
doi:10.1016/j.sbspro.2011.08.004
fatcat:7tgw664otbcobbqxlz2iirlehy
Tabu search for a multi-objective routing problem
2006
Journal of the Operational Research Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we address the problem of routing school buses with two objectives: minimize the number of buses, and minimize the longest time a student would have to stay in the bus. ...
Computational experiments with real data in the context of routing school buses in a rural area, establish the effectiveness of our procedure in relation to the approach previously identified to be best ...
Conclusions We have developed a heuristic procedure based on the tabu search methodology to provide high quality solutions to the problem of routing school buses in a rural area. ...
doi:10.1057/palgrave.jors.2601917
fatcat:zunbei2225df7lrfutgcbunz74
The School Bus Problem on Trees
2012
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not ...
In this paper, we give a polynomial time 4-approximation algorithm when the children and school are located at vertices of a fixed tree. ...
Many practical problems involving school buses have been studied, but primarily within the context of heuristic methods for real-life instances. ...
doi:10.1007/s00453-012-9711-x
fatcat:go3nrumh45e6rc26vyor3ijj2q
The School Bus Problem on Trees
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not ...
In this paper, we give a polynomial time 4-approximation algorithm when the children and school are located at vertices of a fixed tree. ...
Many practical problems involving school buses have been studied, but primarily within the context of heuristic methods for real-life instances. ...
doi:10.1007/978-3-642-25591-5_3
fatcat:enyzlkn3wrh2va3lgtjjld2nqi
A Repeated Matching Heuristic for the Vehicle Routeing Problem
1994
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Repeated Matching Heuristic for the Vehicle Routeing Problem
Step 9. ...
Miter (1974) A heuristic algorithm for the vehicle dispatch problem. Opns Res. 22, 340-349.
. M. L. Fisher and R. JarkumMar (1981) A generalized assignment heuristic for vehicle routing. ...
doi:10.1038/sj/jors/0451006
fatcat:nyu2umokg5eonn2mzeng47u3e4
A Repeated Matching Heuristic for the Vehicle Routeing Problem
1994
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Repeated Matching Heuristic for the Vehicle Routeing Problem
Step 9. ...
Miter (1974) A heuristic algorithm for the vehicle dispatch problem. Opns Res. 22, 340-349.
. M. L. Fisher and R. JarkumMar (1981) A generalized assignment heuristic for vehicle routing. ...
doi:10.1057/jors.1994.185
fatcat:krr4ozclxnb4jo4d2x3zul4jb4
« Previous
Showing results 1 — 15 out of 1,765 results