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...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 238; no. 2; pp. 438 - 450
Main Authors:	Guastaroba, G., Speranza, M.G.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.10.2014 Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!