Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Paradigma

PENERAPAN BUSINESS SYSTEM PLANNING UNTUK PERENCANAAN PEMBANGUNAN SISTEM INFORMASI AKADEMIK (Studi Kasus : Universitas Siliwangi) Gea Aristi
Paradigma Vol 16, No 1 (2014): Periode Maret
Publisher : LPPM Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (667.336 KB) | DOI: 10.31294/p.v16i1.725

Abstract

Information system in business organization becomes very important related to the time accuracy and information supply correctness that needed by the user. The first step to build information system is making plan. One of methodologies in making information system plan is the arrangement of strategical plan that is done by using Business System Planning (BSP). This methodology is related to the effort how the information system should be structuralized, integrated, and implemented by organization in long period. Siliwangi University is one of university in Tasikmalaya that has a mission to increase the work of Tri Dharma. One of them is academical function. The academical information system today still has some lacks, like inaccurate, incomplete, and ambiguous data. Besides that there is still a difficult thing in accessing and processing data. So it needs to do the observation about the implementation of Business System Planning for the planning of academical information system building that can help Siliwangi University fulfill the needs and run the business strategy. The step which done by this Business System Planning methodology are business goals definition, business process, data classes, information architecture and integration.
PERBANDINGAN ALGORITMA GREEDY , ALGORITMA CHEAPEST INSERTION HEURISTICS DAN DYNAMIC PROGRAMMING DALAM PENYELESAIAN TRAVELLING SALESMAN PROBLEM Gea Aristi
Paradigma Vol 16, No 2 (2014): Periode September
Publisher : LPPM Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (300.593 KB) | DOI: 10.31294/p.v16i2.779

Abstract

Travelling Salesman Problem is one of problems to find shortest route from travelling a salesman from first city and then to destination cities and finally back to first city, but one city just only once visited. There are some algorithms to solving travelling salesman problem,such as Greedy Algorithm, Artificial Bee Colony Algorithm, Cheapest Insertion Heuristics Algorithm, Genetic Algorithm and many more. In this paper, only greedy algorithm, cheapest insertion heuristics algorithm and dynamic programming are discussed. After compared using an example case with 5 cities and solved by third of algorithm, shortest route is same but the way to solving is different. They have advantages and disadvantages of each, and has the characteristics of each. Greedy algorithm is more suitable when used for a number of cities that are not too much because  the process is more simple, but cheapest insertion heuristics algorithm is more suitable to case with more city throught the process more complicated than greedy algorithm. Counting in Dynamic programming must be right because it will be influence for the next counting result.