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-0zbMath1327.90251OpenAlexW2163947723MaRDI QIDQ892384
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
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (13)
Thirty years of heterogeneous vehicle routing ⋮ 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 ⋮ Modeling and solving profitable location and distribution problems ⋮ Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ Verification of Correctness of Parallel Algorithms in Practice ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem ⋮ A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets ⋮ Optimal logistics strategy to distribute medicines in clinics and hospitals ⋮ 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 Vehicle Routing Problems with Many Available Vehicle Types
Uses Software
Cites Work
- Efficient elementary and restricted non-elementary route pricing
- The vehicle routing problem. Latest advances and new challenges.
- The pickup and delivery problem with time windows
- Conflict analysis in mixed integer programming
- 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
- 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
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A metaheuristic for the vehicle-routeing problem with soft time windows
- The General Pickup and Delivery Problem
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
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
