A heuristic solution to the warehouse location-routing problem
From MaRDI portal
Cites work
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Computer Solutions of the Traveling Salesman Problem
- Dynamic Location-routeing Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- scientific article; zbMATH DE number 3883903 (Why is no real title available?)
- scientific article; zbMATH DE number 3912104 (Why is no real title available?)
- scientific article; zbMATH DE number 3805267 (Why is no real title available?)
- Implementation techniques for the vehicle routing problem
- Implementing vehicle routing algorithms
- Optimal Routing under Capacity and Distance Restrictions
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Cited in
(28)- 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
- Location and layout planning. A survey
- Resource planning and a depot location model for electric power restoration.
- Heuristic solutions to multi-depot location-routing problems
- A survey of the standard location-routing problem
- Distribution network design: New problems and related models
- A computational comparison of flow formulations for the capacitated location-routing problem
- Designing radio-mobile access networks based on synchronous digital hierarchy rings
- Routing problems: A bibliography
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- Distribution systems design with two-level routing considerations
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- A new formulation approach for location-routing problems
- A taxonomical analysis, current methods and objectives on location-routing problems
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- Distribution network design on the battlefield
- 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
- Fifty years of location theory -- a selective review
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Application of neutrosophic fuzzy set for efficient placement of health centers for marburg virus
- New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains
- Location-routing: issues, models and methods
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
This page was built for publication: A heuristic solution to the warehouse location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331555)
