Scatter search for the single source capacitated facility location problem
From MaRDI portal
Publication:940848
DOI10.1007/s10479-007-0193-1zbMath1153.90481OpenAlexW1982373167MaRDI QIDQ940848
Juan A. Díaz, Iván A. Contreras
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0193-1
Related Items (16)
A heuristic for BILP problems: the single source capacitated facility location problem ⋮ Heuristics for the capacitated modular hub location problem ⋮ A nonmonotone GRASP ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments ⋮ Lower and upper bounds for a two-stage capacitated facility location problem with handling costs ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ Memory and Learning in Metaheuristics ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Unnamed Item
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- Upper and lower bounds for the single source capacitated location problem.
- A repeated matching heuristic for the single-source capacitated facility location problem
- Lagrangean heuristics for location problems
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Scatter search --- wellsprings and challenges
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
This page was built for publication: Scatter search for the single source capacitated facility location problem
