scholarly journals Finding Two Disjoint Paths in a Network with Normalized α  + -MIN-SUM Objective Function

2005 ◽  
pp. 954-963 ◽  
Author(s):  
Bing Yang ◽  
S. Q. Zheng ◽  
Enyue Lu
Keyword(s):  
Objective Function ◽  
Disjoint Paths

scholarly journals Multi-Objective Function-Based Node-Disjoint Multipath Routing for Mobile Ad Hoc Networks

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1781
Author(s):  
Bhanumathi Velusamy ◽  
Kalaivanan Karunanithy ◽  
Damien Sauveron ◽  
Raja Naeem Akram ◽  
Jaehyuk Cho
Keyword(s):  
Energy Consumption ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Objective Function ◽  
Network Lifetime ◽  
Ad Hoc ◽  
Disjoint Paths ◽  
Multi Objective ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The main goal is to find multiple node-disjoint paths that meet the multi-objective optimization problem in terms of energy consumption minimization and network lifetime improvement. Due to the battery-dependent nodes in mobile ad hoc networks, the performance of the network will degrade. Hence, it is necessary to choose multiple optimal node-disjoint paths between source and destination for data transfer. Additionally, it improves the Quality of Service (QoS) of wireless networks. Multi-objective function is used to select a path such that it gives an optimum result based on the energy consumption, hop, and traffic load. From the simulation results, it is proved that the proposed system is achieving less energy consumption and improved network lifetime compared with existing Dynamic Source Routing (DSR), Hopfield Neural Network-based Disjoint Path set Selection (HNNDPS) and Multipath DSR (MDSR).

scholarly journals The complexity of finding two disjoint paths with min-max objective function

1990 ◽  
Vol 26 (1) ◽  
pp. 105-115 ◽  
Author(s):  
Chung-Lun Li ◽  
S.Thomas McCormick ◽  
David Simchi-Levi
Keyword(s):  
Objective Function ◽  
Disjoint Paths

Disjoint paths of bounded length in large generalized cycles

1999 ◽  
Vol 197-198 (1-3) ◽  
pp. 285-298 ◽  
Author(s):  
D Ferrero
Keyword(s):  
Disjoint Paths

Power Generation for India with Higher Efficiency

2018 ◽  
Vol 6 (7) ◽  
pp. 267
Author(s):  
Umeshkannan P ◽  
Muthurajan KG
Keyword(s):  
Power Generation ◽  
Objective Function ◽  
Fossil Fuels ◽  
Programming Model ◽  
Developed Countries ◽  
Power Requirement ◽  
Average Efficiency ◽  
Potential Demand ◽  
The Developed Countries ◽  
Developed Nations

The developed countries are consuming more amount of energy in all forms including electricity continuously with advanced technologies.  Developing  nation’s  energy usage trend rises quickly but very less in comparison with their population and  their  method of generating power is not  seems  to  be  as  advanced  as  developed  nations. The   objective   function   of   this   linear   programming model is to maximize the average efficiency of power generation inIndia for 2020 by giving preference to energy efficient technologies. This model is subjected to various constraints like potential, demand, running cost and Hydrogen / Carbon ratio, isolated load, emission and already installed capacities. Tora package is used to solve this linear program. Coal,  Gas,  Hydro  and  Nuclear  sources can are  supply around 87 %  of  power  requirement .  It’s concluded that we can produce power  at  overall  efficiency  of  37%  while  meeting  a  huge demand  of  13,00,000  GWh  of  electricity.  The objective function shows the scenario of highaverage efficiency with presence of 9% renewables. Maximum value   is   restricted   by   low   renewable   source’s efficiencies, emission constraints on fossil fuels and cost restriction on some of efficient technologies. This    model    shows    that    maximum    18%    of    total requirement   can   be   met   by   renewable itself which reduces average efficiency to 35.8%.   Improving technologies  of  renewable  sources  and  necessary  capacity addition  to  them in  regular  interval  will  enhance  their  role and existence against fossil fuels in future. The work involves conceptualizing, modeling, gathering information for data’s to be used in model for problem solving and presenting different scenarios for same objective.

Developing Schedule With Linear Programming (Case Study: STTF II Project Komplek Sukamukti Banjaran)

