차량경로문제에 관한 보로노이 다이어그램 기반 타부서치 알고리듬A Voronoi Tabu Search Algorithm for the Capacitated Vehicle Routing Problem
- Other Titles
- A Voronoi Tabu Search Algorithm for the Capacitated Vehicle Routing Problem
- Authors
- 권용주; 김준규; 서정연; 이동호; 김덕수
- Issue Date
- Aug-2007
- Publisher
- 대한산업공학회
- Keywords
- Capacitated Vehicle Routing; Tabu Search; Voronoi Diagram1. IntroductionLogistics; generally defined as the provision of goods and services from supply points to demand points; includes supply of raw materials to manufacturers; transfer of products; Capacitated Vehicle Routing; Tabu Search; Voronoi Diagram1. IntroductionLogistics; generally defined as the provision of goods and services from supply points to demand points; includes supply of raw materials to manufacturers; transfer of products
- Citation
- 대한산업공학회지, v.33, no.4, pp.469 - 479
- Indexed
- KCI
- Journal Title
- 대한산업공학회지
- Volume
- 33
- Number
- 4
- Start Page
- 469
- End Page
- 479
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179685
- ISSN
- 1225-0988
- Abstract
- This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the existing search heuristics. In particular, our algorithm incorporates the neighborhood reduction method using the proximity information of the Voronoi diagram corresponding to each problem instance. To show the performance of the Voronoi tabu search algorithm suggested in this paper, computational experiments are done on the benchmark problems and the test results are reported.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 1. Journal Articles
- 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.