Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem

DOI10.1080/03155986.1999.11732381MaRDI QIDQ5888099zbMATH OpenOpenAlexFDO

Authors Juan A. Díaz, Elena Fernández, Maruja Ortega, Hugues Delmaire

Publication date 21 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1999.11732381

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Efficient solution of large scale, single-source, capacitated plant location problems
• Bounds for the single source modular capacitated plant location problem
• Scatter search for the single source capacitated facility location problem
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• A guided reactive GRASP for the capacitated multi-source Weber problem

Cited in

(23)

• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
• Multiobjective solution of the uncapacitated plant location problem
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• A dual RAMP algorithm for single source capacitated facility location problems
• Solving the uncapacitated facility location problem using tabu search
• Metaheuristic applications on discrete facility location problems: a survey
• Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
• A heuristic for BILP problems: the single source capacitated facility location problem
• A hybrid firefly-genetic algorithm for the capacitated facility location problem
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
• Locating Satellite Yards in Forestry Operations
• A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
• A guided reactive GRASP for the capacitated multi-source Weber problem
• General variable neighborhood search for the capacitated single allocation hub maximal covering problem
• Facility location models for distribution system design
• A branch-and-price algorithm for the capacitated facility location problem
• Facility location for market capture when users rank facilities by shorter travel and waiting times
• The capacity and distance constrained plant location problem
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements

This page was built for publication: Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888099)