We consider the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand in order to minimize the total cost generated over the planning horizon. The problem is formulated as a two-stage stochastic programming model, in which the first stage decision deals with the temporal and spatial movement of the MFs and the second stage handles how MFs serve customer demands. An algorithm based on the multicut version of L-shaped method is developed. The computational results show that the algorithm yields high quality upper and lower bounds within reasonable computation time for medium scale problems.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Stochastic mobile facility routing and scheduling problem


    Beteiligte:
    Chao Lei, (Autor:in) / Wei-Hua Lin, (Autor:in) / Lixin Miao, (Autor:in) / Mingyao Qi, (Autor:in)


    Erscheinungsdatum :

    2013-10-01


    Format / Umfang :

    1187174 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    The Mobile Facility Routing Problem

    Halper, R. / Raghavan, S. | British Library Online Contents | 2011


    The Mobile Facility Routing Problem

    Halper, Russell | Online Contents | 2011


    Vehicle Routing and Scheduling Problem with Time Windows and Stochastic Demand

    Chang, M.-S. / Lin, Y.-C. / Hsueh, C.-F. et al. | British Library Conference Proceedings | 2004



    Vehicle Routing and Scheduling Problem with Time Windows and Stochastic Demand

    Chang, Mei-Shiang / Lin, Yi-Chen / Hsueh, Che-Fu | Transportation Research Record | 2004