본문 바로가기
HOME> 논문 > 논문 검색상세

논문 상세정보

한국경영과학회지 = Journal of the Korean Operations Research and Management Science Society v.35 no.1, 2010년, pp.111 - 124   피인용횟수: 1
본 등재정보는 저널의 등재정보를 참고하여 보여주는 베타서비스로 정확한 논문의 등재여부는 등재기관에 확인하시기 바랍니다.

예산 제약을 고려한 다용량 복수 순회구매자 문제
Heterogeneous Multiple Traveling Purchaser Problem with Budget Constraint

최명진    (국방대학교 운영분석학과   ); 이상헌    (국방대학교 운영분석학과  );
  • 초록

    In the last decade, traveling purchaser problem (TPP) has received some attention of the researchers in the operational research area. 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 this paper we suggest heterogeneous multiple traveling purchaser problem with budget constraint (HMTPP-B) which looks for several cycles starting at and ending to the depot and visiting a subset at a minimum traveling cost and such that the demand for each product is satisfied and the cost spent for purchasing the products does not exceed a given budget threshold. All the past studies of TPP are restricted on a single purchaser. Therefore we randomly generated some instances. CPLEX is used for getting optimal solutions in these experiments.


  • 주제어

    Multiple Traveling Purchaser Problem .   Budget Constraint .   Supply Chain Management .   Inbound Logistics Optimization.  

  • 참고문헌 (27)

    1. 서상범, 이재민, 국가물류비 산정 및 추이분석, 한국교통연구원, 2007. 
    2. 조한선, 이동민, 전국 교통혼잡비용 산출과 추이분석, 한국교통연구원, 2008. 
    3. Angelelli, E., R. Mansini, and M. Vindigni, "Exploring greedy criteria for the dynamic traveling purchaser problem," Central European Journal of Operations Research(online published), 2008. 
    4. Boctor, F.F., G. Laporte, and J. Renaud, "Heuristics for the traveling purchaser problem," Computers and Operations Research, Vol.30 (2003), pp.491-504. 
    5. Bontoux, B. and D. Feillet, "Ant colony optimization for the traveling purchaser problem," Computers and Operations Research, Vol.35(2008), pp.628-637. 
    6. Burstall, R.M., "A heuristic method for a job sequencing problem," Operational Research Quarterly, Vol.17(1966), pp.291-304. 
    7. Buzacott, J.A. and S.K. Dutta, "Sequencing many jobs on a multipurpose facility," Naval Research Logistics Quarterly, Vol.18(1971), pp.75-82. 
    8. Dantzig, G.B. and J.H. Ramser, "The Truck Dispatching Problem," Management Science, Vol.6(1959), pp.80-91. 
    9. Drucker, P.F., Management's new paradigm, Forbes, October 1998, pp.152-177. 
    10. Goldbarg, M.C., L.B. Bagi, and E.F.G. Goldbarg, "Transgenetic algorithm for the traveling purchaser problem," European Journal of Operations Research, Vol.199(2008), pp.36-45. 
    11. Golden, B.L., L. Levy, R. Dahl, "Two generations of the traveling salesman problem," Omega, Vol.9(1981), pp.439-445. 
    12. Johnson, G.A. and L. Malucci, Shift to supply chain reflects more strategic approach, APICS-The Performance Advantage, October 1999, pp.28-31. 
    13. Lambert, D.M., M.C. Cooper, and J.D. Pagh, "Supply chain management : Implementation issues and research opportunities," The International Journal of Logistics Management, Vol.9(1998), pp.1-19. 
    14. Laporte, G., J. Riera-Ledesma, and J.J. Salazar- Gonzalez, "A branch and cut algorithm for the undirected traveling purchaser problem," Operations Research, Vol.51(2003), pp. 142-152. 
    15. Mansini, R. and B. Tocchella, "The traveling purchaser problem with budget constraint," Computers and Operations Research, Vol.36 (2009), pp.2263-2274. 
    16. Miller C.E., A.W. Tucker, and R.A. Zemlin, "Integer programming formulation of traveling salesman problems," Journal of Association for Computing Machinery, Vol.7(1960), pp.326-329. 
    17. Min, H. and G. Zhou, "Supply chain modeling : past, present and future," Computers and Industrial Engineering, Vol.43(2002), pp. 231-249. 
    18. Ong, H.L., "Approximate algorithm for the traveling purchaser problem," Operations Research Letters, Vol.1(1982), pp.201-205. 
    19. Pearn, W.L. and R.C. Chien, "Improved solutions for the traveling purchaser problem," Computers and Operations Research, Vol.25 (1998), pp.879-885. 
    20. Ramesh, T., "Traveling purchaser problem," OPSEARCH, Vol.18(1981), pp.78-91. 
    21. Riera-Ledesma, J. and J.J. Salazar-Gonalez, "A heuristic approach for the traveling purchaser problem," European Journal of Operations Research, Vol.162(2005a), pp.142-152. 
    22. Riera-Ledesma, J. and J.J. Salazar-Gonalez, "The biobjective traveling purchaser problem," European Journal of Operations Research, Vol.160(2005b), pp.599-613. 
    23. Simchi-Levi, D., P. Kaminsky, and E. Simchi- Levi, Designing and managing the supply chain : concepts, strategy, and case study, McGraw-Hill Higher Eduction, 2003. 
    24. Singh, K.N. and van D.L. Oudheusden, "A branch and bound algorithm for the traveling purchaser problem," European Journal of Operations Research, Vol.97(1997), pp.571-579. 
    25. Teeninga, A. and A. Volgenant, "Improved heuristics for the traveling purchaser problem," Computers and Operations Research, Vol.31(2004), pp.139-150. 
    26. Voss, S., "Dynamic tabu search strategies for the traveling purchaser problem," Annals of Operations Research, Vol.63(1996), pp.253-275. 
    27. Bowersox, D.J. and D.J. Closs, Logistical management : The integrated supply chain process, New York, NY, McGraw-Hill, 1996. 
  • 이 논문을 인용한 문헌 (1)

    1. Choi, Myung-Jin ; Lee, Sang-Heon 2011. "Heuristic Approach for the Capacitated Multiple Traveling Purchaser Problem" 산업공학 = IE Interfaces, 24(1): 51~57     

 저자의 다른 논문

  • 최명진 (7)

    1. 2008 "신경망을 이용한 멀티 에이전트 기반 대공방어 단위 학습모형" 韓國軍事科學技術學會誌 = Journal of the KIMST 11 (5): 49~57    
    2. 2009 "유동인구를 고려한 확률적 최대지역커버문제" 經營 科學 = Korean management science review 26 (1): 197~208    
    3. 2009 "국방연구개발사업 수행위험 측정방안 연구" 韓國軍事科學技術學會誌 = Journal of the KIMST 12 (3): 309~316    
    4. 2010 "용량제약이 없는 복수 순회구매자 문제" 대한산업공학회지 = Journal of Korean institute of industrial engineers 36 (2): 78~86    
    5. 2010 "전시 군수반응시간 최소화를 위한 복수 순회구매자 문제" 韓國軍事科學技術學會誌 = Journal of the KIMST 13 (3): 431~437    
    6. 2010 "다차원선호도분석을 이용한 화력분야 방위산업기반 분석" 韓國軍事科學技術學會誌 = Journal of the KIMST 13 (1): 99~104    
    7. 2011 "용량제약이 있는 복수 순회구매자 문제의 휴리스틱 해법" 산업공학 = IE Interfaces 24 (1): 51~57    
  • 이상헌 (48)

 활용도 분석

  • 상세보기

    amChart 영역
  • 원문보기

    amChart 영역

원문보기

무료다운로드
  • NDSL :
  • 한국경영과학회 : 저널
유료다운로드

유료 다운로드의 경우 해당 사이트의 정책에 따라 신규 회원가입, 로그인, 유료 구매 등이 필요할 수 있습니다. 해당 사이트에서 발생하는 귀하의 모든 정보활동은 NDSL의 서비스 정책과 무관합니다.

원문복사신청을 하시면, 일부 해외 인쇄학술지의 경우 외국학술지지원센터(FRIC)에서
무료 원문복사 서비스를 제공합니다.

NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.

이 논문과 함께 출판된 논문 + 더보기