Problème de Localisation et de Routage
| dc.contributor.author | BELMENAOUAR Manel, | |
| dc.contributor.author | LATRECHE, Ibtihal | |
| dc.date.accessioned | 2024-06-30T13:38:22Z | |
| dc.date.available | 2024-06-30T13:38:22Z | |
| dc.date.issued | 2024-06-12 | |
| dc.description.abstract | The Location Routing Problem and (LRP) is a complex logistical issue that involves selecting optimal locations for distribution centers and planning efficient delivery routes for vehicles to minimize total operational and transportation costs. This problem encompasses challenges related to determining suitable locations for warehouses and planning vehicle routes to meet varying customer demands, while adhering to constraints such as vehicle capacity and delivery time windows. To solve this problem, we utilize the simulated annealing technique (Simulated Annealing), an optimization algorithm that relies on principles of thermodynamics to achieve effective approximate solutions. | |
| dc.identifier.uri | https://repository.univ-msila.dz/handle/123456789/42916 | |
| dc.publisher | UNIVERSITE MOHAMED BOUDIAF - M’SILA, FACULTE : Mathématiques et Informatique, DEPARTEMENT : Informatique | |
| dc.subject | LRP | |
| dc.subject | Combinatorial Optimization | |
| dc.subject | Metaheuristics | |
| dc.subject | Simulated Annealing | |
| dc.title | Problème de Localisation et de Routage | |
| dc.type | Thesis |