Branch and price algorithm for route optimization on customized bus service
From MaRDI portal
Publication:6546992
Recommendations
- scientific article; zbMATH DE number 7266752
- Pricing problem of customized bus under different market strategies
- A personalized walking bus service requiring optimized route decisions: a real case
- The research on models \& algorithms based on double-deck programming for bus scheduling
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- A multi-objective humanitarian pickup and delivery vehicle routing problem with drones
- 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
- Dynamic pickup and delivery problems
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Non-elementary formulations for single vehicle routing problems with pickups and deliveries
- The dial-a-ride problem: Models and algorithms
- The multi-pickup and delivery problem with time windows
- Typology and literature review for dial-a-ride problems
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)