A cut-and-solve based algorithm for the single-source capacitated facility location problem

► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel cutting plane algorithm is proposed to separate 0–1 knapsack polytopes. ► Partial integrality strategy is used to further tighten the lower bound...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 221; číslo 3; s. 521 - 532
Hlavní autori: Yang, Zhen, Chu, Feng, Chen, Haoxun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 16.09.2012
Elsevier
Elsevier Sequoia S.A
Predmet:
Algorithms
Applied sciences
Branch & bound algorithms
Computer Science
Cut-and-solve
Cutting
Cutting stock problem
Cutting-plane method
Exact sciences and technology
Facility location
Flows in networks. Combinatorial problems
Integer programming
Logistics
Lower bounds
Mathematical analysis
Mathematical models
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations Research
Optimization algorithms
Planes
Position (location)
Strategy
Studies
Facility location
Cut-and-solve
Cutting-plane method
Polytope
Branching
Lower bound
Tree(graph)
Mixed integer programming
Combinatorial optimization
Cutting plane method
Location problem
Knapsack problem
Upper bound
Zero one programming
Experimental design
Capacity constraint
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel cutting plane algorithm is proposed to separate 0–1 knapsack polytopes. ► Partial integrality strategy is used to further tighten the lower bound of SSCFLP. ► Numerical experiments demonstrate the effectiveness of the proposed method. In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS’s branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP, whose solution space is relatively small with the values of some variables fixed to zero, is solved to optimality by using a commercial MIP solver and its solution if it exists provides an upper bound to the SSCFLP. Meanwhile, the resolution of the LP of DP provides a lower bound for the SSCFLP. A cutting plane method which combines the lifted cover inequalities and Fenchel cutting planes to separate the 0–1 knapsack polytopes is applied to strengthen the lower bound of SSCFLP and that of DP. These lower bounds are further tightened with a partial integrality strategy. Numerical tests on benchmark instances demonstrate the effectiveness of the proposed cutting plane algorithm and the partial integrality strategy in reducing integrality gap and the effectiveness of the CS approach in searching an optimal solution in a reasonable time. Computational results on large sized instances are also presented.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2012.03.047