This paper considers the dynamic vehicle routing problem where a fleet of vehicles deals with periodic deliveries of goods or services to spatially dispersed customers over a given time horizon. Individual customers may only be served by predefined (dedicated) suppliers. Each vehicle follows a pre-planned separate route linking points defined by the customer location and service periods when ordered deliveries are carried out. Customer order specifications and their services time windows as well as vehicle travel times are dynamically recognized over time. The objective is to maximize a number of newly introduced or modified requests, being submitted dynamically throughout the assumed time horizon, but not compromising already considered orders. Therefore, the main question is whether a newly reported delivery request or currently modified/corrected one can be accepted or not. The considered problem arises, for example, in systems in which garbage collection or DHL parcel deliveries as well as preventive maintenance requests are scheduled and implemented according to a cyclically repeating sequence. It is formulated as a constraint satisfaction problem implementing the ordered fuzzy number formalism enabling to handle the fuzzy nature of variables through an algebraic approach. Computational results show that the proposed solution outperforms commonly used computer simulation methods.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Dynamic planning of mobile service teams’ mission subject to orders uncertainty constraints



    Erscheinungsdatum :

    2020-12-02


    Anmerkungen:

    Bocewicz , G , Nielsen , P , Jasiulewicz-Kaczmarek , M & Banaszak , Z 2020 , ' Dynamic planning of mobile service teams’ mission subject to orders uncertainty constraints ' , Applied Sciences (Switzerland) , vol. 10 , no. 24 , 8872 , pp. 1-21 . https://doi.org/10.3390/app10248872



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629




    Planning to fail: mission design for modular repairable robot teams

    Stancliff, Stephen B. / Dolan, John B. / Trebi-Ollennu, Ashitey | NTRS | 2005


    Planning to Fail: Mission Design for Modular Repairable Robot Teams

    Stancliff, S. / Dolan, J. / Trebi-Ollennu, A. et al. | British Library Conference Proceedings | 2005



    Orbital rendezvous mission planning with complex constraints

    Yu, Jing / Chen, Xiao-qian / Chen, Li-hu | SAGE Publications | 2016