Branch and price algorithm for route optimization on customized bus service
DOI10.1007/S10479-023-05474-4zbMATH Open1541.90057MaRDI QIDQ6546992FDOQ6546992
T.-Y. Fan, Jiajing Gao, Lu Zhen, Zhiyuan Yang, Xueting He, Junyan Lyu
Publication date: 30 May 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Dynamic pickup and delivery problems
- The dial-a-ride problem: Models and algorithms
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- Typology and literature review for dial-a-ride problems
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- The multi-pickup and delivery problem with time windows
- An effective and fast heuristic for the dial-a-ride problem
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
- Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
- A multi-objective humanitarian pickup and delivery vehicle routing problem with drones
This page was built for publication: Branch and price algorithm for route optimization on customized bus service
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546992)
