A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
type: Item
instance of: scholarly article
title: A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
author: David Wolfinger
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350514
zbMATH Keywords: pickup and delivery problem
zbMATH Keywords: split load
zbMATH Keywords: transshipment
zbMATH Keywords: large neighbourhood search
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105110
OpenAlex ID: W3092606725
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: The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
cites work: A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
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: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
cites work: The dial-A-ride problem with transfers
cites work: The Pickup And Delivery Problem With Time Windows And Transshipment
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: A branch-price-and-cut method for a ship routing and scheduling problem with split loads
cites work: Vehicle Routing
DOI: 10.1016/J.COR.2020.105110
description: scientific article; zbMATH DE number 7350514