The traveling purchaser problem with stochastic prices: Exact and approximate algorithms
- Authors
- Kang, Seungmo; Ouyang, Yanfeng
- Issue Date
- 16-3월-2011
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Traveling purchaser problem; Stochastic price; Dynamic programming; Approximation; Heuristic
- Citation
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.209, no.3, pp.265 - 272
- Indexed
- SCIE
SCOPUS
- Journal Title
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Volume
- 209
- Number
- 3
- Start Page
- 265
- End Page
- 272
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/112840
- DOI
- 10.1016/j.ejor.2010.09.012
- ISSN
- 0377-2217
- Abstract
- The paper formulates an extension of the traveling purchaser problem where multiple types of commodities are sold at spatially distributed locations with stochastic prices (each following a known probability distribution). A purchaser's goal is to find the optimal routing and purchasing strategies that minimize the expected total travel and purchasing costs needed to purchase one unit of each commodity. The purchaser reveals the actual commodity price at a seller upon arrival, and then either purchases the commodity at the offered price, or rejects the price and visits a next seller. In this paper, we propose an exact solution algorithm based on dynamic programming, an iterative approximate algorithm that yields bounds for the minimum total expected cost, and a greedy heuristic for fast solutions to large-scale applications. We analyze the characteristics of the problem and test the computational performance of the proposed algorithms. The numerical results show that the approximate and heuristic algorithms yield near-optimum strategies and very good estimates of the minimum total cost. (C) 2010 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Civil, Environmental and Architectural Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.