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

논문 상세정보

Combining Vehicle Routing with Forwarding : Extension of the Vehicle Routing Problem by Different Types of Sub-contraction


The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

참고문헌 (13)

  1. Krajewska, M. A. (2008), Potentials for efficiency increase in modern freight forwarding, Gabler Edition Wissenschaft, Wiesbaden, Germany 
  2. Krajewska, M. A. and Kopfer, H. (2009), Transportation planning in freight forwarding companies-Tabu search algorithm fort the integrated operational transportation planning problem, European Journal of Operational Research, to appear. 
  3. Pankratz, G. (2002), Speditionelle Transportdisposition, Deutscher Universit$\"{a}$tsverlag (DUV), Wiesbaden, Germany 
  4. Savelsberg, M. and Sol, M. (1998), Drive : Dynamic routing of independent vehicles, Operations Research, 46, 474-490 
  5. Schönberger, J. and Kopfer, H. (2009), Online decision making and automatic decision model adaptation, Computers and Operations Research, to appear 
  6. Bolduc, M.-C., Renaud, J. and Boctor, F. (2007), A heuristic for the routing and carrier selection problem, European Journal of Operational Research, 183, 926-932 
  7. Stumpf, P. (1998), Tourenplanung im speditionellen G$\"{u}$terfernverkehr, Schriftreihe der Gesellschaft f$\"{u}$r Verkehrsbetriebswirtschaft, N$\"{u}$rnberg, Germany 
  8. Ball, M. O., Golden, B. L., Assad, A. A. and Bodin, L. D. (1983), Planning for truck fleet size in the presence of a common-carrier option, Decision Science, 14(1), 103-120 
  9. Dantzig, G. and Ramser, J. (1959), The truck dispatching problem, Management Science, 6, 80-91 
  10. Kopfer, H. and Krajewska, M. A. (2007), Approaches for modelling and solving the integrated transportation and forwarding problem. In : Corsten, H. and Missbauer, H. (Eds.) : Produktionsund Logistikmanagement, Springer, Berlin Heidelberg New York, 439-458 
  11. Schonberger, J. (2005), Operational freight carrier planning, Springer, Berlin Heidelberg New York 
  12. Chu, C. (2005), A heuristic algorithm fort he truckload and less than truckload problem, European Journal of Operational Research, 165, 657-667 
  13. Kopfer, H. and Schonberger, J. (2009), Logistics : The complexity of operational transport optimization. In : Lucas, P. and Roosen, P. (Eds.) : Emerge Analysis and optimization of structures-concepts and strategies across disciplines, Springer, Berlin Heidelberg New York, to appear 

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

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


원문 PDF 다운로드

  • ScienceON :

원문 URL 링크

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

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

DOI 인용 스타일