From the perspective of practical application, a novel task allocation problem for multi-vehicle systems is proposed. The goal is to allocate an optimal route for each vehicle to execute tasks. The planning result is a comprehensive decision considering the influence of time windows, collaborative tasks, and recharging. This problem is represented as a new extension of the classical vehicle routing problem and a multi-objective integer programming mathematical model is established. The objective functions are the total completion time and total penalty costs. A solution strategy hybridizing non-dominated sorting genetic algorithm-II and variable neighborhood search is proposed, and a feasibility recovery strategy and the concept of the immigrant population are introduced. Finally, the simulation results show that the proposed algorithm can solve the problem effectively and is robust to different complexity scenarios. To illustrate concretely the optimization process, an instance is given in the last.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Improved NSGA-II to solve a novel multi-objective task allocation problem with collaborative tasks


    Beteiligte:
    Xu, Weiye (Autor:in) / Pi, Dawei (Autor:in) / Wang, Hongliang (Autor:in) / Xie, Boyuan (Autor:in)


    Erscheinungsdatum :

    01.12.2022


    Format / Umfang :

    18 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Multi-Objective Vehicle Routing Problem Based on NSGA-II

    Mengyue, Yang / Keping, Li | IEEE | 2020



    Multi-objective classification based on NSGA-II

    Zhao, Binping / Xue, Yu / Xu, Bin et al. | British Library Online Contents | 2018



    Improved NSGA-II Multi-objective Genetic Algorithm Based on Hybridization-encouraged Mechanism

    Yijie, S. / Gongzhang, S. | British Library Online Contents | 2008