Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Teknik dan Ilmu Komputer Jurnal Sistem dan Manajemen Industri
Budi Marpaung
Universitas Kristen Krida Wacana
Computer Science & IT Engineering Industrial & Manufacturing Engineering Transportation

Published : 7 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 7 Documents
Search

 1 
Pemilihan Supplier Buah dengan Pendekatan Metode Analytical Hierarchy Proses (AHP) Dan Topsis: Studi Kasus Pada Perusahaan Retail Merry, Lidya; Ginting, Meriastuti; Marpaung, Budi
Teknik dan Ilmu Komputer vol. 03 no. 09 Januari-Maret 2014
Publisher : Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

PERBANDINGAN PENDEKATAN SEPARABLE PROGRAMMING DENGAN THE KUHN-TUCKER CONDITIONS DALAM PEMECAHAN MASALAH NONLINEAR Marpaung, Budi
Teknik dan Ilmu Komputer vol. 1 no. 2 April-Juni 2012
Publisher : Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Separable Programming is the approach used to solve nonlinier problems with the Simplex Method. This method is proven to solve nonlinier problem, which until now has no way like the standard linear programming problems. This paper tries to compare the process and results of  Separable Programming approach to the Kuhn-Tucker Condition. Proved that both give similar result, but in a different way. Separable Programming Approach should be used to solve nonlinear problems who have difficulty when solved by the Kuhn-Tucker  Conditions Approach.  Keywords:  separable programming, the Kuhn-Tucker Conditions, nonlinier programming, grid point, convex, concave, criteria, formulation, optimal
Optimilisasi Jumlah Armada Transjakarta di Koridor-8 Jurusan Harmoni-Lebak Bulus dengan Menggunakan Metode Goal Programming Budiawan, Doddy; Soenandi, Iwan Aang; Marpaung, Budi
Teknik dan Ilmu Komputer Vol. 03 No. 10 April-Juni 2014
Publisher : Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

PEMECAHAN MASALAH OPTIMASI BERSIFAT PROBABILISTIK MENGGUNAKAN CHANGE-CONSTRAINED PROGRAMMING Marpaung, Budi
Teknik dan Ilmu Komputer vol. 2 no. 5 Januari-Maret 2013
Publisher : Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Change-Constrained Programming (CCP) is an optimization model developed to solve probabilistic problems. In real world, particularly  in the industry, constrained coefficients and right-hand side constants cannot be firmly determined. This paper explains how the CCP is used to optimize the company profits by making various products using various machines that have limited capacity and are probabilistic. It was evident that CCP can succesfully provide an optimal solution. Keywords:  Change-Constrained Programming, level of confidence, objective function coefficient,  righ-hand-side, optimal
PERBANDINGAN METODE HUNGARIAN DAN PENDEKATAN PROGRAM DINAMIS DALAM PEMECAHAN ASSIGNMENT PROBLEM Marpaung, Budi
Teknik dan Ilmu Komputer vol. 1 no. 1 Januari-Maret 2012
Publisher : Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

During this assignment problem can be solved only by the Hungarian method. Though highly effective approach to the dynamic program to solve the assignment problem. This paper describes a problem solving assignment for five machines and five jobs. The results showed that both methods give the same solution. Even the difficulty in precisely Hungarian Method can be helped by using a dynamic program approach.  Keywords: assignment problem, Hungarian Method, dynamic programming, foreward recursive equation, backward recursive equation.
PEMECAHAN MASALAH PROGRAM LINIER BERKOEFISIEN INPUT PARAMETRIK MENGGUNAKAN PARAMETRIC LINEAR PROGRAMMING Marpaung, Budi
Teknik dan Ilmu Komputer vol. 1 no. 3 July-September 2012
Publisher : Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Parametric Linear Programming is a development model of sensitivity analysis in which the inputs coefficient changes simultaneously. This model develops problem-solving in which the input coefficients are not definitely known, but it can be estimated within a certain interval according to the expected level of confidence. This paper outlines the benefits of Parametric Linear Programming to analyze the fluctuations impact of the objective function coefficients and constants of the optimal solution. It was proven that the input coefficient change at certain intervals did not alter the optimal solution that has been obtained previously. Keywords:  parametric programming, level of confidence, constraint, resources, pertubation vector, righ-hand-side, optimal, Simplex Method
Optimasi Capacitated Vehicle Routing Problem with Time Windows dengan Menggunakan Ant Colony Optimization Soenandi, Iwan Aang; Joice, Joice; Marpaung, Budi
Jurnal Sistem dan Manajemen Industri Vol. 3 No. 1 (2019)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (562.538 KB) | DOI: 10.30656/jsmi.v3i1.1469

Abstract

In recent years, minimization of logistics and transportation costs has become essential for manufacturing companies to increase profits. One thing is done to reduce logistics and transportation costs by optimizing the route of taking or transporting components from each supplier. Route optimization to minimize total transportation costs is a problem that often finds in Vehicle Routing Problems (VRP). Problem Capacitated Vehicle Routing with Time Windows (CVRPTW) is one variant of VRP that considers the vehicle capacity and the service period of each vehicle. CVRPTW is a Non-Polynomial Hard (NP-Hard) problem that requires an efficient and effective algorithm in solving problems that occur in this automotive company. This study uses the Ant Colony Optimization (ACO) algorithm by testing using several parameters to solve the CVRPTW problem. The test results using the ACO algorithm obtained a faster route compared to the method applied by the company.
Co-Authors Doddy Budiawan Iwan Aang Soenandi Joice, Joice Lidya Merry Meriastuti Ginting