The traveling purchaser problem with stochastic prices: Exact and approximate algorithms
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kang, Seungmo | - |
dc.contributor.author | Ouyang, Yanfeng | - |
dc.date.accessioned | 2021-09-07T14:11:00Z | - |
dc.date.available | 2021-09-07T14:11:00Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2011-03-16 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/112840 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | SALESMAN PROBLEM | - |
dc.subject | KNAPSACK-PROBLEM | - |
dc.subject | SCATTER SEARCH | - |
dc.subject | OPTIMIZATION | - |
dc.subject | ASSIGNMENT | - |
dc.subject | CUSTOMERS | - |
dc.subject | DEADLINES | - |
dc.title | The traveling purchaser problem with stochastic prices: Exact and approximate algorithms | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kang, Seungmo | - |
dc.identifier.doi | 10.1016/j.ejor.2010.09.012 | - |
dc.identifier.scopusid | 2-s2.0-78649630096 | - |
dc.identifier.wosid | 000285861300007 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.209, no.3, pp.265 - 272 | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.volume | 209 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 265 | - |
dc.citation.endPage | 272 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | SALESMAN PROBLEM | - |
dc.subject.keywordPlus | KNAPSACK-PROBLEM | - |
dc.subject.keywordPlus | SCATTER SEARCH | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | ASSIGNMENT | - |
dc.subject.keywordPlus | CUSTOMERS | - |
dc.subject.keywordPlus | DEADLINES | - |
dc.subject.keywordAuthor | Traveling purchaser problem | - |
dc.subject.keywordAuthor | Stochastic price | - |
dc.subject.keywordAuthor | Dynamic programming | - |
dc.subject.keywordAuthor | Approximation | - |
dc.subject.keywordAuthor | Heuristic | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.