Continuous approximation models for mixed load school bus routing

Ellegood, William A.; Campbell, James F.; North, Jeremy

doi:10.1016/j.trb.2015.03.018

Cited by 44 publications

(25 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In addition to the algorithm, another great contribution of their study is the benchmark data sets and results that are freely downloadable to evaluate any new approaches. Many papers have used the same benchmark data sets to test new algorithms, including [17,18]. Reference [17] presented a discrete algorithm using continuous approximation modelling, with the focus on minimizing the total travel distance.…”

Section: Literature Reviewmentioning

confidence: 99%

A Metaheuristic Algorithm for Routing School Buses With Mixed Load

et al. 2020

View full text Add to dashboard Cite

Designing a system to solve school bus routing problems (SBRP), especially in a large school district, is very complex and expensive. One of the challenges resides in designing routes for the school buses when they have mixed loads, where each bus transports students for one or more schools at the same time to save the total number of buses required. This article aims to explore whether the algorithm originally developed for pickup and delivery problem with time windows (PDPTW) can be employed for solving mixed load SBRP. We present a PDPTW-based algorithm to address the mixed load SBRP focusing on minimizing the number of buses required. Our algorithm combines a record-to-record travel framework with three neighborhood operators, single paired insertion, swapping pairs between routes, and within route insertion, to improve solution iteratively. Results from implementing this algorithm show that our PDPTW-based algorithm is feasible for mixed load SBRP. Moreover, we found that guided strategy is better than random for permuting nodes that would be selected to relocate positions in a route or among routes. In addition, the results also show that the spatiotemporal connectivity index used in our algorithm can reduce the computation time needed for searching for solutions without affecting the quality of the solutions.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Metaheuristic Algorithm for Routing School Buses With Mixed Load

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Terdapat beberapa peneliti yang telah melakukan penelitian terkait dengan SBRP [4,5,6]. Li dan Fu [7] membahas terkait SBRP dengan meggunakan multi-objective combinatorial optimization.…”

Section: Pendahuluanunclassified

Penentuan Rute Dan Jumlah Kendaraan Pada Kasus School Bus Routing Problem: Penerapan Algoritma Record-to-record Travel

Ramadhan

Imran

2018

JRSI

View full text Add to dashboard Cite

Program bus sekolah gratis merupakan salah satu program yang sedang dikembangkan untuk menunjang kemajuan pendidikan. Penentuan rute dan jumlah bus sekolah yang dapat meminimumkan biaya perjalanan dan pengadaan kendaran merupakan aspek penting dalam menerapkan program bus sekolah tersebut. Penelitian ini membangun algoritma dan program perangkat lunak untuk model school bus routing problem (SBRP) yang dapat meminimisasi biaya perjalanan dan biaya investasi jumlah kendaraan bus. Algoritma record-to-record travel digunakan untuk mendapatkan solusi yang baik dengan waktu komputasi yang relatif cepat pada program perangkat lunak yang dibangun. Karakteristik model SBRP pada penelitian ini, bus memiliki kapasitas terbatas dan homogen, titik awal bus berada di depot, lalu mendatangi beberapa halte dimana setiap halte memiliki jumlah penumpang yang deterministik. Setelah mendatangi halte terakhir, bus akan mendatangi halte dengan arah kebalikannya yang diakhiri di titik awal (depot). Program bus sekolah gratis di Kota Bandung dijadikan objek penelitian mengingat program tersebut sedang diterapkan dan dievaluasi untuk meningkatkan efektivitas penggunaannya. Hasil yang didapatkan pada penelitian ini, model SBRP dan algoritma record-to-record travel yang dibangun dan diujikan pada kasus bus sekolah di Kota Bandung memperlihatkan solusi yang layak dan baik. Proses pengelompokkan bus per wilayah Kota Bandung dapat dihasilkan dan menunjukkan biaya perjalanan dan biaya investasi pengadaan kendaraan bus yang minimum. Selain itu, algoritma ini terbukti dapat menyelesaikan permasalahan SBRP dengan waktu komputasi yang cepat, yaitu dibawah 10 detik.

show abstract

“…These authors propose a heuristic based on a destroy and repair optimization approach. The case of mixed loads, where the buses are allowed to carry students from more than one school at the same time, is dealt with by Ellegood et al [4], who provide a general analysis to assess the conditions under which mixed loading is likely to be beneficial. Souza Lima et al [5,6] deal with a multiobjective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads.…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2020

View full text Add to dashboard Cite

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.

show abstract

Continuous approximation models for mixed load school bus routing

Cited by 44 publications

References 42 publications

A Metaheuristic Algorithm for Routing School Buses With Mixed Load

A Metaheuristic Algorithm for Routing School Buses With Mixed Load

Penentuan Rute Dan Jumlah Kendaraan Pada Kasus School Bus Routing Problem: Penerapan Algoritma Record-to-record Travel

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

Contact Info

Product

Resources

About