ROADEF 2026>
The Capacitated Mobile p-Median Problem with Dynamic Demand
Felipe Albuquerque  1@  , Manoel Campêlo  2@  , Rosa Figueiredo  3@  , Cyrille Genre-Grandpierre  4@  
1 : Laboratoire Informatique dÁvignon
Avignon Université, Centre d'Enseignement et de Recherche en Informatique - CERI
2 : DEMA, Universidade Federal do Ceará
3 : Laboratoire Informatique dÁvignon
Avignon Université, Centre d'Enseignement et de Recherche en Informatique - CERI
4 : ESPACE  -  Site web
CNRS : UMR7300, Université d'Avignon
74 rue Louis pasteur 84000 AVIGNON -  France

This work introduces the Capacitated Mobile p-Median Problem with Dynamic Demand (CMpMP-DD), an extension of the classical Capacitated p-Median Problem that considers mobile facilities serving time varying customer demands while respecting capacity and movement constraints. We present a Mixed Integer Linear Programming formulation that determines initial facility placement, movement trajectories, and customer assignments over a discrete time horizon. Computational experiments based on real world data from the Provence-Alpes-Côte d'Azur (PACA) region illustrate the model's potential for optimizing mobile service delivery in regional planning contexts.


Chargement... Chargement...