In the current paper we take a different approach to a particular capacitated two-stage fixed-charge transportation problem proposing an efficient hybrid Iterated Local Search (HILS) procedure as a means of solving the above-mentioned problem. Our approach is a heuristic one; it constructs an initial solution while using a local search procedure whose aim is to increase the exploration, namely a perturbation mechanism. For the purpose of diversifying the search, a neighborhood structure is used to hybridize it. The preliminary computational results that we achieved stand as proof to the fact that the solution we propose yields high-quality solutions within reasonable running-times.
CITATION STYLE
Cosma, O., Pop, P., Oliviu, M., & Zelina, I. (2018). A hybrid iterated local search for solving a particular two-stage fixed-charge transportation problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10870 LNAI, pp. 684–693). Springer Verlag. https://doi.org/10.1007/978-3-319-92639-1_57
Mendeley helps you to discover research relevant for your work.