On the Existence of Optimal Paths and Cost Surfaces in Isotropic Continuous Transportation Models

1978 ◽  
Vol 10 (10) ◽  
pp. 1121-1130 ◽  
Author(s):  
T Puu
Keyword(s):  
Minimum Cost ◽  
Transportation Cost ◽  
Optimal Paths ◽  
Cost Surface ◽  
Transportation Models ◽  
Existence Conditions ◽  
Gaussian Theory ◽  
Cost Paths ◽  
The Cost ◽  
Sufficiency Conditions

In continuous transportation models, minimum-cost paths are obtained by variational methods, in analogy with geometrical optics. Previous contributions on this subject have stated the appropriate Euler equations and discussed the possibility of defining a transportation-cost surface on which optimal paths are geodesics. The present paper discusses the sufficiency conditions for optimal paths and the existence conditions for cost surfaces, in terms of Gaussian theory. It is also demonstrated that, when the transportation model is isotropic, the cost surface is conformal to the plane.

scholarly journals Secure and effective random paths selection (SERPS) algorithm for security in MANETs

2018 ◽  
Vol 7 (2.8) ◽  
pp. 134
Author(s):  
P Suma ◽  
Mohammed Ali Hussain
Keyword(s):  
Ad Hoc ◽  
Minimum Cost ◽  
Data Packets ◽  
Routing Strategy ◽  
Dynamic Source ◽  
Fixed Topology ◽  
Minimum Cost Paths ◽  
Hoc Networks ◽  
Cost Paths ◽  
The Cost

Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.

scholarly journals Minimizing the Cost of Transporting Goods Produced in an Integrated Foods Company.

2015 ◽  
Vol 6 ◽  
pp. 106-111
Author(s):  
M M Kembe ◽  
A R Kimbir ◽  
E M Ogbuagu
Keyword(s):  
Optimal Solution ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Distribution Centers ◽  
Net Profit ◽  
Soya Oil ◽  
Average Quantity ◽  
Or Organization ◽  
The Cost ◽  
Transportation Schedule

The transportation cost of goods in any company or organization is a pivotal element in determining the total cost of production and also the net profit that will be made. The main aim of this study is to minimize the cost of transporting goods produced at Grand Cereals Limited, Jos, which is reducing the cost of transportation from the major plant where the goods are produced to the various distribution centers. Data was collected on the average quantity of Brabusco Maize Flour (10 kg), Grand Pure Soya Oil (10 litres), Vita Chicks Pelletized Feeds (25 kg, 9 mm) and Royal Layer Concentrate Feeds (25 kg) produced monthly at the Jos plant, the average quantity demanded by major distributors across the country (Yola, Dutse, Minna, Abuja, Aba, Onitsha, Calabar and Ikeja) and the cost of transporting them. The Vogel's Approximation Method of the TORA Optimization System Software was used in solving the formulated transportation problem, and an optimal solution of N3,427,821.00 was obtained, which reduced the monthly transportation cost by N332,179.00. Furthermore, sensitivity analysis was carried out on the parameters after the optimal solution was obtained, which shows that the optimal solution is strongly sensitive to changes in the problem parameters. It was concluded that this work has reduced the transportation cost of the company and therefore recommended to the management of the company for adoption in planning their transportation schedule at a minimum cost.

A generalized fuzzy cost efficiency model

2020 ◽  
Vol 54 (6) ◽  
pp. 1775-1791
Author(s):  
Nazila Aghayi ◽  
Samira Salehpour
Keyword(s):  
Cost Efficiency ◽  
Minimum Cost ◽  
Extensive Literature ◽  
Data Envelopment ◽  
Fuzzy Environment ◽  
Decision Making Unit ◽  
Production Possibility Set ◽  
Fuzzy Cost ◽  
The Cost ◽  
Generalized Cost

The concept of cost efficiency has become tremendously popular in data envelopment analysis (DEA) as it serves to assess a decision-making unit (DMU) in terms of producing minimum-cost outputs. A large variety of precise and imprecise models have been put forward to measure cost efficiency for the DMUs which have a role in constructing the production possibility set; yet, there’s not an extensive literature on the cost efficiency (CE) measurement for sample DMUs (SDMUs). In an effort to remedy the shortcomings of current models, herein is introduced a generalized cost efficiency model that is capable of operating in a fuzzy environment-involving different types of fuzzy numbers-while preserving the Farrell’s decomposition of cost efficiency. Moreover, to the best of our knowledge, the present paper is the first to measure cost efficiency by using vectors. Ultimately, a useful example is provided to confirm the applicability of the proposed methods.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

