Une métaheuristique de résolution de problèmes stochastiques de localisation-transport

Authors: Lasalle, Francis
Advisor: Martel, AlainIchoua, Soumia
Abstract: This thesis studies a Stochastic Location-Transportation Problem (SLTP) characterized by multiple transportation options, multiple demand periods and a stochastic stationary demand. We consider the determination of the number and location of the depots required to satisfy a set of customer’s demands, and the mission of these depots in terms of the subset of customers they must supply. The problem is formulated as a stochastic program with recourse, and a hierarchical heuristic solution approach is proposed. It incorporates a Tabu search procedure, an approximate route length formula, and a modified Clarke and Wright procedure. Three neighbourhood exploration strategies are proposed and compared with extensive experiments based on realistic problems.
Document Type: Mémoire de maîtrise
Issue Date: 2009
Open Access Date: 16 April 2018
Permalink: http://hdl.handle.net/20.500.11794/20814
Grantor: Université Laval
Collection:Thèses et mémoires

Files in this item:
Description SizeFormat 
26159.pdfTexte3.54 MBAdobe PDFThumbnail
All documents in CorpusUL are protected by Copyright Act of Canada.