A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
From MaRDI portal
Publication:892384
DOI10.1007/S12532-014-0064-0zbMATH Open1327.90251OpenAlexW2163947723MaRDI QIDQ892384FDOQ892384
Authors: Andrea Bettinelli, Alberto Ceselli, Giovanni Righini 
Publication date: 19 November 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0064-0
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
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- The pickup and delivery problem with time windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Conflict analysis in mixed integer programming
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- The vehicle routing problem. Latest advances and new challenges.
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- DRIVE: Dynamic routing of independent vehicles
- New route relaxation and pricing strategies for the vehicle routing problem
- Efficient elementary and restricted non-elementary route pricing
- The General Pickup and Delivery Problem
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact algorithm for the pickup and delivery problem with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
Cited In (15)
- Modeling and solving vehicle routing problems with many available vehicle types
- Iterative column generation algorithm for generalized multi-vehicle covering tour problem
- Verification of correctness of parallel algorithms in practice
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- 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
- Thirty years of heterogeneous vehicle routing
- Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
- Exact solutions for the collaborative pickup and delivery problem
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- Optimal logistics strategy to distribute medicines in clinics and hospitals
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- Modeling and solving profitable location and distribution problems
- Vehicle routing with heterogeneous time windows
Uses Software
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)
