Analytical Optimal Solution of Selfish Node Detection with 2-hop Constraints in OppNets

Author(s):  
Yang Gao ◽  
Jun Tao ◽  
Zuyan Wang ◽  
Wenqiang Li ◽  
Guang Cheng
Methodology ◽  
2018 ◽  
Vol 14 (4) ◽  
pp. 177-188 ◽  
Author(s):  
Martin Schultze ◽  
Michael Eid

Abstract. In the construction of scales intended for the use in cross-cultural studies, the selection of items needs to be guided not only by traditional criteria of item quality, but has to take information about the measurement invariance of the scale into account. We present an approach to automated item selection which depicts the process as a combinatorial optimization problem and aims at finding a scale which fulfils predefined target criteria – such as measurement invariance across cultures. The search for an optimal solution is performed using an adaptation of the [Formula: see text] Ant System algorithm. The approach is illustrated using an application to item selection for a personality scale assuming measurement invariance across multiple countries.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Author(s):  
Empya Charlie ◽  
Siti Rusdiana ◽  
Rini Oktavia

Penelitian ini bertujuan untuk mengoptimalkan penjadwalan karyawan di CV. Karya Indah Bordir dalam melakukan tugas-tugas tertentu menggunakan metode Hungaria, serta menganalisis sensitivitas solusi optimal jika ada pengurangan waktu karyawan untuk menyelesaikan tugas-tugas. Metode Hongaria diterapkan pada proses bordir yang melibatkan 11 karyawan dan 10 tugas. Hasil penjadwalan yang optimal meminimalkan waktu produksi bordir perusahaan. Hasil penjadwalan optimal yang ditemukan adalah: karyawan 1 mengerjakan tas Mambo, karyawan 2 mengerjakan tas Elli, karyawan 3 mengerjakan tas Lonjong, karyawan 4 mengerjakan tas Tampang bunga, karyawan 6 mengerjakan tas Ransel, karyawan 7 mengerjakan tas Tima, karyawan 8 mengerjakan tas Keong, karyawan 9 mengerjakan tas Alexa, karyawan 10 mengerjakan tas Luna, dan karyawan 11 mengerjakan tas Mikha, dengan total waktu kerja adalah 13,7 jam. Setelah metode Hongaria diterapkan, CV. Karya Indah Bordir mendapat peningkatan pendapatan sebanyak 9,09%. Analisis sensitivitas dilakukan dengan mengurangi waktu karyawan dalam menyulam tas. Hasil analisis sensitivitas adalah beberapa batasan untuk variabel basis dan non basis untuk mempertahankan solusi optimal.   This research has a purpose to optimize the scheduling of employees in CV. Karya Indah Bordir in doing certain tasks using Hungarian method, as well as analyzing the sensitivity of the optimal solution if there is a reduction on the employees time to finish the tasks. The Hungarian method was applied on the embroidery process involving 11 employees and 10 tasks. The optimal scheduling result minimize the time of the embroidery production of the company. The optimal scheduling result found is: employee 1 does the Mambo bag, employee 2 does the Elli bag, employee 3 does the Lonjong bag, employee 4 does the Tampang bunga bag, employee 6 does the Ransel, employee 7 does the Tima bag, employee 8 does the Keong bag, employee 9 does the Alexa bag, employees 10 does the Luna bag, and employee 11 does the Mikha bag, with the total work time is 13,7 hours. After the Hungarian method was applied, CV. Karya Indah Bordir got the increasing revenue as much as 9,09 %. The sensitivity analysis was conducted by reducing the time of the employees take in embroidery the bags. The results of the sensitivity analysis are some boundaries for basis and non basis variables to maintain the optimal solution. 


2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare

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.


Author(s):  
Lidiya Derbenyova

The article focuses on the problems of translation in the field of hermeneutics, understood as a methodology in the activity of an interpreter, the doctrine of the interpretation of texts, as a component of the transmission of information in a communicative aspect. The relevance of the study is caused by the special attention of modern linguistics to the under-researched issues of hermeneutics related to the problems of transmission of foreign language text semantics in translation. The process of translation in the aspect of hermeneutics is regarded as the optimum search and decision-making process, which corresponds to a specific set of functional criteria of translation, which can take many divergent forms. The translator carries out a number of specific translation activities: the choice of linguistic means and means of expression in the translation language, replacement and compensation of nonequivalent units. The search for the optimal solution itself is carried out using the “trial and error” method. The translator always acts as an interpreter. Within the boundaries of a individual utterance, it must be mentally reconstructed as conceptual situations, the mentally linguistic actions of the author, which are verbalized in this text.


2019 ◽  
Author(s):  
Anders Andreasen

In this article the optimization of a realistic oil and gas separation plant has been studied. Two different fluids are investigated and compared in terms of the optimization potential. Using Design of Computer Experiment (DACE) via Latin Hypercube Sampling (LHS) and rigorous process simulations, surrogate models using Kriging have been established for selected model responses. The surrogate models are used in combination with a variety of different evolutionary algorithms for optimizing the operating profit, mainly by maximizing the recoverable oil production. A total of 10 variables representing pressure and temperature various key places in the separation plant are optimized to maximize the operational profit. The optimization is bounded in the variables and a constraint function is included to ensure that the optimal solution allows export of oil with an RVP < 12 psia. The main finding is that, while a high pressure is preferred in the first separation stage, apparently a single optimal setting for the pressure in downstream separators does not appear to exist. In the second stage separator apparently two different, yet equally optimal, settings are revealed. In the third and final separation stage a correlation between the separator pressure and the applied inlet temperature exists, where different combinations of pressure and temperature yields equally optimal results.<br>


Sign in / Sign up

Export Citation Format

Share Document