A compact model and tight bounds for a combined location-routing problem
From MaRDI portal
Publication:1886846
DOI10.1016/S0305-0548(03)00245-4zbMath1061.90016OpenAlexW2031733044MaRDI QIDQ1886846
Juan A. Díaz, Elena Fernández, Maria Albareda-Sambola
Publication date: 19 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00245-4
Search theory (90B40) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (38)
A new formulation approach for location-routing problems ⋮ Distribution network design on the battlefield ⋮ A survey of recent research on location-routing problems ⋮ A survey of variants and extensions of the location-routing problem ⋮ The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm ⋮ Location-routing: issues, models and methods ⋮ Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ A solution method for a two-layer sustainable supply chain distribution model ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Battery swap station location-routing problem with capacitated electric vehicles ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ Variable neighborhood search for location routing ⋮ A two-phase hybrid heuristic algorithm for the capacitated location-routing problem ⋮ Solution method for the location planning problem of logistics park with variable capacity ⋮ Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking ⋮ A dynamic logistics coordination model for evacuation and support in disaster response activities ⋮ An endosymbiotic evolutionary algorithm for the hub location-routing problem ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ A Branch-and-Cut method for the Capacitated Location-Routing Problem ⋮ A survey of the standard location-routing problem ⋮ Location routing problems on trees ⋮ A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case ⋮ A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem ⋮ The capacity and distance constrained plant location problem ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ Solving a bi-objective transportation location routing problem by metaheuristic algorithms ⋮ A metaheuristic to solve a location-routing problem with nonlinear costs ⋮ Distribution systems design with two-level routing considerations ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ Combined location-routing problems -- a neural network approach ⋮ A taxonomical analysis, current methods and objectives on location-routing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the capacitated vehicle routing problem
- Vehicle routing considerations in distribution system design
- The effect of ignoring routes when locating depots
- A comparative study of heuristics for a two-level routing-location problem
- A large scale location-allocation problem in the natural rubber industry
- Hamiltonian location problems
- Combined location-routing problems: A synthesis and future research directions
- Integer Programming Formulation of Traveling Salesman Problems
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Dynamic Location-routeing Problems
- Location Models with Routing Considerations for a Single Obnoxious Facility
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
- Algorithm 750: CDT
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A tabu search heuristic for the generalized assignment problem
This page was built for publication: A compact model and tight bounds for a combined location-routing problem
