컨테이너 수송차량의 할당 및 스케쥴링을 위한 모델
An Analytical Approach for Allocation and Schedulin of Container Vehicles
1
조회
0
다운로드
3
인용
0
참고문헌
키워드
초록
국내 운송사에서 운영되는 차량들은 운영 비용에 따라 3 가지 유형으로 대별되며, 운송사 소유의 자차, 외부 소유이면서 자차처럼 운영하는 지입차, 그리고 용차가 이에 속한다. 운송 주문이 발생하면, 운송사에서는 운행 경로을 고려하여 이 3 가지 유형의 차량들에 운송 주문을 할당하게 된다. 본 논문에서는 운송비용을 최소화하며 운송 주문을 3가지 유형 차량에 배정하는 운송사의 문제를 다룬다. 논문에서는 컨테이너 수송 차량의 운행문제를 수리모형화하고, 삽입 휴리스틱을 기반으로 한 새로운 휴리스틱을 해법으로 제시한다. 마지막으로 실제 자료를 사용하여 제시한 해법의 효율성을 검증해본다.
Abstract
The vehicles operated by trucking companies can be classified into three types depending on the ways their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented truck(outsourcing). For a given set of transportation orders, the manager of the trucking company has to allocate the transportation orders to three different types of trucks taking account of the vehicle routing as well as dispatching. In this paper, we present an analytical approach for the manager's problem with the objective of minimizing the operating cost. A mathematical model is formulated incorporating the operating characteristics of each container vehicle type and scheduling. For the model, a heuristic algorithm based on the Insertion Heuristic is developed representing the characteristics of the operating cost. Finally, the algorithm is tested through a numerical example problem with the real world data.
참고문헌 (8)
- "Planning for truck fleet size in the presence of a common carrier option", pp.163~211 (1983)
- "Routing and scheduling of vehicles and crews the state of the art", pp.63~211 (1983)
- "Set partitioning based heuristics for interactive routing", pp.125~11 (1981)
- "The pickup and delivery problem with time windows European Journal of Operational Research", pp.7~22 (1991)
- "A dynamic programming solution to the single vehicle many- to-many immediate request dial-a-ride problem", 14, pp.130~154 (1980), Psaraftis HN
- "An exact algorithm for the single vehicle many-to-many dial- a-ride problem with time windows", 17, pp.351~357 (1983), Psaraftis HN
- "An analysis of several heuristics for the traveling salesman problem SIAM Journal of Computing 6", pp.563~581 (1977)
- "The general pickup and delivery problem", 29, pp.17~29 (1995)