A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
From MaRDI portal
(Redirected from Publication:892384)
Recommendations
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
- A column generation algorithm for the vehicle routing problem with soft time windows
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
- Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An exact algorithm for the pickup and delivery problem with time windows
- Conflict analysis in mixed integer programming
- DRIVE: Dynamic routing of independent vehicles
- Efficient elementary and restricted non-elementary route pricing
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- New route relaxation and pricing strategies for the vehicle routing problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The General Pickup and Delivery Problem
- The pickup and delivery problem with time windows
- The vehicle routing problem. Latest advances and new challenges.
Cited in
(15)- Optimal logistics strategy to distribute medicines in clinics and hospitals
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
- Modeling and solving vehicle routing problems with many available vehicle types
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
- Modeling and solving profitable location and distribution problems
- Verification of correctness of parallel algorithms in practice
- Vehicle routing with heterogeneous time windows
- Thirty years of heterogeneous vehicle routing
- Exact solutions for the collaborative pickup and delivery problem
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Iterative column generation algorithm for generalized multi-vehicle covering tour problem
This page was built for publication: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892384)
