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
Optimization) 알고리즘을 수리모형에 적용함으로써 새로운 분야에 확대 적용 가능성을 시험했다.
본 연구를 통해 각 정비 정책의 비교를 통해 선정된 정비정책 하에 비용을 최소로 하는 신뢰도 모형을 구축하며, 신뢰도 모형의 해석적 계산의 난이도를 해결하기 위해 메타휴리스틱 기법인 유전자 알고
optimally allocating its limited resources, both human and non-human, to meet multiple
demands in a way that brings maximum benefit to stakeholders. On the factory floor,
this takes the form of scheduling labour and allocating raw materials to achieve the target
output in the most efficient manner. In the warehouse, this calls for arrangements that
optimise space and time while reducing errors an
iter-
ative stab. Innovation is hard work; Edison
made it a profession that blended art, craft,
Design Thinking
harvard business review june 2008 page 2
science, business savvy, and an astute under-
standing of customers and markets.
Design thinking is a lineal descendant of
that tradition. Put simply, it is a discipline
that uses the designer’s sensibility and
methods to match people’s need
optimize the amount of raw material use and to increase production. JHP did not incorporate an analytics department in its business and maintained outsourcing strategy up until now.
The Problem
The leadership of JHP realized a major change must be made in its manufacturing system. The new product line for the gas turbine engines requires new parts and materials, that the old manufacturing systems