서지주요정보
우편 운송계획 문제의 타부 탐색 알고리듬 = A tabu search algorithm for the postal transportation planning problem
서명 / 저자 우편 운송계획 문제의 타부 탐색 알고리듬 = A tabu search algorithm for the postal transportation planning problem / 최지영.
저자명 최지영 ; Choi, Ji-Young
발행사항 [대전 : 한국과학기술원, 2001].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8011767

소장위치/청구기호

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

MIE 01026

휴대폰 전송

도서상태

이용가능

대출가능

반납예정일

등록번호

9007573

소장위치/청구기호

서울 학위논문 서가

MIE 01026 c. 2

휴대폰 전송

도서상태

이용가능

대출가능

반납예정일

초록정보

This thesis considers a postal transportation planning problem in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The BA strategy selects the best admissible move from the current neighborhood which yields the greatest improvement or the least non-improvement in the objective function. The FBA strategy selects the first admissible move that provides an improvement in the objective value over the current solution; if all moves in the candidate list are tried without any improvement, then FBA selects the best recorded non-improving move. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions. On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.

서지기타정보

서지기타정보
청구기호 {MIE 01026
형태사항 iv, 45 p. : 삽도 ; 26 cm
언어 한국어
일반주기 부록 : 예제 문제의 입력 데이터
저자명의 영문표기 : Ji-Young Choi
지도교수의 한글표기 : 박성수
지도교수의 영문표기 : Sung-Soo Park
학위논문 학위논문(석사) - 한국과학기술원 : 산업공학과,
서지주기 참고문헌 : p. 41-42
주제 타부 탐색
운송
tabu search
transportation
QR CODE qr code