Motivated by some practical applications in urban services such as water sparkling, we study a split-delivery capacitated arc-routing problem with time windows (SDCARPTW). It is a variant of arc-routing problem and is defined on an undirected graph where the demands on the arcs are splitable, and time window and capacity constraints must be satisfied. We propose a mathematical formulation for SDCARPTW and derive some nice properties of the split-delivery structure, which can help to well represent a solution of SDCARPTW. The dynamic programming, neighborhood search and perturbation process are combined to develop a tabu search algorithm. Through computational studies on CARPTW benchmark datasets, we validate the effectiveness and efficiency of our proposed algorithm. New datasets for SDCARPTW are further proposed and the impact of the split-delivery option is analyzed.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Split-Delivery Capacitated Arc-Routing Problem With Time Windows


    Beteiligte:
    Lai, Qidong (Autor:in) / Zhang, Zizhen (Autor:in) / Yu, Mingzhu (Autor:in) / Wang, Jiahai (Autor:in)


    Erscheinungsdatum :

    01.03.2022


    Format / Umfang :

    1107382 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

    Belenguer, J.-M. / Benavent, E. / Labadi, N. et al. | British Library Online Contents | 2010


    Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows

    Yuliza, Evi / Puspita, Fitri Maya / Supadi, Siti Suzlin | BASE | 2021

    Freier Zugriff

    A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Pandey, Digesh / Srivastava, Namita | BASE | 2018

    Freier Zugriff

    Optimasi Capacitated Vehicle Routing Problem with Time Windows dengan Menggunakan Ant Colony Optimization

    Soenandi, Iwan Aang / Joice, Joice / Marpaung, Budi | BASE | 2019

    Freier Zugriff