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

DOI10.1007/978-3-319-95104-1_7zbMATH Open1439.90048OpenAlexW2887568814MaRDI QIDQ5111126FDOQ5111126

Mohammed El Amrani, Bernard Gendron, Y. Benadada

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

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

zbMATH Keywords

heuristiclocationcolumn generationset partitioning\(p\)-median

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• A column generation approach to capacitated \(p\)-median problems
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• 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
• Two exact algorithms for the capacitated \(p\)-median problem
• A branch-and-price approach to \(p\)-median location problems
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A branch‐and‐price algorithm for the capacitated p‐median problem
• A new method for solving capacitated location problems based on a set partitioning approach
• Integrated location and two-echelon inventory network design under uncertainty
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• The use of state space relaxation for the dynamic facility location problem
• Exact solution methods for uncapacitated location problems with convex transportation costs

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)