scholarly journals Modeling of Mono-Commodity Multi-Location Linear Programming Techniques for Determining Optimum Transportation Network of a Manufacturing Industry

2021 ◽  
Vol 8 (12) ◽  
pp. 145-158
Author(s):  
ADEDEJI, Kasali Aderinmoye ◽  
ZOSU, Segbenu Joseph ◽  
DUDUYEMI Oladejo Samuel
Keyword(s):  
Linear Programming ◽  
Manufacturing Industry ◽  
Transportation Network ◽  
Transportation Cost ◽  
Optimal Transportation ◽  
Location Model ◽  
Transportation Model ◽  
Programming Techniques ◽  
Two Phases

This research on Modeling and Application of Mono-Commodity Multi-Location Linear Programming Techniques For Determining Optimum Transportation Network was carried out at a Manufacturing Industry in Lagos, which comprises of two plants, three depots and twenty retailers axis. The model was analyzed using Micro Soft Excel Software. The analysis to determine the optimal transportation network was carried out in two phases by considering numbers of truckload transported and each commodity from plants to depots and depots to retailers and their optimals. It was discovered that the existing practices transportation cost for truckloads moving from plant to retailers is N3,544,000,000,000 and when optimized, cost is N1,932,650,000,000 while considering each product the optimized transportation cost is N1,871,065,369,000. This implies that the transportation network generated considering each product will yield 47.2% gain in profit than existing network. Hence, it is recommended that mono-commodity multi-location transportation network be used. Keywords: [EXCEL Software, Mono-Commodity Multi-Location Model, Transportation Cost, Transportation Model, Transportation Network.].

scholarly journals Development and Application of Multi Commodity Multi Location Integrated Model for Manufacturing Industry

2022 ◽  
Vol 10 (5) ◽  
pp. 32-40
Author(s):  
Adedeji Kasali Aderinmoye ◽  
◽  
Segbenu Joseph Zosu ◽  
Duduyemi, Oladejo Samuel ◽  
Oyetunji Elkanah Olaosebikan ◽  
...  
Keyword(s):  
Linear Programming ◽  
Manufacturing Industry ◽  
Transportation Cost ◽  
Integrated Model ◽  
Distribution Model ◽  
Production Distribution ◽  
The Difference

This paper presented the development and application of Linear Programming to the modeling of Multi-Commodity Multi-Location production-distribution model for manufacturing industry. The Manufacturing industry has two plants, three depots and twenty retailer’s axis in Lagos. The products are based on how they are packaged; Product 1(P1), Product 2(P2), Product 3(P3) and Product 4(P4). TORA software is used in analyzing the data obtained from the company. Comparing the optimal Multi-Commodity Multi-Location transportation cost of One trillion, Five Hundred And Thirty Billion And Four Hundred And Ninety Million Naira to existing transportation cost of truckload Three Trillion, Five Hundred And Forty Four Billion Naira, the difference is Two Trillion, Thirteen Billion And Five Hundred And Ten Million Naira which is Four Hundred And Two Billion And Seven Hundred And Two Million Naira annually resulting to 56.82 percent gain in profit.

Linear Programming Techniques for the Construction of Palatable Human Diets

1994 ◽  
Vol 45 (5) ◽  
pp. 489-496 ◽  
Author(s):  
L. R. Fletcher ◽  
P. M. Soden ◽  
A. S. I. Zinober
Keyword(s):  
Linear Programming ◽  
Programming Techniques

An Integer Linear Programming-Based Method for the Extraction of Ontology Alignment

2021 ◽  
Vol 16 (2) ◽  
pp. 25-44
Author(s):  
Naima El Ghandour ◽  
Moussa Benaissa ◽  
Yahia Lebbah
Keyword(s):  
Linear Programming ◽  
Semantic Web ◽  
Integer Linear Programming ◽  
New Method ◽  
Ontology Matching ◽  
Ontology Alignment ◽  
Programming Techniques ◽  
Data Heterogeneity ◽  
Series Of Experiments

The Semantic Web uses ontologies to cope with the data heterogeneity problem. However, ontologies become themselves heterogeneous; this heterogeneity may occur at the syntactic, terminological, conceptual, and semantic levels. To solve this problem, alignments between entities of ontologies must be identified. This process is called ontology matching. In this paper, the authors propose a new method to extract alignment with multiple cardinalities using integer linear programming techniques. The authors conducted a series of experiments and compared them with currently used methods. The obtained results show the efficiency of the proposed method.

scholarly journals Rerepresenting Autonomated Vehicles in a Macroscopic Transportation Model

2019 ◽  
Vol 48 (3) ◽  
pp. 269-275 ◽  
Author(s):  
Árpád Török ◽  
Zsolt Szalay ◽  
Gábor Uti ◽  
Bence Verebélyi
Keyword(s):  
Transportation Network ◽  
Autonomous Vehicle ◽  
System Level ◽  
Automated Vehicles ◽  
Transportation Model ◽  
External Variable ◽  
Constant Growth ◽  
Definition Phase ◽  
Modelling Process ◽  
Relevant Factors

The main goal of this article is to determine a comprehensive and well applicable model architecture, which is adequate to estimate the system level advantages with regard to automated transportation and which is appropriate to determine possible costs and losses with regard to the approach of such transport modes. In the study the Budapest Transportation Model is applied. Taking autonomous vehicle penetration into account as an external variable, in the analysis a constant growth is assumed in the penetration of automated vehicles. This article has taken the most relevant factors of transportation network into account with regard to automated cars. It is also important to mention that the paper presents the most important modelling phases, where automated cars can be taken into account during the macroscopic modelling process. In the first step of the process during the network definition phase it is possible to consider the effect of automated vehicles on the transport system (e.g. separated routes). The next phase where the effect of automated vehicles should be taken into consideration is the mode choice step (e.g. different demand segments). And finally traffic assignment step, where the effect of automated vehicles can be represented. The easiest way for this is the modification of passenger car units through the parameter of assigned traffic per capacity ratio.

Research on Mixed Intelligent Arithmetic of Reuse Reverse Logistics Centers' Location Model

2014 ◽  
Vol 945-949 ◽  
pp. 3246-3251 ◽  
Author(s):  
Lu Feng Dai ◽  
Xi Fu Wang
Keyword(s):  
Genetic Algorithm ◽  
Linear Programming ◽  
Stochastic Simulation ◽  
Reverse Logistics ◽  
Random Variables ◽  
Location Model ◽  
Logistics Center ◽  
Center Location

The paper builds the model of direct reuse reverse logistics center location followed by the uncertainty random variables of the demand of retailers and the recovery of collection points. This model assumes that the enterprises are expanding on the traditional network. For the random variables, they will be solved by using stochastic simulation, genetic algorithm and linear programming, and numericai exampie is presented.

Multivariate product-type lower bounds

2001 ◽  
Vol 38 (02) ◽  
pp. 407-420
Author(s):  
Henry W. Block ◽  
Tuhao Chen
Keyword(s):  
Linear Programming ◽  
Graph Theory ◽  
Lower Bounds ◽  
Product Type ◽  
Probability Inequalities ◽  
Programming Techniques

Univariate probability inequalities have received extensive attention. It has been shown that under certain conditions, product-type bounds are valid and sharper than summation-type bounds. Although results concerning multivariate inequalities have appeared in the literature, product-type bounds in a multivariate setting have not yet been studied. This note explores an approach using graph theory and linear programming techniques to construct product-type lower bounds for the probability of the intersection among unions of k sets of events.

Sign in / Sign up

Export Citation Format

Share Document