331. The rescheduling school bus routing problem under a constraint on the number of students with negative impact
Invited abstract in session WA-15: Discrete, continuous or stochastic optimization and control in networks, transportation and design 1, stream Combinatorial Optimization.
Wednesday, 8:30-10:00Room: Esther Simpson 1.08
Authors (first author is the speaker)
| 1. | THU HUONG DANG
|
| Mathematics and Statistics, Management Science, Lancaster University | |
| 2. | Quy Ta Dinh
|
| National Economics University | |
| 3. | Hoang Ha Minh
|
| National Economics University | |
| 4. | Tien Mai
|
| Singapore Management University | |
| 5. | Duc Minh Vu
|
| National Economics University |
Abstract
This study presents a case study of the School Bus Routing Problem (SBRP), focusing on improving the quality of student transportation services. Although numerous studies have addressed the SBRP, this study tackles a new variant driven by a negative impact policy to limit the number of continuing students facing extended travel times. We present this variant and propose a mathematical formulation along with a hybrid metaheuristic approach for it. Furthermore, we conduct comprehensive experiments to evaluate algorithms' performance and various configurations of the negative impact policy on both artificial and real instances. Computational results confirm the effectiveness of our hybrid algorithm.
Keywords
- Vehicle Routing
- Transportation
- Combinatorial Optimization
Status: accepted
Back to the list of papers