Introduction
Objective of the Term Project
Learn several algorithms to solve the travelling salesman problem (TSP).
Solve TSP and analyze the result.
Possibly increase the efficiency of the initial algorithms.
About TSP
The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science.
Given a list
Awareness System through Infrastructure AOA
Measure Relative Position using DSRC
Predict running direction
Cooperation through algorithm
Control System through Network Protocol
The control center put together these informations, and transmit optimal route that is calculated by collected information such as car location, weather and construction status etc, to each transceiver.
(Tabu Search Algorithm) 및 개미군집 최적화(Ants Colony Optimization)를 이용하여 예방정비 비용을 최소화 시키는 정비 주기와 단위시간당 기대비용값을 산출하고 시간적 효율성을 판단함으로써 최적해에 빠르게 수렴하는 메타휴리스틱 알고리즘을 비교하여 다부품 시스템 최적화 결정에 효과적임을 고찰한다.
algorithms for reorganizing the dependencies by reordering and clustering tasks. The matrix is a simple adjacency matrix with tasks labeling the horizontal and vertical axes, and a mark in the ith column and jth row when the ith task depends on the jth. Dependencies of tasks on themselves are not considered, so there are never marks along the diagonal. In some applications, the strength of the de
Ⅰ. 알고리즘의 자료구조
1. 자료 객체(Data object)
유한 또는 무한개의 원소를 가진 집합이다.
2. 자료구조(Data structure)
객체의 집합과 그들의 관계 및 operation(연산)을 정의한다.
3. 자료 객체란
자료 객체란 원소를 말한다. 예를 들면 정수의 자료 객체는 1,2,3,...이다.
자료구조란 원소에 연산