Restricted Constraints in the Problem of Maximum Attainable Flow in Minimum Cost in a Network

2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Nazimuddin Ahmed ◽  
Shobha Duttadeka
Keyword(s):  
Minimum Cost ◽  
Optimal Route ◽  
Precedence Relation ◽  
Flow Capacity ◽  
Cost Distance ◽  
Realistic Situation ◽  
Maximum Flows

In this paper we have considered a version of restricted constraints in the problem of maximum attainable flow (capacity) in minimum cost (distance) in a network (Ahmed, Das, & Purusotham, 2012b). By restricted constraints one means that the link(s) (cities or stations or nodes) are completed (or visited) in such a way that a particular link is to be preceded (completed or visited) by another link (precedence relation need not be immediate). Here the aim is to obtained an optimal route of a more realistic situation as to scheduling a restricted constraints to a maximum flows at a minimum cost from a source to a destination. The distance (cost) and arc capacity between any two stations are given.

scholarly journals Profile inference revisited

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-24
Author(s):  
Wenlei He ◽  
Julián Mestre ◽  
Sergey Pupyrev ◽  
Lei Wang ◽  
Hongtao Yu
Keyword(s):  
Optimization Problem ◽  
Theoretical Foundation ◽  
State Of The Art ◽  
Minimum Cost ◽  
Control Flow ◽  
Extended Model ◽  
Extensive Evaluation ◽  
Inference Techniques ◽  
Maximum Flows ◽  
Profile Accuracy

Profile-guided optimization (PGO) is an important component in modern compilers. By allowing the compiler to leverage the program’s dynamic behavior, it can often generate substantially faster binaries. Sampling-based profiling is the state-of-the-art technique for collecting execution profiles in data-center environments. However, the lowered profile accuracy caused by sampling fully optimized binary often hurts the benefits of PGO; thus, an important problem is to overcome the inaccuracy in a profile after it is collected. In this paper we tackle the problem, which is also known as profile inference and profile rectification . We investigate the classical approach for profile inference, based on computing minimum-cost maximum flows in a control-flow graph, and develop an extended model capturing the desired properties of real-world profiles. Next we provide a solid theoretical foundation of the corresponding optimization problem by studying its algorithmic aspects. We then describe a new efficient algorithm for the problem along with its implementation in an open-source compiler. An extensive evaluation of the algorithm and existing profile inference techniques on a variety of applications, including Facebook production workloads and SPEC CPU benchmarks, indicates that the new method outperforms its competitors by significantly improving the accuracy of profile data and the performance of generated binaries.

scholarly journals Optimasi Pengiriman Sapi Potong pada Jaringan Pelayaran Kapal Khusus Ternak dengan Algoritma Genetika

Jurnal METRIS ◽  
2021 ◽  
Vol 20 (1) ◽  
pp. 51-57
Author(s):  
Christine Natalia ◽  
Ghea Ghoniyyah Setiadi ◽  
Agustinus Silalahi
Keyword(s):  
Supply Chain ◽  
Supply Chain Management ◽  
Minimum Cost ◽  
Optimal Route ◽  
Total Load ◽  
Chain Management ◽  
Total Cost ◽  
Route Network ◽  
The Future ◽  
The Government

The government livestock carrier cruise program is a dedicated program to improve the supply chain management of livestock and the ultimate goal is selfsufficiency of beef in 2026. This carrier has one fleet with the capacity of 500 cows and sails through 8 ports regularly. The island of Nusa Tenggara are the local producers for the livestock carrier cruise which is an area of provincial surplus of beef. For the future the government plans to add more ships to the armada from the current one fleet to six fleets of livestock carrier cruises. The current livestock carrier cruise program has not been optimal in shipping cows to the consumer area. This is caused by the limitation of number of fleet and theexisting route that the livestock carrier has to sail through has created some obstacle to maximizing the number of cows to be distributed. This research aims to optimise this carrier cruising route with criteria including having high supplied beef percentage rate and having the most minimum cost. This optimisation problem solved by genetics algorithm methid and develop twodifferent scenarios that suggest alternatives for an optimal route. To make things easier, a computerized program with genetics algorithm method for a livestock carrier cruise optimization network are designed. The outcome of this research is a proposed optimised route on scenario 1 with total cost of Rp 443,306,533.26, and total load of 1,374 cows. As for the future to add five ships, the conditions are met by using the results of the second scenario with total cost of Rp 1,321,505,850.62, total load of 3416 cows and the route network for six ships

scholarly journals Optimasi Penyaluran Bahan Bakar Minyak di Wilayah Maluku Indonesia

2020 ◽  
Vol 3 (2) ◽  
pp. 106
Author(s):  
Rini Dian Sari ◽  
Farizal Farizal ◽  
Djoko Sihono Gabriel
Keyword(s):  
Linear Programming ◽  
Distribution System ◽  
Energy Demand ◽  
Fossil Fuel ◽  
Minimum Cost ◽  
Optimization Method ◽  
Demand Side ◽  
Cost Distance ◽  
Strategic Value ◽  
Decision Variables

Fossil fuel (BBM) is a vital commodity and has a strategic value for people's lives. On the demand side, the need for BBM tends to increase along with the increasing energy demand for people's lives. Therefore, the distribution system for BBM has to be optimized in order to fulfill the people’s demand. The aim of this paper is to optimize vehicle route for BBM distribution in Maluku so that it has minimum cost, distance, and time. The optimization method in this paper is Mix Integer Linear Programming (MILP). Decision variables in this paper are chosen from the most significant variables for BBM distribution in Maluku.

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.

Tidal Flow: A Fast and Teachable Maximum Flow Algorithm

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE
Keyword(s):  
Computer Science ◽  
Tidal Flow ◽  
Maximum Flow ◽  
Efficient Algorithms ◽  
Science Students ◽  
Flow Algorithm ◽  
Maximum Flows

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.

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.

Optimal Route Selection Strategy in Wireless Mesh Networks

2018 ◽  
Vol 6 (1) ◽  
pp. 238-243
Author(s):  
Pushpender Sarao ◽  
◽  
T. Raghavendra Gupta ◽  
S. Suresh ◽  
◽  
...  
Keyword(s):  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Selection Strategy ◽  
Route Selection ◽  
Optimal Route ◽  
Wireless Mesh

High Speed Information Network Planning using Stochastic Optimization Method

2013 ◽  
Author(s):  
Ki-Sang Song ◽  
Arun K. Somani
Keyword(s):  
Stochastic Optimization ◽  
Network Design ◽  
Multimedia Information ◽  
High Speed ◽  
Minimum Cost ◽  
Optimization Method ◽  
Multimedia Communication ◽  
Network Design Problem ◽  
Information Network ◽  
Traffic Characteristics

From the 1994 CAIS Conference: The Information Industry in Transition McGill University, Montreal, Quebec. May 25 - 27, 1994.Broadband integrated services digital network (B-ISDN) based on the asynchronous transmission mode (ATM) is becoming reality to provide high speed, multi bit rate multimedia communications. Multimedia communication network has to support voice, video and data traffics that have different traffic characteristics, delay sensitive or loss sensitive features have to be accounted for designing high speed multimedia information networks. In this paper, we formulate the network design problem by considering the multimedia communication requirements. A high speed multimedia information network design alogrithm is developed using a stochastic optimization method to find good solutions which meet the Quality of Service (QoS) requirement of each traffic class with minimum cost.

Sign in / Sign up

Export Citation Format

Share Document