The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
type: Item
instance of: scholarly article
title: The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
zbMATH Open document ID: 1487.90182
author: David Wolfinger
author: Juan-José Salazar-González
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7354332
zbMATH Keywords: routing
zbMATH Keywords: pickup and delivery
zbMATH Keywords: split loads
zbMATH Keywords: transshipments
zbMATH Keywords: branch-and-cut
describes a project that uses: Concorde
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.032
OpenAlex ID: W3045470676
cites work: A column generation approach for the split delivery vehicle routing problem
cites work: The Split Delivery Vehicle Routing Problem: A Survey
cites work: Vehicle routing problems with split deliveries
cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
cites work: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
cites work: Vehicle routing with split deliveries
cites work: Savings by Split Delivery Routing
cites work: Split delivery routing
cites work: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
cites work: Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
cites work: Vehicle routing with cross-dock selection
cites work: The dial-A-ride problem with transfers
cites work: A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
cites work: The Pickup And Delivery Problem With Time Windows And Transshipment
cites work: Q4532225
cites work: A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
cites work: An empirical study on the benefit of split loads with the pickup and delivery problem
cites work: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
cites work: New mixed integer-programming model for the pickup-and-delivery problem with transshipment
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: A branch-price-and-cut method for a ship routing and scheduling problem with split loads
cites work: Vehicle Routing
cites work: Q4254875
DOI: 10.1016/J.EJOR.2020.07.032
description: scientific article; zbMATH DE number 7354332