Please use this identifier to cite or link to this item:
|Title:||Traveling Salesman Problem with Traffic Conditions||Authors:||Patvichaichod, Supat
|Issue Date:||2007||Publisher:||University of the Thai Chamber of Commerce||Source:||Supat Patvichaichod, Poranat Visuwan (2007) Traveling Salesman Problem with Traffic Conditions.||Conference:||Proceedings of the 2nd International Conference on Operations and Supply Chain Management||Abstract:||Traveling salesman problem (TSP) is a well known NPCompleteproblem. The objective of the problem is to findroute of the vehicle to service all the customers at aminimal cost (in term of travel distance, travel cost, etc.).Almost all TSP problems used distance between eachpoint of customer as Euclidean Distance and are notconcerned with other parameters to find minimal cost.This paper presents the new TSP that is called “TravelingSalesman Problem with Traffic conditions (TSPTC)”. Thealgorithm has been designed to employ more parameters,which results it closer to the real world condition. Thepaper also proposes the developed genetic algorithm,called “Hybrid Encoding Genetic Algorithm (HEGA)”.The concept is to combine binary encoding and integerencoding together. The successful results of HEGA ofTSPTC are shown in the paper.||URI:||https://scholar.utcc.ac.th/handle/6626976254/889||Rights:||This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.|
|Appears in Collections:||conference_item|
Show full item record Recommend this item
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.