A compact model and tight bounds for a combined location-routing problem
From MaRDI portal
Publication:1886846
DOI10.1016/S0305-0548(03)00245-4zbMath1061.90016MaRDI QIDQ1886846
Maria Albareda-Sambola, Elena Fernández, Juan A. Díaz
Publication date: 19 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
90B40: Search theory
90B20: Traffic problems in operations research
90B80: Discrete location and assignment
Related Items
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, 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, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, The capacity and distance constrained plant location problem, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, A particle swarm optimization algorithm with path relinking for the location routing problem, A metaheuristic to solve a location-routing problem with nonlinear costs
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
