scholarly journals Optimisasi Perencanaan Produksi Pupuk Menggunakan Firefly Algorithm

2018 ◽  
Vol 4 (1) ◽  
pp. 1-6 ◽  
Author(s):  
Dinita Rahmalia ◽  
Awawin Mustana Rohmah

In Indonesia, there are many farmers as a livelihood because of fertile soil for agriculture and the demand for food. Production planning is the important part of managing cost spent by the company. In production planning, there are many constraints which have to be satisfied such as the number of productions, the number of workers, and the number of inventory. In previous research, constrained optimizations have been solved by exact method or heuristic method. In this research, production planning optimization will be solved by Firefly Algorithm (FA). FA works as a behavior of Firefly. One of firefly behavior used is less bright firefly will move toward brighter firefly. The simulation results show that FA method can find an approaching optimal solution of production planning like production cost, worker cost, and inventory holding cost satisfying the constraints of the number of productions, workers, and inventory.

2013 ◽  
Vol 791-793 ◽  
pp. 2220-2225
Author(s):  
Jin Qi Wu ◽  
Xiao Lan Huang

We consider supplier diversification with holding cost increasing based on binomial yields. We also show that the optimal solution always with a single supplier in the holding cost increasing binomial yields systems, and give the optimal solution.


2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Annelieke C. Baller ◽  
Said Dabia ◽  
Guy Desaulniers ◽  
Wout E. H. Dullaert

AbstractIn the Inventory Routing Problem, customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize total routing and inventory holding cost over a time horizon. If the customers are located relatively close to each other, one has the opportunity to satisfy the demand of a customer by inventory stored at another nearby customer. In the optimization of the customer replenishments, this option can be included to lower total costs. This is for example the case for ATMs in urban areas where an ATM-user that wants to withdraw money could be redirected to another ATM. To the best of our knowledge, the possibility of redirecting end-users is new to the operations research literature and has not been implemented, but is being considered, in the industry. We formulate the Inventory Routing Problem with Demand Moves in which demand of a customer can (partially) be satisfied by the inventory of a nearby customer at a service cost depending on the quantity and the distance. We propose a branch-price-and-cut solution approach which is evaluated on problem instances from the literature. Cost improvements over the classical IRP of up to 10% are observed with average savings around 3%.


Author(s):  
Jing Hou ◽  
Amy Z. Zeng ◽  
Lindu Zhao

In this chapter we focus on examining the coordination mechanisms for a two-stage supply chain comprising one supplier and one retailer. We consider such a channel relationship that the transaction quantity between the two members is sensitive to the supplier’s inventory level and that the supplier’s unit inventory holding cost has a linear stepwise structure. We devise a coordinated revenue-sharing contract with bargaining so that each party’s respective profit is better than that resulted from the simple sequential optimization mechanism. The key contract parameters, namely the supplier’s inventory level and the retailer’s revenue-sharing fraction, are obtained and analyzed. Numerical illustrations of the contracts are given and shed lights on how the supply chain should coordinate in order to gain better performance.


Author(s):  
Alejandra Gomez-Padilla

In this document it is analyzed the importance of contracts for coordination between two companies in a supply chain. In the studied situation, one company, or supplier, supplies one product to the other company, who is a retailer. The companies are going to coordinate by two types of decisions: economic (concerning prices fixed on a contract), and physical exchange (concerning the inventory to be held). Two types of contracts will be presented: one contract with a simple pricing scheme and two contracts with inventory holding cost shared among the companies of the supply chain. The objective is to show that contracts with inventory holding cost share allow the two companies to efficiently coordinate the chain they form.


2014 ◽  
Vol 933 ◽  
pp. 824-829
Author(s):  
Qiang Gang Zhu ◽  
Lei Liu ◽  
Yun Sheng Wang

To MTO on-line manufacturers, one of the most popular time-based competitive strategies is to widely advertise a uniform delivery time guarantee to all the customers. While providing time guarantee can be an effective marketing approach, it is critical for firms to reduce lead time to keep the promise. Decreasing lot size in batching is one of the most important levers to compress lead time in operation. This research expands existing blanket delivery-time guarantee models by integrating operation approach and marketing approach. The online manufacturers guaranteed delivery time model with order batching is established. Some analytic results are provided, and numerical examples are conducted to provide further insight into the problem. The effects of batch processing setup cost, unit inventory holding cost and unit compression cost of transportation time are analyzed. The results indicate that when batch processing setup cost decrease, unit inventory holding cost or unit compression cost of transportation time increase, the online manufacturer should decrease the lot size and shorten the guaranteed delivery time. The customers time and price sensitivities have adverse influences on the manufacturers delivery time decision.


Author(s):  
YUFU NING ◽  
LIMEI YAN ◽  
HUANBIN SHA

A model is constructed for a type of multi-period inventory problem with deteriorating items, in which demands are assumed to be uncertain variables. The objective is to minimize the expected total cost including the ordering cost, inventory holding cost and deteriorating cost under constraints that demands should be satisfied with some service level in each period. To solve the model, two methods are proposed in different cases. When uncertain variables are linear, a crisp equivalent form of the model is provided. For the general cases, a hybrid algorithm integrating the 99-method and genetic algorithm is designed. Two examples are given to illustrate the effectiveness of the model and solving methods.


Author(s):  
Dinita Rahmalia ◽  
Teguh Herlambang ◽  
Thomy Eko Saputro

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.Keywords: Constrained Optimization, Genetic Algorithm, Linear Programming, Particle Swarm Optimization, Production Planning


Author(s):  
Kanapath Plangsrisakul ◽  
Tuanjai Somboonwiwat ◽  
Chareonchai Khompatraporn

This research studies a make-to-order production planning in a canned pineapple industry. Pineapple is a seasonal perishable fruit. Thus, the cost of fresh pineapple which is the main raw material in canned pineapple is inexpensive during its season. The color of the pineapple also determines the price of the canned pineapple. However, the availability of different colors (called “choice” and “standard”) is dependent. Specifically, if the ratio of the choice color is more, the ratio of the other color is less. There are several costs involve such as fresh pineapple cost, can cost, sugar cost, water cost, labor cost, energy cost, and inventory cost. The problem is formulated as a mathematical model to maximize the total profit over four-months planning horizon. Two supply uncertainty cases are tested which are low and high ratios of the choice color. The results show that the profit depends on available color ratios of the pineapple. The production planning is best if it matches with the availability of the color ratios. In certain months, some fresh pineapple purchased exceed the need of the production because of the dependency of the two colors. The inventory holding cost also influences the production decision—whether to produce the canned pineapple in earlier months or it is better to produce only the canned pineapple when it is needed to serve the customer orders.


Author(s):  
Bo Du ◽  
Hao Hu ◽  
Jie Zhang ◽  
Meng Meng

This paper studies the empty container repositioning (ECR) problem considering the exchange of slots and empty containers among liner shipping companies. It is common for an individual shipping company to seek an optimal solution for ECR and cargo routing to maximize its own benefits. To achieve cooperation among shipping companies, a multi-stage solution strategy is proposed. With the inverse optimization technique, the guide leasing prices of slots and empty containers among shipping companies are derived considering the schedule of vessels and cargo routing. Based on the guide leasing price, a cooperative model is formulated to minimize the total cost, which includes the transportation cost for laden containers, the inventory holding cost, the container leasing cost, and the repositioning cost. All the involved shipping companies are expected to follow the best solution of ECR and cargo routing to achieve a cooperative and stable optimum. A real-world shipping network operated by three liner shipping companies is used as a case study with promising numerical results.


Sign in / Sign up

Export Citation Format

Share Document