Full metadata record
DC FieldValueLanguage
dc.contributor.authorPearn, WLen_US
dc.contributor.authorChien, RCen_US
dc.date.accessioned2014-12-08T15:47:25Z-
dc.date.available2014-12-08T15:47:25Z-
dc.date.issued1998-11-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://hdl.handle.net/11536/31784-
dc.description.abstractThe traveling purchaser problem (TPP) is an interesting generalization of the well-known traveling salesman problem (TSP), in which a list of commodity items have to be purchased at some markets selling various commodities with different prices, and the total travel and purchase costs must be minimized. Applications include the purchase of raw materials for the manufacturing factories in which the total cost has to be minimized, and the scheduling of jobs over some machines with different set-up and job processing costs in which the total coats for completing the jobs has to be minimized. The TPP has been shown to be computationally intractable. Therefore, many heuristic solution procedures, including the Search algorithm, the Generalized-Savings algorithm, the Tour-Reduction algorithm, and the Commodity-Adding algorithm have been proposed to solve the TPP approximately. In this paper, we consider some variations of these algorithms to improve the solutions. The proposed variations are compared with the existing solution procedures. The results indicate that the proposed variations significantly improve the existing solutions. (C) 1998 Elsevier Science Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectnetwork optimizationen_US
dc.subjectcombinatoricsen_US
dc.subjectcomplexityen_US
dc.titleImproved solutions for the traveling purchaser problemen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume25en_US
dc.citation.issue11en_US
dc.citation.spage879en_US
dc.citation.epage885en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000075284000001-
dc.citation.woscount23-
Appears in Collections:Articles


Files in This Item:

  1. 000075284000001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.