A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies

2014 ◽  
Vol 239 (1) ◽  
pp. 146-156 ◽  
Author(s):  
Z.A.M.S. Juman ◽  
M.A. Hoque
Keyword(s):  
Solution Technique ◽  
Heuristic Solution ◽  
Total Cost ◽  
Homogeneous Product

scholarly journals A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem

2020 ◽  
pp. 83-101
Author(s):  
E. M. U. S. B. Ekanayake ◽  
S. P. C. Perera ◽  
W. B. Daundasekara ◽  
Z. A. M. S. Juman
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Transportation Problem ◽  
Numerical Study ◽  
Optimal Solution ◽  
Ant Colony ◽  
Solution Technique ◽  
Ant Colony Optimization Algorithm ◽  
Total Cost ◽  
Number Of Iterations

Transportation of products from sources to destinations with minimal total cost plays a key role in logistics and supply chain management. The transportation problem (TP) is an extraordinary sort of Linear Programming problem where the objective is to minimize the total cost of disseminating resources from several various sources to several destinations. Initial feasible solution (IFS) acts as a foundation of an optimal cost solution technique to any TP. Better is the IFS lesser is the number of iterations to reach the final optimal solution. This paper presents a meta-heuristic algorithm, modified ant colony optimization algorithm (MACOA) to attain an IFS to a Transportation Problem. The proposed algorithm is straightforward, simple to execute, and gives us closeness optimal solutions in a finite number of iterations. The efficiency of this algorithm is likewise been advocated by solving validity and applicability examples An extensive numerical study is carried out to see the potential significance of our modified ant colony optimization algorithm (MACOA). The comparative assessment shows that both the MACOA and the existing JHM are efficient as compared to the studied approaches of this paper in terms of the quality of the solution. However, in practice, when researchers and practitioners deal with large-sized transportation problems, we urge them to use our proposed MACOA due to the time-consuming computation of JHM. Therefore this finding is important in saving time and resources for minimization of transportation costs and optimizing transportation processes which could help significantly to improve the organization’s position in the market.

scholarly journals Definition of Ship Outfitting Scheduling as a Resource Availability Cost Problem and Development of a Heuristic Solution Technique

2016 ◽  
Vol 32 (03) ◽  
pp. 154-165
Author(s):  
Christopher Rose ◽  
Jenny Coenen ◽  
Hans Hopman
Keyword(s):  
Mathematical Model ◽  
Planning Process ◽  
Computational Effort ◽  
Qualitative Description ◽  
Solution Technique ◽  
Test Case ◽  
Heuristic Solution ◽  
Resource Availability Cost ◽  
Definition Of ◽  
The Mathematical Model

The outfitting process of shipyards building complex ship types, such as offshore, passenger, and military vessels, is becoming more critical to efficient ship production as the number of components installed on these vessels continues to increase. Outfitting of such vessels is generally characterized by disorganization and rework due to a lack of coordination between the shipyard and subcontractors as well as insufficiently detailed planning. This paper presents a mathematical model for the outfitting planning process of a shipyard building complex vessels. A qualitative description is included for the constraints and objectives underlying the developed mathematical model for the Ship Outfitting Scheduling Problem (SOSP). A heuristic solution technique is also developed for solving the SOSP, and a test case of six midship sections from a recently constructed pipelaying vessel is presented to show the feasibility of both the mathematical model and heuristic. This test case shows that it is possible to find a high-quality planning for the SOSP with a reasonable computational effort. Furthermore, it was found that the greatest priority should be given to components that have the earliest deadlines or dependents with such deadlines. Components should also be scheduled in such a way to minimize the required movements of outfitting personnel between the different work sites of a shipyard.

Optimizing Diagnostic Test Sequences: The Probability Modifying Plot

1999 ◽  
Vol 38 (01) ◽  
pp. 50-55 ◽  
Author(s):  
P. F. de Vries Robbé ◽  
A. L. M. Verbeek ◽  
J. L. Severens
Keyword(s):  
Urinary Tract Infection ◽  
Urinary Tract ◽  
Tract Infection ◽  
Decision Trees ◽  
Diagnostic Tests ◽  
Test Sequence ◽  
Optimal Sequence ◽  
Specific Test ◽  
Total Cost ◽  
Modelling Techniques

Abstract:The problem of deciding the optimal sequence of diagnostic tests can be structured in decision trees, but unmanageable bushy decision trees result when the sequence of two or more tests is investigated. Most modelling techniques include tests on the basis of gain in certainty. The aim of this study was to explore a model for optimizing the sequence of diagnostic tests based on efficiency criteria. The probability modifying plot shows, when in a specific test sequence further testing is redundant and which costs are involved. In this way different sequences can be compared. The model is illustrated with data on urinary tract infection. The sequence of diagnostic tests was optimized on the basis of efficiency, which was either defined as the test sequence with the least number of tests or the least total cost for testing. Further research on the model is needed to handle current limitations.

