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.
amounts of Bizi. And add gluten
∎2nd Test (2010. 4. 16)
sample - 0, 5%, 10%, 15%, 20%, 20%(with gluten)
Tried to change the yeast and add gluten.
One more added sample and the bean-curd dregs plentifully put in and compared texture of gluten added and not added.
*Recipe
0
5%
10%
15%
20%
20%(gluten)
Wheat flour
300
285
270
255
240
240
Bi
- The “new world” that Columbus boasted of to the Spanish monarchs in 1500 was neither an expanse of empty space nor a replica of European culture, tools, textiles, and religion, but a combination of Native, European, and African people living in complex relation to one another.
- The Native cultures Columbus found in the New World displayed a huge variety of languages, social customs, and cr