2020 ◽  
Vol 4 (02) ◽  
pp. 34-45
Author(s):  
Naufal Dzikri Afifi ◽  
Ika Arum Puspita ◽  
Mohammad Deni Akbar
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Project Scheduling ◽  
Time Limit ◽  
Minimum Time ◽  
Service Cost ◽  
Trade Off ◽  
Overtime Work ◽  
The Cost

Shift to The Front II Komplek Sukamukti Banjaran Project is one of the projects implemented by one of the companies engaged in telecommunications. In its implementation, each project including Shift to The Front II Komplek Sukamukti Banjaran has a time limit specified in the contract. Project scheduling is an important role in predicting both the cost and time in a project. Every project should be able to complete the project before or just in the time specified in the contract. Delay in a project can be anticipated by accelerating the duration of completion by using the crashing method with the application of linear programming. Linear programming will help iteration in the calculation of crashing because if linear programming not used, iteration will be repeated. The objective function in this scheduling is to minimize the cost. This study aims to find a trade-off between the costs and the minimum time expected to complete this project. The acceleration of the duration of this study was carried out using the addition of 4 hours of overtime work, 3 hours of overtime work, 2 hours of overtime work, and 1 hour of overtime work. The normal time for this project is 35 days with a service fee of Rp. 52,335,690. From the results of the crashing analysis, the alternative chosen is to add 1 hour of overtime to 34 days with a total service cost of Rp. 52,375,492. This acceleration will affect the entire project because there are 33 different locations worked on Shift to The Front II and if all these locations can be accelerated then the duration of completion of the entire project will be effective

Shape Optimization of Hydraulic Structures: an Example of an Optimum Design of a Fish Passage

10.29007/2k64 ◽  
2018 ◽  
Author(s):  
Pat Prodanovic ◽  
Cedric Goeury ◽  
Fabrice Zaoui ◽  
Riadh Ata ◽  
Jacques Fontaine ◽  
...  
Keyword(s):  
Numerical Model ◽  
Shape Optimization ◽  
Objective Function ◽  
Optimum Design ◽  
Optimization Problem ◽  
A Priori ◽  
Coupled System ◽  
Fish Passage ◽  
Hydraulic Structures ◽  
Design Variables

This paper presents a practical methodology developed for shape optimization studies of hydraulic structures using environmental numerical modelling codes. The methodology starts by defining the optimization problem and identifying relevant problem constraints. Design variables in shape optimization studies are configuration of structures (such as length or spacing of groins, orientation and layout of breakwaters, etc.) whose optimal orientation is not known a priori. The optimization problem is solved numerically by coupling an optimization algorithm to a numerical model. The coupled system is able to define, test and evaluate a multitude of new shapes, which are internally generated and then simulated using a numerical model. The developed methodology is tested using an example of an optimum design of a fish passage, where the design variables are the length and the position of slots. In this paper an objective function is defined where a target is specified and the numerical optimizer is asked to retrieve the target solution. Such a definition of the objective function is used to validate the developed tool chain. This work uses the numerical model TELEMAC- 2Dfrom the TELEMAC-MASCARET suite of numerical solvers for the solution of shallow water equations, coupled with various numerical optimization algorithms available in the literature.

Flexible Genetic Algorithm Based Optimal Power Flow of Power Systems

2018 ◽  
Vol 24 (3) ◽  
pp. 84
Author(s):  
Hassan Abdullah Kubba ◽  
Mounir Thamer Esmieel
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Power Flow ◽  
Optimal Power Flow ◽  
Reactive Power ◽  
Test System ◽  
Multi Objective ◽  
Optimal Power ◽  
Blending Method ◽  
Real Coded Genetic Algorithm

Nowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real output power of each generator bus and reactive power of each generator bus within their limits. The proposed method in this thesis is the Flexible Continuous Genetic Algorithm or in other words the Flexible Real-Coded Genetic Algorithm (RCGA) using the efficient GA's operators such as Rank Assignment (Weighted) Roulette Wheel Selection, Blending Method Recombination operator and Mutation Operator as well as Multi-Objective Minimization technique (MOM). This method has been tested and checked on the IEEE 30 buses test system and implemented on the 35-bus Super Iraqi National Grid (SING) system (400 KV). The results of OPF problem using IEEE 30 buses typical system has been compared with other researches.     

Sign in / Sign up

Export Citation Format

Share Document