Algorithms for the Two-Stage Capacitated Facility Location Problem

Abstract

This thesis presents a Simulated Annealing based algorithm to solve Two stage capacitated facility location problem. In this problem, a single type of product must be transported from factories to customers, passing through intermediate warehouses. Initially, our algorithm was designed to ensures the selection of the most appropriate facilities (factories\ warehouses). Then, we shifted our focus towards enhancing client allocations to the best-suited facilities (customer→warehouse\warehouse→factory). Experiments show that our algorithm obtains promising results comparing to the literature.