An Effective VNS for Delivery Districting

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    This paper deals with the Delivery Territory Design Problem (DTDP), in which n points have to be allocated to p territories, such that balancing and path connectivity requirements are satisfied, while minimizing the maximum diameter over the created territories. The model is inspired by tactical planning situations faced by delivery companies. We propose two best improvement local search procedures and a Basic Variable Neighborhood Search algorithm following the LIMA paradigm. The results suggest that our algorithm is able to find high-quality solutions within a relatively low time.

    Original languageBritish English
    Title of host publicationVariable Neighborhood Search - 9th International Conference, ICVNS 2022, Revised Selected Papers
    EditorsAndrei Sleptchenko, Angelo Sifaleras, Pierre Hansen
    PublisherSpringer Science and Business Media Deutschland GmbH
    Pages69-81
    Number of pages13
    ISBN (Print)9783031344992
    DOIs
    StatePublished - 2023
    Event9th International Conference on Variable Neighborhood Search, ICVNS 2023 - Abu Dhabi, United Arab Emirates
    Duration: 25 Oct 202228 Oct 2022

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume13863 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference9th International Conference on Variable Neighborhood Search, ICVNS 2023
    Country/TerritoryUnited Arab Emirates
    CityAbu Dhabi
    Period25/10/2228/10/22

    Keywords

    • Basic VNS
    • Less-is-more approach
    • Territory design

    Fingerprint

    Dive into the research topics of 'An Effective VNS for Delivery Districting'. Together they form a unique fingerprint.

    Cite this