An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem
Sign Up to like & getrecommendations! Published in 2024 at "Journal of the Operational Research Society"
DOI: 10.1080/01605682.2024.2412214
Abstract: Abstract Vehicle routing problems are encountered in various practical transportation scenarios. One such problem is the dial-a-ride problem (DARP), which involves transporting efficiently passengers from their origin to their destination and whose objective is to… read more here.
Keywords: ride problem; exact branch; problem; price cut ... See more keywords