IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-92944-4_14.html
   My bibliography  Save this book chapter

Effective Algorithms for a Bounded Version of the Uncapacitated TPP

In: Innovations in Distribution Logistics

Author

Listed:
  • Renata Mansini

    (University of Brescia)

  • Barbara Tocchella

    (University of Brescia)

Abstract

Summary Let us consider a set of markets plus a depot and a set of products. Each product is made available at a given price in a subset of markets. The distance between each couple of markets and between each market and the depot is known. The Uncapacitated Traveling Purchaser Problem with Budget constraint (UTPP-B) looks for a simple cycle starting at and ending to the depot which visits a subset of markets at the minimum traveling cost while purchasing all products at a global cost that does not exceed a defined budget threshold. Although the problem arises in several application domains very few contributions exist in the literature for the UTPP-B. We propose and compare two solution algorithms for the problem, an enhanced local search heuristic and a Variable Neighborhood Search (VNS) approach. UTPP benchmark instances with additional budget constraints are used for computational experiments. Heuristic performances are compared to exact solution values provided in [13] while solving with a single-objective hierarchical approach a bi-objective UTPP.

Suggested Citation

  • Renata Mansini & Barbara Tocchella, 2009. "Effective Algorithms for a Bounded Version of the Uncapacitated TPP," Lecture Notes in Economics and Mathematical Systems, in: Jo A.E.E. Nunen & M. Grazia Speranza & Luca Bertazzi (ed.), Innovations in Distribution Logistics, chapter 14, pages 267-281, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-92944-4_14
    DOI: 10.1007/978-3-540-92944-4_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.

    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:spr:lnechp:978-3-540-92944-4_14. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.