|
결과를 확인합니다.
이 결과들에 대하여 실행시간 및 결과 내용을 비교합니다. Term Project Description
phase 1. modeling problem and Implementation using high level language (c)
phase 2. Manually Implement using MIPS assembly
phase 3. run MIPS assembly code and aseesment result
|
|
|
salesman_problem
- http://www.ens-lyon.fr/DI/wp-content/uploads/2012/01/LagrangianRelax.pdf
- http://www.aistudy.com/problem/traveling_salesman_problem.htm
Books
- Lasdon, Leon S.(2002). Optimization theory for large systems. Mineola, New York: Dover Publications, Inc..pp.
- Bertsekas, Dimitri P. (
|
|
|
|
Traveling Salesman Problem
각 노드를 검색할 때 마다, 그 노드가 유망한지 여부를 결정하기 위해서 한계값을 계산하여 노드의 한계값이 지금까지 찾은 최적의 해답보다 나쁜 경우, 더 이상 그 가지를 뻗어서 검색을 계속할 필요
|
|
|
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#include <windows.h>
#define nOfCity 1000
#define maxTime 280 // 최대 시간
#define divide 200 // 부분으로 나누는 구간의 길이
#define aaa 30
#define TRUE 1
#
|
|
|
Problems,\" Networks, 6, pp. 273~280.
12. Lin and Kernighan, 1973, \"An Effective Heuristic Algorithm for the Traveling Salesman Problem,\" Operations Research, Vol. 21, pp. 498~516
13. Osman, I. H., 1993, \"Metastrtegy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.\
|
|
 |
problems according to this system. The Fifth Chapter arranges my opinions on the introduction of Electronic Voting System and suggests the reasonable methods to operate this system.
This thesis will develop the discussions on the Commercial Law Reform Bill which is still pending in the National Ass
|
|
메뉴펼치기
