Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem
Facility location problem is one of the strategic logistical drivers within the supply chain
which is a hard to solve optimization problem. In this study, we focus on the uncapacitated
single-source multi-product production/distribution facility location problem with the
presence of set-up cost. To efficiently tackle this decision problem, two Lagrangian-based
heuristics are proposed one of which incorporates integer cuts to strengthen the formulation.
Local search operators are also embedded within these methods to improve the upper …
which is a hard to solve optimization problem. In this study, we focus on the uncapacitated
single-source multi-product production/distribution facility location problem with the
presence of set-up cost. To efficiently tackle this decision problem, two Lagrangian-based
heuristics are proposed one of which incorporates integer cuts to strengthen the formulation.
Local search operators are also embedded within these methods to improve the upper …
[PDF][PDF] Lagrangian Relaxation Heuristics for the Uncapacitated Single-Source Multi-Product Facility Location Problem
H Manzour, S Salhi - 2013 - core.ac.uk
Facility location problem is one of the strategic logistical drivers within the supply chain
which is a hard to solve optimization problem. In this study, we focus on the uncapacitated
single-source multiproduct production/distribution facility location problem with the presence
of set-up cost. To efficiently tackle this decision problem, two lagrangian-based heuristics
are proposed one of which incorporates integer cuts to strengthen the formulation. Local
search operators are also embedded within these methods to improve the upper bounds as …
which is a hard to solve optimization problem. In this study, we focus on the uncapacitated
single-source multiproduct production/distribution facility location problem with the presence
of set-up cost. To efficiently tackle this decision problem, two lagrangian-based heuristics
are proposed one of which incorporates integer cuts to strengthen the formulation. Local
search operators are also embedded within these methods to improve the upper bounds as …
以上显示的是最相近的搜索结果。 查看全部搜索结果