The many-to-many location-routing problem

DOI10.1007/BF02564791zbMath0916.90182MaRDI QIDQ1284602

Said Salhi, Gábor Nagy

Publication date: 26 April 1999

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

heuristicsmany to many location routing

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (25)

Hub location problems with price sensitive demands ⋮ Distribution network design on the battlefield ⋮ Location-routing: issues, models and methods ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ An endosymbiotic evolutionary algorithm for the hub location-routing problem ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours ⋮ A Branch-and-Cut method for the Capacitated Location-Routing Problem ⋮ Location‐routing problem: a classification of recent research ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effect of ignoring routes when locating depots
• The vehicle routing problem: An overview of exact and approximate algorithms
• A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
• Nested Heuristic Methods for the Location-Routeing Problem

This page was built for publication: The many-to-many location-routing problem