Etude de la mod elisation en programmation par contraintes pour résoudre le problème de localisation/routage
Résumé
Location routing problem (LRP) is a problem of logistic that can be seen as the combination of two difficult decision problems : The vehicle routing problem (VRP) and the facility location problem (FLP). LRP is widely studied NP-hard problem whose goal is to optimize a to tal cost combining the cost of open deposits and the cost of selected roads. Each deposit has a single associated vehicle that serves a subset of customers while respecting capacity constraints. All customers must be served. In this paper we propose to model the LPR by Constraint Programming and compare this approach with a Mixed Linear Programming model. This work is a first prospective step on the relevance of using CSP to solve the LRP. Experimental evaluations will be done on benchmarks from the LRP literature.