IDEAS home Printed from https://ideas.repec.org/p/vnm/wpaper/154.html
   My bibliography  Save this paper

The 2-period balanced traveling salesman problem

Author

Listed:
  • Tatiana Bassetto

    (Department of Applied Mathematics, University of Venice)

  • Francesco Mason

    (Department of Applied Mathematics, University of Venice)

Abstract

In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every tour must be balancedâ, i.e. it must be the same or, alternatively, the difference between the maximum and the minimum number of visited customers must be less than a given threshold. The salesman's objective is to minimize the total distance travelled over the two tours. Although this problem may be viewed as a particular case of the Period Traveling Salesman Problem, in the 2-period Balanced TSP the assumptions allow for emphasizing on routing aspects, more than on the assignment of the customers to the various days of the period. The paper proposes two heuristic algorithms particularly suited for the case of Euclidean distances between the customers. Computational experiences and a comparison between the two algorithms are also given.

Suggested Citation

  • Tatiana Bassetto & Francesco Mason, 2007. "The 2-period balanced traveling salesman problem," Working Papers 154, Department of Applied Mathematics, Università Ca' Foscari Venezia, revised Oct 2007.
  • Handle: RePEc:vnm:wpaper:154
    as

    Download full text from publisher

    File URL: http://virgo.unive.it/wpideas/storage/2007wp154.pdf
    File Function: First version, 2007
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Baptista, Susana & Oliveira, Rui Carvalho & Zuquete, Eduardo, 2002. "A period vehicle routing case study," European Journal of Operational Research, Elsevier, vol. 139(2), pages 220-229, June.
    2. M. Gaudioso & G. Paletta, 1992. "A Heuristic for the Periodic Vehicle Routing Problem," Transportation Science, INFORMS, vol. 26(2), pages 86-92, May.
    3. Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bassetto, Tatiana & Mason, Francesco, 2011. "Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs," European Journal of Operational Research, Elsevier, vol. 208(3), pages 253-262, February.
    2. le Blanc, H.M. & Cruijssen, F. & Fleuren, H.A. & de Koster, M.B.M., 2006. "Factory gate pricing: An analysis of the Dutch retail distribution," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1950-1967, November.
    3. D Ronen & C A Goodhart, 2008. "Tactical store delivery planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1047-1054, August.
    4. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    5. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    6. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    7. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
    8. Castellano, Davide & Gallo, Mosè & Grassi, Andrea & Santillo, Liberatina C., 2019. "The effect of GHG emissions on production, inventory replenishment and routing decisions in a single vendor-multiple buyers supply chain," International Journal of Production Economics, Elsevier, vol. 218(C), pages 30-42.
    9. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    10. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi & Andrea Valletta, 2011. "An Exact Algorithm for the Period Routing Problem," Operations Research, INFORMS, vol. 59(1), pages 228-241, February.
    11. Bektaş, Tolga, 2012. "Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing," European Journal of Operational Research, Elsevier, vol. 216(1), pages 83-93.
    12. Angelelli, Enrico & Grazia Speranza, Maria, 2002. "The periodic vehicle routing problem with intermediate facilities," European Journal of Operational Research, Elsevier, vol. 137(2), pages 233-247, March.
    13. del Castillo, Jose M., 1998. "A heuristic for the traveling salesman problem based on a continuous approximation," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 123-152, April.
    14. Chen, Xi, 2018. "When does store consolidation lead to higher emissions?," International Journal of Production Economics, Elsevier, vol. 202(C), pages 109-122.
    15. Alice Vasconcelos Nobre & Caio Cézar Rodrigues Oliveira & Denilson Ricardo de Lucena Nunes & André Cristiano Silva Melo & Gil Eduardo Guimarães & Rosley Anholon & Vitor William Batista Martins, 2022. "Analysis of Decision Parameters for Route Plans and Their Importance for Sustainability: An Exploratory Study Using the TOPSIS Technique," Logistics, MDPI, vol. 6(2), pages 1-12, May.
    16. Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
    17. Chefi Triki, 2017. "Solving the Periodic Edge Routing Problem in the Municipal Waste Collection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(03), pages 1-13, June.
    18. Chen, Thomas Ying-Jeh & Guikema, Seth David & Daly, Craig Michael, 2019. "Optimal pipe inspection paths considering inspection tool limitations," Reliability Engineering and System Safety, Elsevier, vol. 181(C), pages 156-166.
    19. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    20. Dodin, B. & Elimam, A.A., 2008. "Integration of equipment planning and project scheduling," European Journal of Operational Research, Elsevier, vol. 184(3), pages 962-980, February.

    More about this item

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:vnm:wpaper:154. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Daria Arkhipova (email available below). General contact details of provider: https://edirc.repec.org/data/dmvenit.html .

    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.