54 0

An Algorithm for the Traveling Salesperson Problem with Time Windows and Lateness Costs

Title
An Algorithm for the Traveling Salesperson Problem with Time Windows and Lateness Costs
Author
김종수
Issue Date
1999-12
Publisher
society of korea Industrial and System Engineering Corporate Juridical Person
Citation
산업경영시스템학회지 Vol. 22 No. 53 p. 13-22
Abstract
This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson 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 far more flexible and realistic. 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 the node. But, in real business practices, 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 propose 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. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.
URI
http://db.koreascholar.com/Article?code=21902https://repository.hanyang.ac.kr/handle/20.500.11754/171427
ISSN
2287-7975; 2005-0461
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