SA-based hybrid heuristic for vehicle routing problem with time deadlines = 마감 시간이 있는 차량 경로 문제의 발견적 해법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 266
  • Download : 0
The vehicle routing problem with time deadlines(VRPTD) is an extension of the classical vehicle routing problem(VRP) with constraints on the latest allowable time(deadline) for servicing each customer. The objective is to minimize the number of vehicles and the distance traveled without exceeding the capacity of the vehicles or violating the customer deadlines. Since it is practically impossible to obtain exact optimal solutions for large-sized problems, we developed a new SA-based hybrid heuristic which is based on a parallel nearest neighbor construction method and an unequal-improvement time policy. To show the validity of the proposed algorithm, we perform a comparative study with two existing heuristics.
Advisors
Hwang, Harkresearcher황학researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1998
Identifier
133979/325007 / 000963273
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1998.2, [ ii, 46 p. ]

Keywords

Heuristic; Vehicle routing problem; Time deadlines; 마감 시간; 발견적 해법; 차량 경로 문제

URI
http://hdl.handle.net/10203/41518
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=133979&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0