Solving the capacitated location-routing problem. Abstract of Thesis

DOI10.1007/s10288-007-0039-3zbMath1160.90554OpenAlexW2028601244MaRDI QIDQ926566

Caroline Prodhon

Publication date: 20 May 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0039-3

zbMATH Keywords

heuristiccutting planelocation routing problemcooperative approach

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Uses Software

• VRP
• CVRPSP

Cites Work

• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The effect of ignoring routes when locating depots
• Combined location-routing problems: A synthesis and future research directions
• A two-phase tabu search approach to the location routing problem
• Greedy randomized adaptive search procedures
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

This page was built for publication: Solving the capacitated location-routing problem. Abstract of Thesis