One of the most vital resources for the human being is blood, its collection requires the establishment of a strategy allowing to maximize the collected quantity with a minimum cost. Several constraints should consider the blood and its components as perishable products which affects the storage and transfer activities. Our paper defines the optimal structure of bloodmobiles network over several periods of time. Based on the P-median facility location problem, we suppose that the number of located bloodmobiles is fixed in advance for all periods. Furthermore, located bloodmobiles in a given period are moved to new locations in the next period in order to have new donors (relocation). A non-linear mixed-integer programming mathematical model is proposed to define the best possible locations for bloodmobiles, for each period and analyzes the trade-off between economic costs and total collected quantity. We propose a multi-objective approach based on an Archived Multi-objective Simulated Annealing Approach (AMOSA). We apply this approach to the Tlemcen city bloodmobile network by proposing several locations as potential locations to make it easier for donors and maximize the quantity of collected blood.