서지주요정보
동일경로 제약을 갖는 집배송 차량 경로 수립 문제의 최적화 해법 = An optimization algorithm for a generalized pickup and delivery problem with time windows
서명 / 저자 동일경로 제약을 갖는 집배송 차량 경로 수립 문제의 최적화 해법 = An optimization algorithm for a generalized pickup and delivery problem with time windows / 강자영.
발행사항 [대전 : 한국과학기술원, 2004].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8015012

소장위치/청구기호

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

MIE 04001

휴대폰 전송

도서상태

이용가능

대출가능

반납예정일

리뷰정보

초록정보

The pickup and delivery problem with time windows (PDPTW) involves the construction of optimal routes which satisfy a set of transportation requests under capacity, time window, pairing, and precedence constraints. A transportation request is characterized by a pickup location and a delivery location. A transportation request must be served by the same vehicle. A vehicle may serve multiple transportation requests as long as other constraints are satisfied. We consider a generalized pickup and delivery problem with time windows (GPDPTW), in which a transportation request consists of a pickup location and many delivery locations. Here, a transportation request must be served by the same vehicle, too. In this paper, we propose a branch and price algorithm for the problem. An enumeration technique with preprocessing and elimination rules is used for the column generation problem. We tested the algorithm on a hundred instances which are randomly generated and the computational results are reported.

서지기타정보

서지기타정보
청구기호 {MIE 04001
형태사항 iii, 58 p. : 삽도 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Ja-Young Kang
지도교수의 한글표기 : 박성수
지도교수의 영문표기 : Sung-Soo Park
학위논문 학위논문(석사) - 한국과학기술원 : 산업공학과,
서지주기 참고문헌 : p. 55-58
주제 차량 경로 수립 문제
동일경로 제약
최적화
PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS
OPTIMIZATION ALGORITHM
QR CODE qr code