A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem

•We apply the Kernel Search to the Single Source Capacitated Facility Location Problem.•We find the optimal solution for 165 out of 170 instances with a proven optimum.•We outperform the best heuristics for the SSCFLP available in the literature.•We achieve an average gap equal to 0.64% on 100 new v...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 238; číslo 2; s. 438 - 450
Hlavní autori:	Guastaroba, G., Speranza, M.G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 16.10.2014 Elsevier Sequoia S.A
Predmet:	Algorithms Assignment problem Binary Integer Linear Programming Decision analysis Demand Heuristic Heuristic algorithms Integer programming Kernel Search framework Kernels Linear programming Location analysis Mathematical models Operations research Optimization Optimization algorithms Searching Single Source Capacitated Facility Location Problems Studies Binary Integer Linear Programming Single Source Capacitated Facility Location Problems Heuristic algorithms Kernel Search framework
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!

Buďte prvý, kto okomentuje tento záznam!