Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning

DOI10.1007/978-3-319-95104-1_7MaRDI QIDQ5111126zbMATHOpenAlexFDO

Authors Mohammed El Amrani, Y. Benadada, Bernard Gendron

Publication date 26 May 2020

Published in Bioinspired Heuristics for Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-95104-1_7

zbMATH Keywords

heuristiclocationcolumn generationset partitioning\(p\)-median

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• A new method for solving capacitated location problems based on a set partitioning approach
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Integer Programming and Combinatorial Optimization
• A heuristic method for large-scale multi-facility location problems
• An effective heuristic for large-scale capacitated facility location problems
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
• The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• An exact method for the capacitated location-routing problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• A branch-and-price approach to \(p\)-median location problems
• A branch‐and‐price algorithm for the capacitated p‐median problem
• A column generation approach to capacitated \(p\)-median problems
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A new method for solving capacitated location problems based on a set partitioning approach
• Capacitated dynamic location problems with opening, closure and reopening of facilities
• Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
• Exact solution methods for uncapacitated location problems with convex transportation costs
• Integrated location and two-echelon inventory network design under uncertainty
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The use of state space relaxation for the dynamic facility location problem
• Two exact algorithms for the capacitated \(p\)-median problem

Cited in

(1)

• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning

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