Real-time passenger bus routing problems with preferences and tradeoffs
From MaRDI portal
Publication:6113072
DOI10.1007/s10472-022-09812-3MaRDI QIDQ6113072
Roland H. C. Yap, Suhendry Effendy
Publication date: 10 July 2023
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- The school bus routing problem: a review
- Approximation algorithms for combinatorial problems
- On the capacitated vehicle routing problem
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
- An efficient transformation of the generalized vehicle routing problem
- New mathematical models of the generalized vehicle routing problem and extensions
- The Truck Dispatching Problem
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Reducibility among Combinatorial Problems
- Analytical approach to parallel repetition
This page was built for publication: Real-time passenger bus routing problems with preferences and tradeoffs