Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation

DOI10.1007/978-0-387-48793-9_9MaRDI QIDQ3439976zbMATH OpenOpenAlexFDO

Authors Zeynep Özyurt, Deniz Aksen

Publication date 21 May 2007

Published in Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-48793-9_9

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Heuristic solutions to multi-depot location-routing problems
• The Multi-Depot Routing Allocation Problem
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Lagrangean relaxation-based techniques for solving facility location problems
• An iterated local search algorithm for latency vehicle routing problems with multiple depots
• scientific article; zbMATH DE number 1361557
• Formulations and relaxations for a multi-echelon capacitated location-distribution problem
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands

Cited in

(12)

• A survey of the standard location-routing problem
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• Primal-dual schema and Lagrangian relaxation for the k-location-routing problem
• Distribution network design on the battlefield
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls
• An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz -optimal approach using Lagrangian relaxation
• A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
• Planning a capacitated road network with flexible travel times: a genetic algorithm

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439976)