A column generation approach for the location-routing problem with time windows

DOI10.1016/j.cor.2017.09.010zbMath1391.90059OpenAlexW2754195213MaRDI QIDQ1652527

Haldun Süral, Mohammad Saleh Farham, Cem Iyigun

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.09.010

zbMATH Keywords

column generationtime windowsbranch-and-pricelocation-routing problem

Mathematics Subject Classification ID

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

Related Items (7)

Packed parts delivery problem of automotive inbound logistics with a supplier park ⋮ A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system ⋮ Location‐routing problem: a classification of recent research ⋮ The two-echelon stochastic multi-period capacitated location-routing problem ⋮ Electric vehicles fast charger location-routing problem under ambient temperature ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems ⋮ Hybrid heuristic for the optimal design of photovoltaic installations considering mismatch loss effects

Uses Software

• SCIP

Cites Work

• Unnamed Item
• A survey of recent research on location-routing problems
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Location-routing: issues, models and methods
• Using clustering analysis in a capacitated location-routing problem
• A computational comparison of flow formulations for the capacitated location-routing problem
• Solving VRPTWs with constraint programming based column generation
• A survey of variants and extensions of the location-routing problem
• A taxonomical analysis, current methods and objectives on location-routing problems
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Exact Method for the Capacitated Location-Routing Problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Decomposition Principle for Linear Programs
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Shortest Path Problems with Resource Constraints
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A column generation approach for the location-routing problem with time windows