A column generation approach for location-routing problems with pickup and delivery

DOI10.1016/j.ejor.2018.05.055zbMath1403.90091OpenAlexW2807870221WikidataQ129655959 ScholiaQ129655959MaRDI QIDQ1991113

Thomas Capelle, Pablo A. Rey, Louis-Martin Rousseau, Michel Gendreau, Cristián E. Cortés

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.055

zbMATH Keywords

locationroutingpickup and deliverybranch and price

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (9)

A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint ⋮ Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ Location‐routing problem: a classification of recent research ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems ⋮ Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19 ⋮ Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery ⋮ A location-or-routing problem with partial and decaying coverage

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A survey of recent research on location-routing problems
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• Location-routing: issues, models and methods
• Dynamic pickup and delivery problems
• The pickup and delivery problem with time windows
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A hierarchical algorithm for the planar single-facility location routing problem
• The dial-a-ride problem: Models and algorithms
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• A survey of variants and extensions of the location-routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• An Exact Method for the Capacitated Location-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
• On a routing problem
• The Split Delivery Vehicle Routing Problem: A Survey
• The Round-Trip p-Center and Covering Problem on a Tree
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The General Pickup and Delivery Problem
• Distribution of waiting time for dynamic pickup and delivery problems

This page was built for publication: A column generation approach for location-routing problems with pickup and delivery