고객의 납기마감시간이 존재하는 이기종 차량경로문제의 발견적 해법
A Heuristic for Fleet Size and Mix Vehicle Routing Problem with Time Deadline
1
조회
0
다운로드
3
인용
0
참고문헌
초록
Abstract
This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.
참고문헌 (15)
- Bramel, "Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows", 44(3), pp.501~509 (1996)
- Desrochers, "A New Heuristic for the Fleet Size and Mix Vehicle Routing Problem", pp.263~274 (1991)
- Dullaert,W, "New heuristic for the Fleet Size and Mix Vehicle Routing Problem with Time windows", 53(11), pp.1232~1238 (2002)
- Etezadi,T, "Vehicle fleet composition", 34(1), pp.87~91 (1983)
- Gould, "The size and composition of a road transport fleet", pp.81~92 (1969)
- Jacques Renaud, "A Sweep-based algorithm for the Fleet Size and Mix Vehicle Routing Problem", 140(3), pp.618~628 (2002)
- Lau, "Vehicle routing problem with time windows and a limited number of vehicles", 148(3), pp.559~569 (2003)
- Liu, "The Fleet Size and Mix Vehicle Routing Problem with Time Windows", 50(7), pp.721~732 (1999)
- Potvin, "A Parallel Route building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows European Journal of Operational Research 66", pp.331~340 (1993)
- S, "Incorporating Vehicle Routing into the Vehicle Fleet Composition Problem European Journal of Operational Research", pp.313~330 (1993)
- Solomon, "Algorithms for the Vehicle Routing and Scheduling Problems with Time Windows Constraints", pp.254~265 (1987)
- Stefan Irnich, "A Multi-depot Pickup and Delivery Problem with a single hub and Heterogeneous Vehicles", 122(2), pp.310~328 (2000)
- Thangiah, "Algorithms for Vehicle Routing Problems with Time Deadlines", 13(3, pp.4) (1995), 322~355
- Voudouris,C, "Guided Local Search", university of essex (1995)
- Woods, "Truck Fleet size composition for concrete distribution International Journal of Physical Distribution & logistics management", pp.3~14 (1979)