Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem

    Research output: Chapter in Book/Conference paperConference paper

    2 Citations (Scopus)

    Abstract

    We apply market-based optimisation (MBO) to the dynamic vehicle routing problem (DVRP). The DVRP is a difficult subset of this important class of problems, due to the online optimisation required as jobs appear in the system; while MBO has been shown to work well for this kind of load-sharing task. We describe an adaptation to MBO to encourage exploration and to prevent solutions from stagnating, and we describe a range of experiments showing that the adapted algorithm works well in
    both static and dynamic situations. The resulting tool will be useful in a range of industries.
    Original languageEnglish
    Title of host publicationSymposium Series on Computational Intelligence
    Place of PublicationNew Jersey
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages1561-1568
    Number of pages8
    ISBN (Electronic)9781538627266
    ISBN (Print)9781538627273
    DOIs
    Publication statusPublished - 27 Nov 2017
    Event2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE - Honolulu, United States
    Duration: 27 Nov 20171 Dec 2017

    Conference

    Conference2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE
    CountryUnited States
    CityHonolulu
    Period27/11/171/12/17

    Fingerprint

    Vehicle routing
    Industry
    Experiments

    Cite this

    Bright, C., While, L., French, T., & Reynolds, M. (2017). Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem. In Symposium Series on Computational Intelligence (pp. 1561-1568). New Jersey: IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/SSCI.2017.8280869
    Bright, Callan ; While, Lyndon ; French, Tim ; Reynolds, Mark. / Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem. Symposium Series on Computational Intelligence. New Jersey : IEEE, Institute of Electrical and Electronics Engineers, 2017. pp. 1561-1568
    @inproceedings{559b5d85fe5c425f85d5344aec44ce63,
    title = "Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem",
    abstract = "We apply market-based optimisation (MBO) to the dynamic vehicle routing problem (DVRP). The DVRP is a difficult subset of this important class of problems, due to the online optimisation required as jobs appear in the system; while MBO has been shown to work well for this kind of load-sharing task. We describe an adaptation to MBO to encourage exploration and to prevent solutions from stagnating, and we describe a range of experiments showing that the adapted algorithm works well inboth static and dynamic situations. The resulting tool will be useful in a range of industries.",
    author = "Callan Bright and Lyndon While and Tim French and Mark Reynolds",
    year = "2017",
    month = "11",
    day = "27",
    doi = "10.1109/SSCI.2017.8280869",
    language = "English",
    isbn = "9781538627273",
    pages = "1561--1568",
    booktitle = "Symposium Series on Computational Intelligence",
    publisher = "IEEE, Institute of Electrical and Electronics Engineers",
    address = "United States",

    }

    Bright, C, While, L, French, T & Reynolds, M 2017, Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem. in Symposium Series on Computational Intelligence. IEEE, Institute of Electrical and Electronics Engineers, New Jersey, pp. 1561-1568, 2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE , Honolulu, United States, 27/11/17. https://doi.org/10.1109/SSCI.2017.8280869

    Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem. / Bright, Callan; While, Lyndon; French, Tim; Reynolds, Mark.

    Symposium Series on Computational Intelligence. New Jersey : IEEE, Institute of Electrical and Electronics Engineers, 2017. p. 1561-1568.

    Research output: Chapter in Book/Conference paperConference paper

    TY - GEN

    T1 - Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem

    AU - Bright, Callan

    AU - While, Lyndon

    AU - French, Tim

    AU - Reynolds, Mark

    PY - 2017/11/27

    Y1 - 2017/11/27

    N2 - We apply market-based optimisation (MBO) to the dynamic vehicle routing problem (DVRP). The DVRP is a difficult subset of this important class of problems, due to the online optimisation required as jobs appear in the system; while MBO has been shown to work well for this kind of load-sharing task. We describe an adaptation to MBO to encourage exploration and to prevent solutions from stagnating, and we describe a range of experiments showing that the adapted algorithm works well inboth static and dynamic situations. The resulting tool will be useful in a range of industries.

    AB - We apply market-based optimisation (MBO) to the dynamic vehicle routing problem (DVRP). The DVRP is a difficult subset of this important class of problems, due to the online optimisation required as jobs appear in the system; while MBO has been shown to work well for this kind of load-sharing task. We describe an adaptation to MBO to encourage exploration and to prevent solutions from stagnating, and we describe a range of experiments showing that the adapted algorithm works well inboth static and dynamic situations. The resulting tool will be useful in a range of industries.

    U2 - 10.1109/SSCI.2017.8280869

    DO - 10.1109/SSCI.2017.8280869

    M3 - Conference paper

    SN - 9781538627273

    SP - 1561

    EP - 1568

    BT - Symposium Series on Computational Intelligence

    PB - IEEE, Institute of Electrical and Electronics Engineers

    CY - New Jersey

    ER -

    Bright C, While L, French T, Reynolds M. Using Market-based Optimisation to Solve the Dynamic Vehicle Routing Problem. In Symposium Series on Computational Intelligence. New Jersey: IEEE, Institute of Electrical and Electronics Engineers. 2017. p. 1561-1568 https://doi.org/10.1109/SSCI.2017.8280869