99 0

지연비용을 고려한 서비스 시간대가 존재하는 외판원 문제에 대한 발견적 해법

Title
지연비용을 고려한 서비스 시간대가 존재하는 외판원 문제에 대한 발견적 해법
Other Titles
A Heuristc Algorithm for the Traveling Salesman Problem with Time Windows and Lateness Costs
Author
김종수
Keywords
TSP; Time windows
Issue Date
2001-03
Publisher
대한산업공학회
Citation
대한산업공학회지, v. 27, no. 1, page. 18-24
Abstract
This paper presents a model and a heuristic algorithm for the Traveling Salesman Problem with Time Windows(TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are more flexible and realistic than the previous ones. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at each node* But, in real business practice, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we develop a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. A two-phased heuristic algorithm is proposed for the model and is extensively tested to verify the accuracy and efficiency of the algorithm.
URI
https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01910965?https://repository.hanyang.ac.kr/handle/20.500.11754/158629
ISSN
1225-0988; 2234-6457
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE