scholarly journals PENERAPAN MODIFIED VOGEL'S APPROXIMATION METHOD (MVAM) UNTUK MEMINIMUMKAN BIAYA TRANSPORTASI (STUDI KASUS: PABRIK TAHU TAUFIK)

2019 ◽  
Vol 16 (2) ◽  
pp. 143
Author(s):  
Marie Afiani ◽  
Susi Setiawani ◽  
Toto Bara Setiawan
Keyword(s):  
Approximation Method ◽  
Applied Research ◽  
Equilibrium Problems ◽  
Optimal Solution ◽  
Product Distribution ◽  
Transportation Costs ◽  
Real Cost ◽  
Minimum Solution ◽  
Cost Calculations ◽  
Better Than

This research aims to determine the tofu product distribution transportation model at Taufik Tofu Factory. This type of research is applied research with a quantitative approach. The method used to solve transportation problems in this study is the Modified Vogel’s Approximation Method (MVAM) and optimized using the Modified Distribution (MODI) method. The results of this study indicate that the application of MVAM at the Taufik Tofu Factory provides a more minimum solution for calculating transportation costs, both in equilibrium and non-equilibrium problems. MVAM provides the same transportation costs as the optimal solution for the simplex method, which is equal to Rp1.164.911,00 for equilibrium problems and Rp2.176.838,00 for unequal problems. These results have been tested for optimism using MODI and better than the real cost calculations issued by the factory.

scholarly journals An Approach for Solving the Fixed Charge Transportation Problems

2021 ◽  
Vol 23 (07) ◽  
pp. 583-590
Author(s):  
Hanan Hussein Farag ◽  
Keyword(s):  
Approximate Solution ◽  
Lower Limit ◽  
Approximation Method ◽  
Transportation Problem ◽  
Optimal Solution ◽  
Fixed Charge ◽  
Transportation Problems ◽  
Numerical Example ◽  
Fixed Charge Transportation Problem ◽  
Better Than

This paper presents modified Vogel’s method that solves the fixed charge transportation problems, the relaxed transportation problem proposed by Balinski in 1961 to find an approximate solution for the fixed charge transportation problem (FCTP). This approximate solution is considered as a lower limit for the optimal solution of FCTP. This paper developed the modified Vogel’s method to find an approximate solution used as a lower limit for the FCTP. This is better than Balinski’s method in 1961. My approach relies on applying Vogel’s approximation method to the relaxed transportation problem. In addition, an illustrative numerical example is used to prove my hypothesis.

scholarly journals Sorting Out Fuzzy Transportation Problems via ECCT and Standard Deviation

2021 ◽  
Vol 12 (2) ◽  
pp. 1-14
Author(s):  
Krishna Prabha Sikkannan ◽  
Vimala Shanmugavel
Keyword(s):  
Standard Deviation ◽  
Approximation Method ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
New Method ◽  
Transportation Problems ◽  
North West ◽  
Numerical Example ◽  
Optimum Solution ◽  
Better Than

A well-organized arithmetical procedure entitled standard deviation is employed to find the optimum solution in this paper. This technique has been divided into two parts. The first methodology deals with constructing the entire contingency cost table, and the second deals with optimum allocation. In this work, the method of magnitude is used for converting fuzzy numbers into crisp numbers as this method is better than the existing methods. This technique gives a better optimal solution than other methods. A numerical example for the new method is explained, and the authors compared their method with existing methods such as north west corner method, least cost method, and Vogel's approximation method.

Design Optimization of a 3D Parameterized Vane Cascade With Non-Axisymmetric Endwall Based on a Modified EGO Algorithm and Data Mining Techniques

2017 ◽  
Author(s):  
Chenxi Li ◽  
Zhendong Guo ◽  
Liming Song ◽  
Jun Li ◽  
Zhenping Feng
Keyword(s):  
Data Mining ◽  
Global Optimization ◽  
Design Space ◽  
Pressure Coefficient ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Efficient Global Optimization ◽  
Data Mining Techniques ◽  
Parallel Axis ◽  
Better Than

