$\require{mediawiki-texvc}$
  • 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"
쳇봇 이모티콘
안녕하세요!
ScienceON 챗봇입니다.
궁금한 것은 저에게 물어봐주세요.

논문 상세정보

전시 최장 획득완료시간 최소화를 위한 복수 순회구매자 문제

The Multiple Traveling Purchaser Problem for Minimizing the Maximal Acquisition Completion Time in Wartime

Abstract

In war time, minimizing the logistics response time for supporting military operations is strongly needed. In this paper, i propose the mathematical formulation for minimizing the maximal acquisition completion time in wartime or during a state of emergency. The main structure of this formulation is based on the traveling purchaser problem (TPP), which is a generalized form of the well-known traveling salesman problem (TSP). In the case of the general TPP, an objective function is to minimize the sum of the traveling cost and the purchase cost. However, in this study, the objective function is to minimize the traveling cost only. That's why it's more important to minimize the traveling cost (time or distance) than the purchase cost in wartime or in a state of emergency. I generate a specific instance and find out the optimal solution of this instance by using ILOG OPL STUDIO (CPLEX version 11.1).

참고문헌 (19)

  1. Angelelli, E., Mansini, R., Vindigni, M., Exploring Greedy Criteria for the Dynamic Traveling Purchaser Problem, Central European Journal of Operations Research(Online Published), 2008. 
  2. Boctor, F. F., Laporte, G., Renaud, J., Heuristics for the Traveling Purchaser Problem, Computers and Operations Research 30, pp. 491-504, 2003. 
  3. Bontoux, B., Feillet, D., Ant Colony Optimization for the Traveling Purchaser Problem, Computers and Operations Research 35, pp. 628-637, 2008. 
  4. Goldbarg, M. C., Bagi, L. B., Goldbarg, E. F. G., Transgenetic Algorithm for the Traveling Purchaser Problem, European Journal of Operational Research 199, pp. 36-45, 2008. 
  5. Golden, B. L., Levy, L., Dahl, R., Two Generations of the Traveling Salesman Problem, Omega 9, pp. 439-445, 1981. 
  6. Jain, R., Rivera, M. C., Moore, J. E., Lake, J. A., Horizontal Gene Transfer Accelerates Genome Innovation and Evolution, Molecular Biology and Evolution 20, pp. 1598-1602, 2003. 
  7. Laporte, G., Riera-Ledesma, J., Salazar-Gonalez, J. J., A Branch and Cut Algorithm for the Undirected Traveling Purchaser Problem, Operations Research 51(6), pp. 142-152, 2003. 
  8. Mansini, R., Tocchella, B., The Traveling Purchaser Problem with Budget Constraint, Computers and Operations Research 36, pp. 2263-2274, 2009. 
  9. Margulis, L., Symbiosis in Cell Evolution, Microbial Communities in the Archean and Proterozoic Eon., W. H. Freeman, 1992. 
  10. Miller C. E., Tucker, A. W., Zemlin R. A., Integer Programming Formulation of Traveling Salesman Problems, Journal of Association for Computing Machinery 7, pp. 32-329, 1960. 
  11. Ong, H. L., Approximate Algorithm for the Traveling Purchaser Problem, Operations Research Letters 1, pp. 201-205, 1982. 
  12. Pearn, W. L., Chien, R. C., Improved Solutions for the Traveling Purchaser Problem, Computers and Operations Research 25, pp. 879-885, 1998. 
  13. Ramesh, T., Traveling Purchaser Problem, OPSEARCH 18, pp. 78-91, 1981. 
  14. Riera-Ledesma, J., Salazar-Gonalez, J. J., A Heuristic Approach for the Traveling Purchaser Problem, European Journal of Operational Research 162, pp.142-152, 2005a. 
  15. Riera-Ledesma, J., Salazar-Gonalez, J. J., The Biobjective Traveling Purchaser Problem, European Journal of Operational Research 160, pp. 599-613, 2005b. 
  16. Riera-Ledesma, J., Salazar-Gonalez, J. J., Solving the Asymmetric Traveling Purchaser Problem, Annals of Operations Research 144, 83-97, 2006. 
  17. Singh, K. N., van Oudheusden, D. L., A Branch and Bound Algorithm for the Traveling Purchaser Problem, European Journal of Operational Research 97, pp. 571-579, 1997. 
  18. Teeninga, A., Volgenant, A., Improved Heuristics for the Traveling Purchaser Problem, Computers and Operations Research 31, pp. 139-150, 2004. 
  19. Voss, S., Dynamic Tabu Search Strategies for the Traveling Purchaser Problem, Annals of Operations Research 63, pp. 253-275, 1996. 

이 논문을 인용한 문헌 (0)

  1. 이 논문을 인용한 문헌 없음

원문보기

원문 PDF 다운로드

  • ScienceON :

원문 URL 링크

원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다. (원문복사서비스 안내 바로 가기)

상세조회 0건 원문조회 0건

DOI 인용 스타일