• 산업공학
• /
• 제24권1호
• /
• pp.51-57
• /
• 2011

The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In the last decade, TPP has received some attention of the researchers in the operational research area. However, all of the past researches for TPP are restricted on a single purchaser (vehicle). It could be the limitation to solve the real world problem. The purpose of this paper is to suggest the capacitated multiple TPP (CMTPP). It could be used in inbound logistics optimization in supply chain management area and many others. Since TPP is known as NP-hard, we also developed the heuristic algorithm to solve the CMTPP.