標題: Improved solutions for the traveling purchaser problem
作者: Pearn, WL
Chien, RC
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: network optimization;combinatorics;complexity
公開日期: 1-Nov-1998
摘要: The 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.
URI: http://hdl.handle.net/11536/31784
ISSN: 0305-0548
期刊: COMPUTERS & OPERATIONS RESEARCH
Volume: 25
Issue: 11
起始頁: 879
結束頁: 885
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.