Claim Missing Document
Check
Articles

Found 4 Documents
Search
Journal : Jurnal Teknik Industri

MODEL SIMULTAN DAN DECOUPLED UNTUK PENYELESAIAN PROBLEM INTEGRASI PRODUKSI-PERSEDIAAN-DISTRIBUSI-PERSEDIAAN Annisa Kesy Garside
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 10 No. 1 (2008): JUNE 2008
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (421.359 KB) | DOI: 10.9744/jti.10.1.11-25

Abstract

The necessity to cut costs and inventory along supply chain makes a more integrated decision between production and distribution functions becomes very important. The purpose of this research is to develop a simultaneous and decoupled optimization model to solve integrated production-inventory-distribution-inventory problem. The model is formulated as Mixed Integer Programming (MIP) with objective function minimizing total cost which covers fixed and variable production cost, plant and Distribution Center (DC) inventory cost, regular and overtime delivery cost. As the conclusion of the two models used to solve integrated production-inventory-distribution-inventory problem, the total cost of simultan model is smaller than the decoupled one. Abstract in Bahasa Indonesia: Tuntutan untuk mengurangi biaya-biaya dan persediaan sepanjang supply chain, menyebabkan pengambilan keputusan yang lebih terintegrasi diantara fungsi produksi dan distribusi menjadi sangat penting. Penelitian ini bertujuan untuk mengembangkan model simultan dan decoupled untuk menyelesaikan problem integrasi produksi-persediaan-distribusi-persediaan. Model simultan dan decoupled diformulasikan sebagai Mixed Integer Programming (MIP) dengan fungsi tujuan meminimalkan total biaya yang meliputi biaya produksi tetap dan variabel, biaya persediaan di pabrik dan Distribution Center (DC) serta biaya pengiriman secara reguler dan overtime. Dengan menggunakan kedua model untuk menyelesaikan problem integrasi produksi-persediaan-distribusi-persediaan, diperoleh total biaya model simultan lebih kecil dibanding model decoupled. Kata kunci: koordinasi supply chain, integrasi produksi-persediaan-distribusi-persediaan, mixed integer programming, pengiriman langsung, pendekatan decoupled.
Integrasi Produksi - Distribusi pada Supply Chain dengan Pendekatan Hybrid Analitik - Simulasi Annisa Kesy Garside; R. Hadi Wahyuono; Tiananda Widyarini
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 13 No. 1 (2011): JUNE 2011
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (251.969 KB) | DOI: 10.9744/jti.13.1.27-36

Abstract

Integrated production-distribution problem resolution using analytical model lacks of consideration of many uncertainties along supply chain line such as delays, queues, machine breakdown, vehicle malfunction, and environmental factor. By utilizing simulation as complex stochastic system modelling, this research aims to develop hybrid analytical-simulation approach to resolve integrated production-distribution model. Time capacity adjustment is required if production-distribution plan obtained from analytical model requires longer production and delivery time than available. The adjustment is using a procedure developed based on duration obtained from simulation model and is used to obtain adjusted time capacity. The implementation of hybrid method to resolve integrated production-distribution problem on two echelon supply chain with 2 factories and 5 DCs shows a feasible solution was obtained on the third iteration
Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem Annisa Kesy Garside; Satya Sudaningtyas
Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 16 No. 1 (2014): JUNE 2014
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (359.711 KB) | DOI: 10.9744/jti.16.1.53-58

Abstract

Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.
A Modified Camel Algorithm for Optimizing Green Vehicle Routing Problem with Time Windows Dana Marsetiya Utama; Wa Ode Nadhilah Safitri; Annisa Kesy Garside
Jurnal Teknik Industri Vol. 24 No. 1 (2022): June 2022
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.24.1.23-36

Abstract

In recent years, the issue of fuel depletion has become a significant problem in the world. The logistics sector is one of the sectors with an increase in fuel consumption. Therefore, route optimization is one of the attempts to solve the problem of minimization fuel consumption. In addition, this problem generally also has time windows. This study aimed to solve the Green Vehicle Routing Problem with Time Windows (GVRPTW) using the Camel Algorithm (CA). The objective function in this problem was to minimize the total cost of distribution, which involves the cost of fuel consumption and the cost of late delivery. The CA parameter experiment was conducted to determine the effect of the parameter on distribution cost and the computation time. In addition, this study also compared the CA algorithm's performance with the Local search algorithm, Particle Swarm Optimization, and Ant Colony Optimization. Results of this study indicated that the use of Camel population parameters and the total journey step affected the quality of the solution. Furthermore, the research results showed that the proposed algorithm had provided a better total distribution cost than the comparison algorithm.