A Heuristic Solution Procedure to Minimize \[Tmacr] on a Single Machine

1989 ◽  
Vol 40 (3) ◽  
pp. 293-297 ◽  
Author(s):  
T D Fry ◽  
L Vicens ◽  
K Macleod ◽  
S Fernandez
Keyword(s):  
Single Machine ◽  
Solution Procedure ◽  
Heuristic Solution

Pengukuran Kinerja Supply Chain Menggunakan Supply Chain Operation Reference (Scor®) (Studi Kasus Koperasi Baitul Qiradh Baburrayyan)

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Raysa Aleyzia ◽  
Hasan Yudie Sastra
Keyword(s):  
Supply Chain ◽  
Supply Chain Management ◽  
Six Sigma ◽  
Green Beans ◽  
Chain Management ◽  
Total Cost ◽  
Target Value ◽  
Chain Operation ◽  
Cost To Serve ◽  
Supply Chain Operation

Manajemen supply chain yang tidak maksimal akan mempengaruhi kinerja suatu perusahaan. Di Aceh Tengah terdapat suatu koperasi yaitu Koperasi Baitul Qiradh (KBQ) Baburrayyan yang sudah menerapkan manajemen supply chain. Koperasi ini bergerak di bisnis perdagangan biji kopi (green bean). Penelitian ini bertujuan untuk mengukur kinerja supply chain dari KBQ Baburrayyan. Metode yang digunakan adalah SCOR® dengan praktik perbaikan Convergence of SCOR® with Lean and Six Sigma. Target kinerja yang diperoleh untuk total cost to serve adalah sebesar 94,71% dari nilai target 65,00% dan untuk return on supply chain fixed asset adalah sebesar 1,60 dari nilai target 2,50. Hasil yang diperoleh dari penggunaan praktik tersebut adalah terdapat 8 akar penyebab waste di antaranya kurangnya tenaga pengawas, training/briefing belum maksimal, kurangnya kepedulian tentang pentingnya K3, layout yang kurang efisien, belum adanya unit penyuluhan, alat yang masih sederhana, pekerjaan yang monoton, dan tidak dilarang secara tegas.   Supply chain management that is not optimal will affect the performance of a company. In Central Aceh there is a cooperative namely Koperasi Baitul Qiradh (KBQ) Baburrayyan which has implemented supply chain management. This cooperative is engaged in the business of trading in green beans. This study aims to measure the supply chain performance of KBQ Baburrayyan. The method used is SCOR® with the practice of improving Convergence of SCOR® with Lean and Six Sigma. The performance target for total cost to serve is 94.71% of the target value of 65.00% and the return on supply chain fixed assets is 1.60 of the target value of 2.50. The results obtained from the use of the practice are that there are 8 root causes of waste including lack of supervisors, training / briefing is not maximal, lack of concern about the importance of K3, inefficient layouts, absence of extension units, simple tools, monotonous work, and not strictly prohibited.

COST OF MILK PRODUCTION AND BREAK EVEN ANALYSIS OF MEMBER AND NON MEMBER OF DAIRY COOPERATIVE SOCIETY FOR MILCH ANIMALS (COW & BUFFALO) IN DISTRICT ETAWAH OF U.P.

2014 ◽  
Vol 2 (1) ◽  
pp. 30-37
Author(s):  
Ashish Chandra ◽  
Dr. A. K. Dubey ◽  
Dr. Sachin Kumar Srivastava
Keyword(s):  
Milk Production ◽  
Herd Size ◽  
Total Cost ◽  
Minimum Quantity ◽  
Cooperative Society ◽  
Point Analysis ◽  
Large Herd ◽  
Breakeven Point

This study covered 150 cooperative member milk producers and 150 non-member milk producers which were post- stratified into Landless, Marginal, small, medium and large herd size categories. Breakeven point is a point where no profit no loss status achieved where MR = MC. In this study breakeven point analysis was done to estimate the minimum quantity milk to be produced to cover the total cost on all categories (members and nonmembers) of households of milch animals (Cow and buffalo). And also in this study the researchers have find out the Total cost of milk production per liter for member and non member categories. This study is helpful to find out the total cost of milk production in all categories as well as members and nonmembers of dairy cooperative society are able to find out the breakeven point of the whole business.

Sign in / Sign up

Export Citation Format

Share Document