Perencanaan Jadwal dan Rute Distribusi Rokok Untuk Menekan Total Biaya Transportasi

One of the main issue in improving the customer service is how to deliver the product on time to customers. Therefore, the stakeholders need to apply an appropriate strategy in order to make distribustion process become more efficient and effective. Because it is hard to determine appropriate schedule and route when dealing with a lot agents, PR 567 as a representative distributor of cigarette in Purwodadi attempts to make its distribution process better. This was done by using PVRP (Periodic Vehicle Routing Problem) model with cluster first-second route approach and optimization method for assigning vehicle. The result of this research were frequency, schedule, and route with the most minimum transportation cost. In this research, the distribution area was defined into two cluster. The best delivery frequency for cluster one was once week, while cluster two was three times a week. The transportation cost was Rp725805/week. In the other hand, the saving cost was Rp320189/week or 44%/week from the initial cost

Fertilizer Production Planning Optimization Using Particle Swarm Optimization-Genetic Algorithm

Background: The applications of constrained optimization have been developed in many problems. One of them is production planning. Production planning is the important part for controlling the cost spent by the company. Objective: This research identifies about production planning optimization and algorithm to solve it in approaching. Production planning model is linear programming model with constraints : production, worker, and inventory. Methods: In this paper, we use heurisitic Particle Swarm Optimization-Genetic Algorithm (PSOGA) for solving production planning optimization. PSOGA is the algorithm combining Particle Swarm Optimization (PSO) and mutation operator of Genetic Algorithm (GA) to improve optimal solution resulted by PSO. Three simulations using three different mutation probabilies : 0, 0.01 and 0.7 are applied to PSOGA. Futhermore, some mutation probabilities in PSOGA will be simulated and percent of improvement will be computed. Results: From the simulations, PSOGA can improve optimal solution of PSO and the position of improvement is also determined by mutation probability. The small mutation probability gives smaller chance to the particle to explore and form new solution so that the position of improvement of small mutation probability is in middle of iteration. The large mutation probability gives larger chance to the particle to explore and form new solution so that the position of improvement of large mutation probability is in early of iteration. Conclusion: Overall, the simulations show that PSOGA can improve optimal solution resulted by PSO and therefore it can give optimal cost spent by the company for the planning

Aplikasi Metode Taguchi Untuk Menurunkan Tingkat Kecacatan Pada Produk Paving

Home Industry Putih Jaya is a company engaged in the paving blocks manufacturing which in producing paving certainly wanst to minimize any product defects. Known types of paving product  that often occured is an easily cracked paving. An effort in the first stage to reduce the level of disability in this company is to identify the factors that affect product quality paving using fishbone diagram followed by the Taguchi method which is to determine the most influential factor and improve product quality paving so the defect rate can be  decreased. From the data calculation with the fishbone diagram, there are six factors that influential. Among the six factors, those will be identified factor has  the greatest influence resulting product quality deviates toward standards quality. Conclusion of the results showed that percentage of defect that occurs in the company initially around 4%, while by using the proposed improvement by Taguchi method decreases to 2%.  The decreasing of defect percentage of defect means that the improvement of product quality is successfully. The factors the most influential factors to  the paving is a drying process with the largest value of percent contribution in the amount of 34.5%

Reverse Logistics Modeling Considering Environmental and Manufacturing Costs: A Case Study of Battery Recycling in Indonesia

This article models a reverse logistics network for battery recycling with consideration of environmental and manufacturing costs. The model is developed for a reverse flow multi-echelon supply chain, from end customers to the remanufacturing process. Linear programming is used to formulate mathematical models and LINGO® is applied to solve the problem of determining optimal orders for and sales of recycled batteries, lead alloy and plastics, as well as the optimal level of safety stock (service level) for the recycling centers along the reverse logistics network. The number of battery orders from unused battery collectors, and the sales of lead alloy and plastics to the remanufacturing process considering transportation, environmental cost, disassembly cost and inventory costs, are found optimally in different periods. The study also indicates that there is a correlation between the associated costs and inventory decisions and total profit in recycling centers

A HYBRID GENETIC ALGORITHM IMPLEMENTATION FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

This article is related to approach development in order to determine the most appropriate route for bottled water delivery from warehouse to retail from particular boundaries such as a limit on number of vehicle, vehicle capacity, and time windows to each retail. A mathematical model of VRPTW is adopted to solve the problem. Malang is one of the drinking water production centers in Indonesia, definitely it will be difficult for the company to determine the optimal delivery route with the existing restrictions. In this research hybrid genetic algorithm is use to determine the route shipping companies with the Java programming language. After analyzing the results obtained show that the results of the implementation of hybrid genetic algorithm is better than the company actual route. Moreover, authors also analyze the effect the number of iterations for the computation time, and the influence the number of iterations for the fitness value or violation. This algorithm can be applied for the routing and the result obtained is an optimal solutio