Main approaches to estimating the cost of shareholder equity of oil and gas producers

2020 ◽  
Vol 26 (3) ◽  
pp. 685-697
Author(s):  
O.V. Shimko
Keyword(s):  
Oil And Gas ◽  
Oil Prices ◽  
Minimum Cost ◽  
Free Cash Flow ◽  
Annual Reports ◽  
Comparative Approach ◽  
Economic Activities ◽  
Advantages And Disadvantages ◽  
Oil And Gas Producers ◽  
The Cost

Subject. The study analyzes generally accepted approaches to assessing the value of companies on the basis of financial statement data of ExxonMobil, Chevron, ConocoPhillips, Occidental Petroleum, Devon Energy, Anadarko Petroleum, EOG Resources, Apache, Marathon Oil, Imperial Oil, Suncor Energy, Husky Energy, Canadian Natural Resources, Royal Dutch Shell, Gazprom, Rosneft, LUKOIL, and others, for 1999—2018. Objectives. The aim is to determine the specifics of using the methods of cost, DFC, and comparative approaches to assessing the value of share capital of oil and gas companies. Methods. The study employs methods of statistical analysis and generalization of materials of scientific articles and official annual reports on the results of financial and economic activities of the largest public oil and gas corporations. Results. Based on the results of a comprehensive analysis, I identified advantages and disadvantages of standard approaches to assessing the value of oil and gas producers. Conclusions. The paper describes pros and cons of the said approaches. For instance, the cost approach is acceptable for assessing the minimum cost of small companies in the industry. The DFC-based approach complicates the reliability of medium-term forecasts for oil prices due to fluctuations in oil prices inherent in the industry, on which the net profit and free cash flow of companies depend to a large extent. The comparative approach enables to quickly determine the range of possible value of the corporation based on transactions data and current market situation.

A claims problem approach to the cost allocation of a minimum cost spanning tree

2021 ◽  
Author(s):  
José-Manuel Giménez-Gómez ◽  
Josep E. Peris ◽  
Begoña Subiza
Keyword(s):  
Spanning Tree ◽  
Cost Allocation ◽  
Minimum Cost ◽  
Claims Problem ◽  
The Cost

The estimated healthcare cost of diabetic retinopathy in Indonesia and its projection for 2025

2019 ◽  
Vol 104 (4) ◽  
pp. 487-492 ◽  
Author(s):  
Muhammad Bayu Sasongko ◽  
Firman Setya Wardhana ◽  
Gandhi Anandika Febryanto ◽  
Angela Nurini Agni ◽  
Supanji Supanji ◽  
...  
Keyword(s):  
Diabetic Retinopathy ◽  
Laser Treatment ◽  
Healthcare Cost ◽  
Cost Of Illness ◽  
Public Health Intervention ◽  
Transportation Cost ◽  
Population Based ◽  
State Budget ◽  
Illness Model ◽  
The Cost

PurposeTo estimate the total healthcare cost associated with diabetic retinopathy (DR) in type 2 diabetes in Indonesia and its projection for 2025.MethodsA prevalence-based cost-of-illness model was constructed from previous population-based DR study. Projection for 2025 was derived from estimated diabetes population in 2025. Direct treatment costs of DR were estimated from the perspective of healthcare. Patient perspective costs were obtained from thorough interview including only transportation cost and lost of working days related to treatment. We developed four cost-of-illness models according to DR severity level, DR without necessary treatment, needing laser treatment, laser +intravitreal (IVT) injection and laser + IVT +vitrectomy. All costs were estimated in 2017 US$.ResultsThe healthcare costs of DR in Indonesia were estimated to be $2.4 billion in 2017 and $8.9 billion in 2025. The total cost in 2017 consisted of the cost for no DR and mild–moderate non-proliferative DR (NPDR) requiring eye screening ($25.9 million), severe NPDR or proliferative DR (PDR) requiring laser treatment ($0.25 billion), severe NPDR or PDR requiring both laser and IVT injection ($1.75 billion) and advance level of PDR requiring vitrectomy ($0.44 billion).ConclusionsThe estimated healthcare cost of DR in Indonesia in 2017 was considerably high, nearly 2% of the 2017 national state budget, and projected to increase significantly to more than threefold in 2025. The highest cost may incur for DR requiring both laser and IVT injection. Therefore, public health intervention to delay or prevent severe DR may substantially reduce the healthcare cost of DR in Indonesia.

