Vehicle Routing Problem Application in Tour Planning Multimedia System with Metaheuristic Designed

NCUTIR > College of Electrical Engineering and Computer Science > Department of Computer Science and Information Engineering > 【資訊工程系所】期刊論文 > Item 987654321/6892

Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/6892

Title:	Vehicle Routing Problem Application in Tour Planning Multimedia System with Metaheuristic Designed
Authors:	王圳木
Contributors:	資訊工程系
Date:	2011-03
Issue Date:	2017-12-17 13:56:49 (UTC+8)
Abstract:	This work suggests an adaptive tour planning multimedia system designed to meet the tour routing needs of different tourists. Tour planning is an application of vehicle routing problem. Meanwhile, vehicle routing problem is a 'traveling salesman problem' (TSP) type problem. TSP is an example of a combinatorial optimization problem and is known as NP-hard. As studied by many researchers exact, heuristic (approximation) and meta-heuristic algorithms are usually applied for NP problems. A promising meta-heuristic algorithm is proposed to solve the tour routing problems which involves minimization of total traveling time, total travel expenses or the combined total traveling time and expenses. Moreover, a simple exchange local search heuristic is also applied to increase the exploitation (intensification) competence of the scheme. Restated, finding out the optimal planned tour routes using particle swarm optimization (PSO) and increasing performance by exchange heuristic scheme is suggested. Simulation results indicate the PSO with exchange heuristic designed provides a promising strategy, and is efficient for solving tour routing problems. (27 refs)
Relation:	Int. J of electrical Engineering
Appears in Collections:	[Department of Computer Science and Information Engineering] 【資訊工程系所】期刊論文

Files in This Item:

There are no files associated with this item.

View Licence

Loading...