Solving the asymmetric traveling purchaser problem

Jorge Riera-Ledesma () and Juan-José Salazar-González

Annals of Operations Research, 2006, vol. 144, issue 1, 83-97

Abstract: The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the Asymmetric Traveling Salesman Problem with several applications in the routing and the scheduling contexts. This problem is defined as follows. Let us consider a set of products and a set of markets. Each market is provided with a limited amount of each product at a known price. The ATPP consists in selecting a subset of markets such that a given demand of each product can be purchased, minimizing the routing cost and the purchasing cost. The aim of this article is to evaluate the effectiveness of a branch-and-cut algorithm based on new valid inequalities. It also proposes a transformation of the ATPP into its symmetric version, so a second exact method is also presented. An extensive computational analysis on several classes of instances from literature evaluates the proposed approaches. A previous work () solves instances with up to 25 markets and 100 products, while the here-presented approaches prove optimality on instances with up to 200 markets and 200 products. Copyright Springer Science+Business Media, LLC 2006

Keywords: Traveling purchaser problem; Traveling salesman problem; Branch-and-cut; Heuristics (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-0014-y (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:144:y:2006:i:1:p:83-97:10.1007/s10479-006-0014-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-0014-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().