Enterprise Inventory Control Based on Supply Chain Management

2012 ◽  
Vol 472-475 ◽  
pp. 3273-3276
Author(s):  
Qing Ying Zhang ◽  
Ying Chi ◽  
Yu Liu ◽  
Qian Shi
Keyword(s):  
Supply Chain ◽  
Supply Chain Management ◽  
Inventory Control ◽  
Control Strategies ◽  
Minimum Cost ◽  
Chain Management ◽  
Main Target ◽  
The Cost

The main target of supply chain management is to control inventory of each node enterprise effectively with the minimum cost. In this paper, the control strategies and methods of inventory based on supply chain management are put forward, which are significant for saving the cost of supply chain and improving the overall benefits of the whole chain.

Preliminary design of precast, segmental box-girder bridges using optimization

1979 ◽  
Vol 6 (1) ◽  
pp. 120-128
Author(s):  
Craig J. Miller ◽  
Juarez Accioly
Keyword(s):  
Minimum Cost ◽  
Preliminary Design ◽  
Box Girder Bridges ◽  
Cross Sectional ◽  
Box Girder ◽  
Prestressing Steel ◽  
Girder Bridges ◽  
Starting Point ◽  
Final Design ◽  
The Cost

Precast, prestressed segmental box-girder bridges are now accepted as an economical alternative for spans over 150 ft (46 m). Decisions about cross-sectional dimensions made during preliminary design can have a substantial influence on the final cost of the bridge. To help the designer obtain an economical starting point for a final design, a program was written to determine section dimensions and midspan and pier prestressing steel areas to give minimum cost. Since a preliminary design is obtained, the analysis techniques and design criteria have been simplified to reduce computation. The design produced by the program will satisfy AASHTO specification requirements and the recommendations of the PCI Bridge Committee. The optimization algorithm used is the generalized reduced gradient technique. To demonstrate the program capabilities, three example problems are discussed. The results indicate that optimum span-depth ratios are approximately 24 for the cost ratios used. The cost of the optimum design does not seem to be too sensitive to the ratio of concrete cost to prestressing steel cost.

scholarly journals Calculate Accurate 3D Cost Distance Efficiently

2019 ◽  
Vol 1 ◽  
pp. 1-1
Author(s):  
Yaqian Chen ◽  
Jiangfeng She ◽  
Xingong Li
Keyword(s):  
Data Structure ◽  
Distance Function ◽  
Friction Surface ◽  
Hash Table ◽  
Route Planning ◽  
Weighted Interpolation ◽  
Cost Distance ◽  
Distance Weighted ◽  
Cost Paths ◽  
The Cost

<p><strong>Abstract.</strong> Cost distance is one of the fundamental functions in geographic information systems (GIS), which has been used in various applications such as route planning, construction of Thiessen polygons and distance weighted interpolation. Conventional 2D cost distance function, due to its limited movement directions (either 4 or 8 neighbourhood cells) in the raster data model, overestimates the least cost and the problem is especially severe with a homogeneous friction surface. 3D cost distance function removes the limitation that movement must occur on a planar surface. It can therefore take into account tunnels and bridges when calculating least cost paths. In addition, it can also be used in many other application domains which deal with 3D geospatial data such as in atmospheric science, geology, and oceanography. Based on the method in Tomlin (2010), which can completely eliminate the overestimation when traveling on a homogeneous friction surface, this research proposes an algorithm that calculates accurate least cost with both homogeneous and heterogeneous friction in 3D space. When extending the cost distance function from 2D to 3D, the number of voxels in the propagation front increases significantly and efficiency is an imperative issue. This research also improves the computational efficiency by developing a data structure that combines a binary heap and a hash table. Our results show that the proposed algorithm can calculate accurate 3D cost distance in a homogeneous friction space, and the proposed data structure (i.e., heap plus hash table) not only significantly reduces the algorithm’s runtime but also benefits more in 3D than in 2D. In addition, we have applied the method in a 3D drone delivery routing application in a city environment (Figure 1). Additional applications, such as calculating groundwater flow paths of least hydraulic resistance in a heterogeneous 3D hydraulic conductivity field, are currently under development.</p>

Sign in / Sign up

Export Citation Format

Share Document