The design of turbomachinery cascades is a typical high dimensional and computationally expensive problem, a metamodel-based global optimization and data mining method is proposed to solve it. A modified Efficient Global Optimization (EGO) algorithm named Multi-Point Search based Efficient Global Optimization (MSEGO) is proposed, which is characterized by adding multiple samples at per iteration. By testing on typical mathematical functions, MSEGO outperforms EGO in accuracy and convergence rate. MSEGO is used for the optimization of a turbine vane with non-axisymmetric endwall contouring (NEC), the total pressure coefficient of the optimal vane is increased by 0.499%. Under the same settings, another two optimization processes are conducted by using the EGO and an Adaptive Range Differential Evolution algorithm (ARDE), respectively. The optimal solution of MSEGO is far better than EGO. While achieving similar optimal solutions, the cost of MSEGO is only 3% of ARDE. Further, data mining techniques are used to extract information of design space and analyze the influence of variables on design performance. Through the analysis of variance (ANOVA), the variables of section profile are found to have most significant effects on cascade loss performance. However, the NEC seems not so important through the ANOVA analysis. This is due to the fact the performance difference between different NEC designs is very small in our prescribed space. However, the designs with NEC are always much better than the reference design as shown by parallel axis, i.e., the NEC would significantly influence the cascade performance. Further, it indicates that the ensemble learning by combing results of ANOVA and parallel axis is very useful to gain full knowledge from the design space.

scholarly journals Nonpreemptive Goal Programing Method in Optimization Nurse Scheduling by Considering Education Level

2021 ◽  
Vol 22 (2) ◽  
pp. 85
Author(s):  
Fitriani Utina ◽  
Lailany Yahya ◽  
Nurwan Nurwan
Keyword(s):  
Goal Programming ◽  
Undergraduate Education ◽  
Optimal Solution ◽  
Education Level ◽  
Programming Method ◽  
Nurse Scheduling ◽  
Optimal Service ◽  
Schedule Design ◽  
Good Nurse ◽  
Better Than

Nurse scheduling is one of the problems that often arise in hospital management systems. Head of ICU room and nurse to cooperate in making good nurse scheduling for the creation of optimal service. In this paper, we study a hospital nurse schedule design by considering the level of nurse education and the provision of holidays. Nurses with undergraduate education (S1) Nurses become leaders on every shift and are accompanied by nurses with diploma education (D3). The scheduling model in this study using the nonpreemptive goal programming method and LINGO 11.0 software. The preparation of the schedule of nurses assigned to this method can optimize the need for efficient nurses per shift based on education level. The data in the research was obtained by collecting administrative data at Aloei Saboe Gorontalo hospital. The data used are the published schedule by the head of the ICU room. In making a nurse schedule, there are limitations to consider such ashospital regulation. The results of the study obtained an optimal solution in the form of meeting all the desired obstacles. Computational results shows that nurse scheduling using the nonpreemptive goal programming method and LINGO 11.0 software better than the schedule created manually. Every shift is a maximum of one leader with an undergraduate education (S1) background and accompanied by a nurse with a diploma education (D3) background. Keywords: scheduling, goal programming, nonpreemptive goal programming.

scholarly journals Optimasi OPTIMASI BIAYA TRANSPORTASI PADA UKM DI KOTA BATAM

2021 ◽  
Vol 9 (1) ◽  
pp. 1-19
Author(s):  
Welly Sugianto ◽  
Elva Susanti
Keyword(s):  
Sensitivity Analysis ◽  
Objective Function ◽  
Approximation Method ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Product Distribution ◽  
Mathematical Form ◽  
Total Production ◽  
Calculation Results ◽  
Iteration Methods

This research was conducted at UKM Jovelyn in Batam city. Jovelyn's UKM produces various kinds of cakes and is marketed in markets in Batam City. The UKM opened 4 branches and marketed its products to 7 markets in the city of Batam. Product distribution is still random and not properly regulated. This resulted in a very large transportation cost, up to 1/3 of the total production cost. This shows that product transportation is still not carried out effectively and efficiently. The transportation problem is converted into a mathematical form so that the problem can be solved by the transportation method. The transportation method aims to minimize the objective function which is a function of transportation costs. The transportation method is basically the same as the linear program where at each iteration a selection is made to enter the basic variabel and leave the basic variabel. There are several iteration methods, namely the northwest corner method, minimum cost method, genetic algorithm, Vogel's approximation method, minimum row method, Russell's approximation method and column minimum method. Previous research has shown that the Vogel's approximation method, and Russell's approximation method are more efficient and accurate. This study uses both methods and a sensitivity analysis is performed to optimize the calculation results. The sensitivity analysis aims to determine the extent to which the objective function constants and the constraint function constants can change Keywords: Transportation, Sensitivity, SME  

scholarly journals Online Clique Clustering

