A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
type: Item
instance of: scholarly article
title: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
zbMATH Open document ID: 1327.90251
author: Andrea Bettinelli
author: Alberto Ceselli
author: Giovanni Righini
published in: Mathematical Programming Computation
publication date: 2015-11-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6511609
describes a project that uses: SCIP
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s12532-014-0064-0
OpenAlex ID: W2163947723
cites work: Conflict analysis in mixed integer programming
cites work: Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem
cites work: A metaheuristic for the vehicle-routeing problem with soft time windows
cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
cites work: The pickup and delivery problem with time windows
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
cites work: A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
cites work: Efficient elementary and restricted non-elementary route pricing
cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: The General Pickup and Delivery Problem
cites work: DRIVE: Dynamic routing of independent vehicles
cites work: Pickup and Delivery of Partial Loads with “Soft” Time Windows
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
DOI: 10.1007/S12532-014-0064-0
description: scientific article; zbMATH DE number 6511609