A heuristic solution to the warehouse location-routing problem

DOI10.1016/0377-2217(94)90010-8zbMath0925.90245OpenAlexW2030407706MaRDI QIDQ1331555

S. Hjortkjær, B. Hegedahl, P. H. Hansen, Børge Obel

Publication date: 8 November 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90010-8

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (26)

A new formulation approach for location-routing problems ⋮ Designing radio-mobile access networks based on synchronous digital hierarchy rings ⋮ Distribution network design on the battlefield ⋮ Location-routing: issues, models and methods ⋮ A math-heuristic for the warehouse location-routing problem in disaster relief ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ A two-phase hybrid heuristic algorithm for the capacitated location-routing problem ⋮ Routing problems: A bibliography ⋮ Location and layout planning. A survey ⋮ A survey of the standard location-routing problem ⋮ An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ Resource planning and a depot location model for electric power restoration. ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem ⋮ Distribution network design: New problems and related models ⋮ Distribution systems design with two-level routing considerations ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A computational comparison of flow formulations for the capacitated location-routing problem ⋮ New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow ⋮ Combined location-routing problems -- a neural network approach ⋮ Robust supply chain design under uncertain demand in agile manufacturing ⋮ Combined location-routing problems: A synthesis and future research directions ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ Heuristic solutions to multi-depot location-routing problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementation techniques for the vehicle routing problem
• Optimal Routing under Capacity and Distance Restrictions
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Dynamic Location-routeing Problems
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Implementing vehicle routing algorithms
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A heuristic solution to the warehouse location-routing problem