IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v280y2020i2p656-670.html
   My bibliography  Save this article

Formulation and a two-phase matheuristic for the roaming salesman problem: Application to election logistics

Author

Listed:
  • Shahmanzari, Masoud
  • Aksen, Deniz
  • Salhi, Saïd

Abstract

In this paper we investigate a novel logistical problem. The goal is to determine daily tours for a traveling salesperson who collects rewards from activities in cities during a fixed campaign period. We refer to this problem as the Roaming Salesman Problem (RSP) motivated by real-world applications including election logistics, touristic trip planning and marketing campaigns. RSP can be characterized as a combination of the traditional Periodic TSP and the Prize-Collecting TSP with static arc costs and time-dependent node rewards. Commercial solvers are capable of solving small-size instances of the RSP to near optimality in a reasonable time. To tackle large-size instances we propose a two-phase matheuristic where the first phase deals with city selection while the second phase focuses on route generation. The latter capitalizes on an integer program to construct an optimal route among selected cities on a given day. The proposed matheuristic decomposes the RSP into as many subproblems as the number of campaign days. Computational results show that our approach provides near-optimal solutions in significantly shorter times compared to commercial solvers.

Suggested Citation

  • Shahmanzari, Masoud & Aksen, Deniz & Salhi, Saïd, 2020. "Formulation and a two-phase matheuristic for the roaming salesman problem: Application to election logistics," European Journal of Operational Research, Elsevier, vol. 280(2), pages 656-670.
    • Handle: RePEc:eee:ejores:v:280:y:2020:i:2:p:656-670
    DOI: 10.1016/j.ejor.2019.07.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719305995
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.07.035?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eryarsoy, Enes & Shahmanzari, Masoud & Tanrisever, Fehmi, 2023. "Models for government intervention during a pandemic," European Journal of Operational Research, Elsevier, vol. 304(1), pages 69-83.
    2. Marco Ghirardi & Fabio Salassa, 2022. "A simple and effective algorithm for the maximum happy vertices problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 181-193, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:280:y:2020:i:2:p:656-670. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.