IDEAS home Printed from https://ideas.repec.org/p/hhs/nhhfms/2019_017.html

Cooperation of customers in traveling salesman problems with profits

Author

Listed:
  • Osicka, Ondrej

    (Dept. of Business and Management Science, Norwegian School of Economics)

  • Guajardo, Mario

    (Dept. of Business and Management Science, Norwegian School of Economics)

  • Jörnsten, Kurt

    (Dept. of Business and Management Science, Norwegian School of Economics)

Abstract

The traveling salesman problem and its variants are among the most studied problems in the literature on transportation and logistics. In one of these variants known as the profitable tour problem [2], a profit-maximizing carrier decides whether to visit a particular customer with respect to the prize the customer offers for being visited and traveling cost associated with the visit, all in the context of other customers. The purpose of this paper is to define the profitable tour game, a cooperative version of the profitable tour problem, and to derive its properties. We are particularly interested in prize allocations that create incentives for the carrier to visit all relevant customers. Applications of the profitable tour game might include for example situations in shipping where a carrier is able to serve demands of several customers with a single vehicle. Whether it comes to delivery or pickup of goods, the customers might need to induce the carrier to visit them by offering sufficient rewards. Subsequently, negotiation with other customers in the same position could lead to better prizes while the carrier's visit would remain guaranteed. This knowledge could also be utilized by the carrier by offering specifically tailored discounts on multiple orders from the same area or by evaluating and pricing of new customers.

Suggested Citation

  • Osicka, Ondrej & Guajardo, Mario & Jörnsten, Kurt, 2019. "Cooperation of customers in traveling salesman problems with profits," Discussion Papers 2019/17, Norwegian School of Economics, Department of Business and Management Science.
    • Handle: RePEc:hhs:nhhfms:2019_017
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/11250/2630082
    File Function: Full text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Other publications TiSEM 0dd4cf3d-25fa-4179-80f6-6, Tilburg University, School of Economics and Management.
    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. D. V. Borrero & M. A. Hinojosa & A. M. Mármol, 2016. "Stable solutions for multiple scenario cost allocation games with partial information," Annals of Operations Research, Springer, vol. 245(1), pages 209-226, October.
    2. repec:wsi:jeapmx:v:20:y:2018:i:04:n:s021919891850007x is not listed on IDEAS
    3. Naber, S.K. & de Ree, D.A. & Spliet, R. & van den Heuvel, W., 2015. "Allocating CO2 emission to customers on a distribution route," Omega, Elsevier, vol. 54(C), pages 191-199.
    4. Estevez-Fernandez, Arantza & Borm, Peter & Hamers, Herbert, 2006. "On the core of multiple longest traveling salesman games," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1816-1827, November.
    5. Guanquan Zhu & Minyi Ye & Xinqi Yu & Junhao Liu & Mingju Wang & Zihang Luo & Haomin Liang & Yubin Zhong, 2025. "Optimizing Route Planning via the Weighted Sum Method and Multi-Criteria Decision-Making," Mathematics, MDPI, vol. 13(11), pages 1-37, May.
    6. Estévez-Fernández, Arantza & Reijnierse, Hans, 2014. "On the core of cost-revenue games: Minimum cost spanning tree games with revenues," European Journal of Operational Research, Elsevier, vol. 237(2), pages 606-616.
    7. Sanchez-Soriano, Joaquin, 2003. "The pairwise egalitarian solution," European Journal of Operational Research, Elsevier, vol. 150(1), pages 220-231, October.
    8. Kimms, A. & Kozeletskyi, I., 2016. "Core-based cost allocation in the cooperative traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 910-916.
    9. Daniel Granot & Jeroen Kuipers & Sunil Chopra, 2002. "Cost Allocation for a Tree Network with Heterogeneous Customers," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 647-661, November.
    10. Duygu Yengin, 2012. "Characterizing the Shapley value in fixed-route traveling salesman problems with appointments," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(2), pages 271-299, May.
    11. Platz, Trine Tornøe, 2017. "On the submodularity of multi-depot traveling salesman games," Discussion Papers on Economics 8/2017, University of Southern Denmark, Department of Economics.
    12. Tijs, S.H. & Brânzei, R., 2004. "Cases in Cooperation and Cutting the Cake," Other publications TiSEM f9573808-10b5-4a9e-a835-2, Tilburg University, School of Economics and Management.
    13. Duygu Yengin, 2009. "Appointment Games in Fixed-Route Traveling Salesman Problems and the Shapley Value," Adelaide Economics Working Papers 2009-28, Adelaide University, School of Economics.
    14. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Other publications TiSEM efae8d09-83e6-4fe4-9623-e, Tilburg University, School of Economics and Management.
    15. Hamers, Herbert, 1997. "On the concavity of delivery games," European Journal of Operational Research, Elsevier, vol. 99(2), pages 445-458, June.
    16. Hamers, H.J.M., 1995. "On the concavity of delivery games," Other publications TiSEM f1a3830b-9132-4769-9a3c-3, Tilburg University, School of Economics and Management.
    17. Mathijs van Zon & Remy Spliet & Wilco van den Heuvel, 2021. "The Joint Network Vehicle Routing Game," Transportation Science, INFORMS, vol. 55(1), pages 179-195, 1-2.
    18. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    19. Florian Kellner, 2022. "Generating greenhouse gas cutting incentives when allocating carbon dioxide emissions to shipments in road freight transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 833-874, September.
    20. Arantza Estévez-Fernández & Peter Borm & Marc Meertens & Hans Reijnierse, 2009. "On the core of routing games with revenues," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 291-304, June.
    21. Youngsub Chun & Nari Park & Duygu Yengin, 2015. "Coincidence of Cooperative Game Theoretic Solutions in the Appointment Problem," Adelaide Economics Working Papers 2015-09, Adelaide University, School of Economics.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C00 - Mathematical and Quantitative Methods - - General - - - General
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:hhs:nhhfms:2019_017. 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: Stein Fossen (email available below). General contact details of provider: https://edirc.repec.org/data/dfnhhno.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.