Algorithmica ◽  
2019 ◽  
Vol 82 (4) ◽  
pp. 938-965
Author(s):  
Marek Chrobak ◽  
Christoph Dürr ◽  
Aleksander Fabijan ◽  
Bengt J. Nilsson
Keyword(s):  
Objective Function ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Optimal Solution ◽  
Deterministic Algorithm ◽  
Input Graph ◽  
Online Clustering ◽  
Objective Value ◽  
Asymptotic Competitive Ratio ◽  
Better Than

Abstract Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The goal is to maintain a clustering with an objective value close to the optimal solution. For the variant where we want to maximize the number of edges in the clusters, we propose an online algorithm based on the doubling technique. It has an asymptotic competitive ratio at most 15.646 and a strict competitive ratio at most 22.641. We also show that no deterministic algorithm can have an asymptotic competitive ratio better than 6. For the variant where we want to minimize the number of edges between clusters, we show that the deterministic competitive ratio of the problem is $$n-\omega (1)$$n-ω(1), where n is the number of vertices in the graph.

Modified Sub-Population Based Heat Transfer Search Algorithm for Structural Optimization

2017 ◽  
Vol 8 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Ghanshyam Tejani ◽  
Vimal Savsani ◽  
Vivek Patel
Keyword(s):  
Heat Transfer ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Population Based ◽  
Truss Optimization ◽  
Feasible Region ◽  
Frequency Constraints ◽  
Local Optimal Solution ◽  
Better Than

In this study, a modified heat transfer search (MHTS) algorithm is proposed by incorporating sub-population based simultaneous heat transfer modes viz. conduction, convection, and radiation in the basic HTS algorithm. However, the basic HTS algorithm considers only one of the modes of heat transfer for each generation. The multiple natural frequency constraints in truss optimization problems can improve the dynamic behavior of the structure and prevent undesirable vibrations. However, shape and size variables subjected to frequency constraints are difficult to handle due to the complexity of its feasible region, which is non-linear, non-convex, implicit, and often converging to the local optimal solution. The viability and effectiveness of the HTS and MHTS algorithms are investigated by six standard trusses problems. The solutions illustrate that the MHTS algorithm performs better than the HTS algorithm.

scholarly journals The Association between Various Earnings and Cash Flow Measures of Firm Performance and Stock Returns: some Iranian evidence

2013 ◽  
Vol 3 (1) ◽  
pp. 24 ◽  
Author(s):  
Ali Mazloom ◽  
Alireza Azarberahman ◽  
Jalal Azarberahman
Keyword(s):  
Firm Performance ◽  
Stock Returns ◽  
Cash Flow ◽  
Applied Research ◽  
Stock Exchange ◽  
Cash Flows ◽  
Company Performance ◽  
Statistical Population ◽  
Semi Empirical ◽  
Better Than

The main purpose of this research is the study of association between various measures of firm performance based on earnings and cash flows and stock returns. This research is an applied research, and its design is semi-empirical, which is done by the method of post-event (past information). The statistical population of the research includes all companies listed in Tehran Stock Exchange (TSE), and its period is nine consecutive years, from 2003 to 2011. Simple and multiple regressions are applied in order to test the hypotheses. Results of the research represent that earning based measures are more related to stock returns than cash flow based measures. Furthermore, earning based measures depict the company performance better than cash flow measures in some companies with higher accruals. But in companies with lower accruals, the company performance cannot be depicted properly neither by earning based nor cash flow based measures.

The Advisor, a Fuzzy Knowledge-Based System for Rapid Instrumentation and Control Using a Taguchi-Based Quality Function: Part II — Implementation

2005 ◽  
Author(s):  
Riko Tantra ◽  
Glenn Y. Masada
Keyword(s):  
Optimal Solution ◽  
User Preferences ◽  
Brushless Dc Motor ◽  
Quality Function ◽  
Brushless Dc ◽  
Knowledge Based ◽  
Application Requirements ◽  
And Control ◽  
Motor Failure ◽  
Better Than

Part II of this paper describes the implementation of The Advisor in selecting a load motor system for a motor failure design project. Specifically, the Motor Advisor is used to select a load motor, motor driver and motor controller for an accelerated brushless DC motor platform design. The optimal solution from the Motor Advisor is compared with and is shown to be better than equipment previously selected for that application. The ranked solutions show good tradeoffs between application requirements and user preferences as a result of using the new Quality Function described in Part I.

Sign in / Sign up

Export Citation Format

Share Document