A heuristic for BILP problems: the single source capacitated facility location problem

DOI10.1016/j.ejor.2014.04.007zbMath1338.90215OpenAlexW2080564020MaRDI QIDQ296777

G. Guastaroba, Maria Grazia Speranza

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.007

zbMATH Keywords

heuristic algorithmsbinary integer linear programmingkernel search frameworksingle source capacitated facility location problems

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, A kernel search heuristic for a fair facility location problem, The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms, Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Adaptive kernel search: a heuristic for solving mixed integer linear programs, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic, A kernel search matheuristic to solve the discrete leader-follower location problem, An effective hybrid approach to the two-stage capacitated facility location problem, The capacitated mobile facility location problem, Solving the facility location and fixed charge solid transportation problem, An efficient heuristic algorithm for the alternative-fuel station location problem, A dual RAMP algorithm for single source capacitated facility location problems, On single-source capacitated facility location with cost and fairness objectives, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

Cites Work

• Unnamed Item
• Kernel search: a new heuristic framework for portfolio selection
• Kernel search: an application to the index tracking problem
• Facility location models for distribution system design
• A cutting plane algorithm for the capacitated facility location problem
• Scatter search for the single source capacitated facility location problem
• Kernel search: a general heuristic for the multi-dimensional knapsack 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.
• Local branching
• A repeated matching heuristic for the single-source capacitated facility location problem
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Efficient solution of large scale, single-source, capacitated plant location problems
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Pioneering Developments in Location Analysis
• Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem