서지주요정보
시간 제약과 하역장 용량제약이 있는 차량경로문제에 대한 휴리스틱 해법 = A heuristic for the vehicle routing problem with time window and dock capacity
서명 / 저자 시간 제약과 하역장 용량제약이 있는 차량경로문제에 대한 휴리스틱 해법 = A heuristic for the vehicle routing problem with time window and dock capacity / 장희정.
저자명 장희정 ; Zang, Hee-Jeong
발행사항 [대전 : 한국과학기술원, 2002].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8013530

소장위치/청구기호

학술문화관(문화관) 보존서고

MIE 02035

SMS전송

도서상태

이용가능

대출가능

반납예정일

초록정보

We consider a vehicle routing problem with time window and dock capacity constraints(VRPTD). In the most traditional models of vehicle routing problems with time window (VRPTW), each customer must be assigned to only one vehicle route. However demand of a customer may exceed the capacity of one vehicle, hence at least two vehicles may need to visit the customer. We assume that each customer has its own dock capacity. Hence, the customer can be served by only a limited number of vehicles simultaneously. Given a depot, customers, their demands, their time windows and dock capacities, VRPTD is to get a set of feasible routes which pass the depot and some customers such that all demands of each customer are satisfied. A route is said to be feasible if the route does not violate the dock capacity constraints and time window constraints at each customer. The objective of the problem is to minimize the total cost of the routes. We propose an mixed integer programming(MIP) formulation of the problem. Since it is NP-hard, a meta-heuristic algorithm is developed. The algorithm consists of two procedures; the route construction procedure and the route scheduling procedure. We tested the algorithm on a number of instances and computational results are reported.

서지기타정보

서지기타정보
청구기호 {MIE 02035
형태사항 iv, 56 p. : 삽도 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Hee-Jeong Zang
지도교수의 한글표기 : 박성수
지도교수의 영문표기 : Sun-Soo Park
학위논문 학위논문(석사) - 한국과학기술원 : 산업공학과,
서지주기 참고문헌 : p. 55-56
주제 시간제약
하역장용량제약
차량경로문제
휴리스틱
Time Window
Dock Capacity
Vehicle Routing Problem
Heuristic
QR CODE qr code