A column generation approach for location-routing problems with pickup and delivery
type: Item
instance of: scholarly article
title: A column generation approach for location-routing problems with pickup and delivery
zbMATH Open document ID: 1403.90091
author: Thomas Capelle
author: Cristián E. Cortés
author: Michel Gendreau
author: Pablo A. Rey
author: Louis-Martin Rousseau
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6968047
zbMATH Keywords: routing
zbMATH Keywords: location
zbMATH Keywords: pickup and delivery
zbMATH Keywords: branch and price
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.05.055
OpenAlex ID: W2807870221
cites work: The Split Delivery Vehicle Routing Problem: A Survey
cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
cites work: An exact method for the capacitated location-routing problem
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: On a routing problem
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: Dynamic pickup and delivery problems
cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: The dial-a-ride problem: Models and algorithms
cites work: An iterated local search for solving a location-routing problem
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: A note on two problems in connexion with graphs
cites work: A survey of variants and extensions of the location-routing problem
cites work: The pickup and delivery problem with time windows
cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
cites work: A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
cites work: The Round-Trip p-Center and Covering Problem on a Tree
cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
cites work: A hierarchical algorithm for the planar single-facility location routing problem
cites work: Location-routing: issues, models and methods
cites work: A survey of recent research on location-routing problems
cites work: Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
cites work: The General Pickup and Delivery Problem
cites work: Distribution of waiting time for dynamic pickup and delivery problems
Wikidata QID: Q129655959
DOI: 10.1016/J.EJOR.2018.05.055
description: scientific article; zbMATH DE number 6968047