The traveling salesman problem (TSP) supports the idea of a single salesperson traveling in a continuous trip visiting all n cities exactly once and returning to the starting point. The multiple traveling salesman problems (mTSP) is complex combinatorial optimization problem, which is a generalization of the well-known Travelling Salesman Problem (TSP), where one or more salesman can be used in the path. In this paper mTSP has also been studied and solved with GA in the form of the vehicle scheduling problem. The existing model is new models are compared to both mathematically and experimentally. This work presents a chromosome methodology setting up the MTSP to be solved using a GA.
TSP is np- hard problem which has number of solution but it's difficult to find optimal solution . I gave here fast,easy and efficient solution on TSP using one algorithm with good explanation.Hope you understood very well.
Graph theory - Traveling Salesman and Chinese PostmanChristian Kehl
Traveling Salesman and Chinese Postman problems
1. Problem Description and Complexity
2. Theoretical Approach
3. Practical Approaches and Possible Solutions
4. Examples
TSP is np- hard problem which has number of solution but it's difficult to find optimal solution . I gave here fast,easy and efficient solution on TSP using one algorithm with good explanation.Hope you understood very well.
Graph theory - Traveling Salesman and Chinese PostmanChristian Kehl
Traveling Salesman and Chinese Postman problems
1. Problem Description and Complexity
2. Theoretical Approach
3. Practical Approaches and Possible Solutions
4. Examples
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
Presentation of GreenYourMove's hybrid approach in 3rd International Conferen...GreenYourMove
Presentation of the Journey planning problem and GreenYourMove's hybrid approach.
Dr. Georgios Saharidis, Fragogios Antonis, Rizopoulos Dimitris, Chrysostomos Chatzigeorgiou
A new hybrid approach for solving travelling salesman problem using ordered c...eSAT Journals
Abstract Travelling Salesman Problem is a well known NP problem. It is an optimization problem. Genetic Algorithms are the evolution techniques to solve optimization problems. In this paper a new hybrid technique using ordered cross over 1 (OX1) and greedy approach has been proposed. Experiment results shows that the proposed hybrid cross over is better than the existing cross over operator as the new operator provide a better path when executed for the same number of iterations. Keywords:- Travelling Salesman Problem, ordered cross over 1 (OX1)
The transportation problem is a special type of linear programming problem where the objective is to minimize the cost of distributing a product from a number of sources or origins to a number of destinations.
Because of its special structure, the usual simplex method is not suitable for solving transportation problems. These problems require a special method of solution.
The assignment problem is a special type of linear programming problem and it is sub class of transportation problem. Assignment problems are defined with two sets of inputs i.e. set of resources and set of demands. Hungarian algorithm is able to solve assignment problems with precisely defined demands and resources.Nowadays, many organizations and competition companies consider markets of their products. They use many salespersons to improve their organizations marketing. Salespersons travel form one city to another city for their markets. There are some problems in travelling which salespeople should go which city in minimum cost. So, travelling assignment problem is a main process for many business functions. Mie Mie Aung | Yin Yin Cho | Khin Htay | Khin Soe Myint "Minimization of Assignment Problems" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26712.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/26712/minimization-of-assignment-problems/mie-mie-aung
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
Presentation of GreenYourMove's hybrid approach in 3rd International Conferen...GreenYourMove
Presentation of the Journey planning problem and GreenYourMove's hybrid approach.
Dr. Georgios Saharidis, Fragogios Antonis, Rizopoulos Dimitris, Chrysostomos Chatzigeorgiou
A new hybrid approach for solving travelling salesman problem using ordered c...eSAT Journals
Abstract Travelling Salesman Problem is a well known NP problem. It is an optimization problem. Genetic Algorithms are the evolution techniques to solve optimization problems. In this paper a new hybrid technique using ordered cross over 1 (OX1) and greedy approach has been proposed. Experiment results shows that the proposed hybrid cross over is better than the existing cross over operator as the new operator provide a better path when executed for the same number of iterations. Keywords:- Travelling Salesman Problem, ordered cross over 1 (OX1)
The transportation problem is a special type of linear programming problem where the objective is to minimize the cost of distributing a product from a number of sources or origins to a number of destinations.
Because of its special structure, the usual simplex method is not suitable for solving transportation problems. These problems require a special method of solution.
The assignment problem is a special type of linear programming problem and it is sub class of transportation problem. Assignment problems are defined with two sets of inputs i.e. set of resources and set of demands. Hungarian algorithm is able to solve assignment problems with precisely defined demands and resources.Nowadays, many organizations and competition companies consider markets of their products. They use many salespersons to improve their organizations marketing. Salespersons travel form one city to another city for their markets. There are some problems in travelling which salespeople should go which city in minimum cost. So, travelling assignment problem is a main process for many business functions. Mie Mie Aung | Yin Yin Cho | Khin Htay | Khin Soe Myint "Minimization of Assignment Problems" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26712.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/26712/minimization-of-assignment-problems/mie-mie-aung
Hybrid iterated local search algorithm for optimization route of airplane tr...IJECEIAES
The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However, a non-deterministic algorithm can only produce a fairly good solution but does not guarantee an optimal solution. Therefore, there are still opportunities to develop new algorithms with better optimization results. This research develops a new algorithm by hybridizing three local search algorithms, namely, iterated local search (ILS) with simulated annealing (SA) and hill climbing (HC), to get a better optimization result. This algorithm aimed to solve TSP problems in the transportation sector, using a case study from the Traveling Salesman Challenge 2.0 (TSC 2.0). The test results show that the developed algorithm can optimize better by 15.7% on average and 11.4% based on the best results compared to previous studies using the TabuSA algorithm.
The optimization of running queries in relational databases using ant colony ...ijdms
The issue of optimizing queries is a cost-sensitive
process and with respect to the number of associat
ed
tables in a query, its number of permutations grows
exponentially. On one hand, in comparison with oth
er
operators in relational database, join operator is
the most difficult and complicated one in terms of
optimization for reducing its runtime. Accordingly,
various algorithms have so far been proposed to so
lve
this problem. On the other hand, the success of any
database management system (DBMS) means
exploiting the query model. In the current paper, t
he heuristic ant algorithm has been proposed to sol
ve this
problem and improve the runtime of join operation.
Experiments and observed results reveal the efficie
ncy
of this algorithm compared to its similar algorithm
s.
The well-known Vehicle Routing Problem (VRP) consist of assigning routeswith a set
ofcustomersto different vehicles, in order tominimize the cost of transport, usually starting from a central
warehouse and using a fleet of fixed vehicles. There are numerousapproaches for the resolution of this kind of
problems, being the metaheuristic techniques the most used, including the Genetic Algorithms (AG). The
number of approachesto the different parameters of an AG (selection, crossing, mutation...) in the literature is
such that it is not easy to take a resolution of a VRP problem directly. This paper aims to simplify this task by
analyzing the best known approaches with standard VRP data sets, and showing the parameter configurations
that offer the best results.
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMSecij
Travelling salesman problem (TSP) is a most popular combinatorial routing problem, belongs to the class of NP-hard problems. Many approacheshave been proposed for TSP.Among them, swarm intelligence (SI) algorithms can effectively achieve optimal tours with the minimum lengths and attempt to avoid trapping in local minima points. The transcendence of each SI is depended on the nature of the problem. In our studies, there has been yet no any article, which had compared the performance of SI algorithms for TSP perfectly. In this paper,four common SI algorithms are used to solve TSP, in order to compare the performance of SI algorithms for the TSP problem. These algorithms include genetic algorithm, particle swarm optimization, ant colony optimization, and artificial bee colony. For each SI, the various parameters and operators were tested, and the best values were selected for it. Experiments oversome benchmarks fromTSPLIBshow that
artificial bee colony algorithm is the best one among the fourSI-basedmethods to solverouting problems like TSP.
Simulation-based Optimization of a Real-world Travelling Salesman Problem Usi...CSCJournals
This paper presents a real-world case study of optimizing waste collection in Sweden. The problem, involving approximately 17,000 garbage bins served by three bin lorries, is approached as a travelling salesman problem and solved using simulation-based optimization and an evolutionary algorithm. To improve the performance of the evolutionary algorithm, it is enhanced with a repair function that adjusts its genome values so that shorter routes are found more quickly. The algorithm is tested using two crossover operators, i.e., the order crossover and heuristic crossover, combined with different mutation rates. The results indicate that the order crossover is superior to the heuristics crossover, but that the driving force of the search process is the mutation operator combined with the repair function.
Quantum inspired evolutionary algorithm for solving multiple travelling sales...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
In recent years, consumers and legislation have been pushing companies to optimize their activities in such a way as to reduce negative environmental and social impacts more and more. In the other side, companies
must keep their total supply chain costs as low as possible to remain competitive.This work aims to develop a model to traveling salesman problem including environmental impacts and to identify, as far as possible, the contribution of genetic operator’s tuning and setting in the success and
efficiency of genetic algorithms for solving this problem with consideration of CO2 emission due to transport. This efficiency is calculated in terms of CPU time consumption and convergence of the solution. The best transportation policy is determined by finding a balance between financial and environmental
criteria.Empirically, we have demonstrated that the performance of the genetic algorithm undergo relevant
improvements during some combinations of parameters and operators which we present in our results part.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
A heuristic approach for optimizing travel planning using genetics algorithmeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A heuristic approach for optimizing travel planning using genetics algorithmeSAT Journals
Abstract In today’s fast-paced society, everyone is caught up in the hustle and bustle of life which has resulted in ineffective Planning of their very important vacation tour. Either they spend much time on deciding what to do next, or will take many unnecessary, unfocused and inefficient steps. The main purpose of our project is to develop a Travel Planner that will allow the customer to plan the entire tour so that he visits many places in less time. The concept would be implemented using Genetics Algorithm of Artificial Intelligence which would be used as a search algorithm to find the nearest optimal travel path. Moreover, In order to reduce the running time of GA, Parallelization of Genetics Algorithm would be demonstrated using Hadoop Framework. Key Words: Genetics Algorithm, TSP, Hadoop, and MapReduce etc…
A NEW APPROACH IN DYNAMIC TRAVELING SALESMAN PROBLEM: A HYBRID OF ANT COLONY ...ijmpict
Nowadays swarm intelligence-based algorithms are being used widely to optimize the dynamic traveling salesman problem (DTSP). In this paper, we have used mixed method of Ant Colony Optimization (AOC) and gradient descent to optimize DTSP which differs with ACO algorithm in evaporation rate and innovative data. This approach prevents premature convergence and scape from local optimum spots and also makes it possible to find better solutions for algorithm. In this paper, we’re going to offer gradient descent and ACO algorithm which in comparison to some former methods it shows that algorithm has significantly improved routes optimization.
Due to availability of internet and evolution of embedded devices, Internet of things can be useful to contribute in energy domain. The Internet of Things (IoT) will deliver a smarter grid to enable more information and connectivity throughout the infrastructure and to homes. Through the IoT, consumers, manufacturers and utility providers will come across new ways to manage devices and ultimately conserve resources and save money by using smart meters, home gateways, smart plugs and connected appliances. The future smart home, various devices will be able to measure and share their energy consumption, and actively participate in house-wide or building wide energy management systems. This paper discusses the different approaches being taken worldwide to connect the smart grid. Full system solutions can be developed by combining hardware and software to address some of the challenges in building a smarter and more connected smart grid.
A Survey Report on : Security & Challenges in Internet of Thingsijsrd.com
In the era of computing technology, Internet of Things (IoT) devices are now popular in each and every domains like e-governance, e-Health, e-Home, e-Commerce, and e-Trafficking etc. Iot is spreading from small to large applications in all fields like Smart Cities, Smart Grids, Smart Transportation. As on one side IoT provide facilities and services for the society. On the other hand, IoT security is also a crucial issues.IoT security is an area which totally concerned for giving security to connected devices and networks in the IoT .As, IoT is vast area with usability, performance, security, and reliability as a major challenges in it. The growth of the IoT is exponentially increases as driven by market pressures, which proportionally increases the security threats involved in IoT The relationship between the security and billions of devices connecting to the Internet cannot be described with existing mathematical methods. In this paper, we explore the opportunities possible in the IoT with security threats and challenges associated with it.
In today’s emerging world of Internet, each and every thing is supposed to be in connected mode with the help of billions of smart devices. By connecting all the devises used in our day to day life, make our life trouble less and easy. We are incorporated in a world where we are used to have smart phones, smart cars, smart gadgets, smart homes and smart cities. Different institutes and researchers are working for creating a smart world for us but real question which we need to emphasis on is how to make dumb devises talk with uncommon hardware and communication technology. For the same what kind of mechanism to use with various protocols and less human interaction. The purpose is to provide the key area for application of IoT and a platform on which various devices having different mechanism and protocols can communicate with an integrated architecture.
Study on Issues in Managing and Protecting Data of IOTijsrd.com
This paper discusses variety of issues for preserving and managing data produced by IoT. Every second large amount of data are added or updated in the IoT databases across the heterogeneous environment. While managing the data each phase of data processing for IoT data is exigent like storing data, querying, indexing, transaction management and failure handling. We also refer to the problem of data integration and protection as data requires to be fit in single layout and travel securely as they arrive in the pool from diversified sources in different structure. Finally, we confer a standardized pathway to manage and to defend data in consistent manner.
Interactive Technologies for Improving Quality of Education to Build Collabor...ijsrd.com
Today with advancement in Information Communication Technology (ICT) the way the education is being delivered is seeing a paradigm shift from boring classroom lectures to interactive applications such as 2-D and 3-D learning content, animations, live videos, response systems, interactive panels, education games, virtual laboratories and collaborative research (data gathering and analysis) etc. Engineering is emerging with more innovative solutions in the field of education and bringing out their innovative products to improve education delivery. The academic institutes which were once hesitant to use such technology are now looking forward to such innovations. They are adopting the new ways as they are realizing the vast benefits of using such methods and technology. The benefits are better comprehensibility, improved learning efficiency of students, and access to vast knowledge resources, geographical reach, quick feedback, accountability and quality research. This paper focuses on how engineering can leverage the latest technology and build a collaborative learning environment which can then be integrated with the national e-learning grid.
Internet of Things - Paradigm Shift of Future Internet Application for Specia...ijsrd.com
In the world more than 15% people are living with disability that also include children below age of 10 years. Due to lack of independent support services specially abled (handicap) people overly rely on other people for their basic needs, that excludes them from being financially and socially active. The Internet of Things (IoT) can give support system and a better quality of life as well as participation in routine and day to day life. For this purpose, the future solutions for current problems has been introduced in this paper. Daunting challenges have been considered as future research and glimpse of the IoT for specially abled person is given in the paper.
A Study of the Adverse Effects of IoT on Student's Lifeijsrd.com
Internet of things (IoT) is the most powerful invention and if used in the positive direction, internet can prove to be very productive. But, now a days, due to the social networking sites such as Face book, WhatsApp, twitter, hike etc. internet is producing adverse effects on the student life, especially those students studying at college Level. As it is rightly said, something which has some positive effects also has some of the negative effects on the other hand. In this article, we are discussing some adverse effects of IoT on student’s life.
Pedagogy for Effective use of ICT in English Language Learningijsrd.com
The use of information and communications technology (ICT) in education is a relatively new phenomenon and it has been the educational researchers' focus of attention for more than two decades. Educators and researchers examine the challenges of using ICT and think of new ways to integrate ICT into the curriculum. However, there are some barriers for the teachers that prevent them to use ICT in the classroom and develop supporting materials through ICT. The purpose of this study is to examine the high school English teachers’ perceptions of the factors discouraging teachers to use ICT in the classroom.
In recent years usage of private vehicles create urban traffic more and more crowded. As result traffic becomes one of the important problems in big cities in all over the world. Some of the traffic concerns are traffic jam and accidents which have caused a huge waste of time, more fuel consumption and more pollution. Time is very important parameter in routine life. The main problem faced by the people is real time routing. Our solution Virtual Eye will provide the current updates as in the real time scenario of the specific route. This research paper presents smart traffic navigation system, based on Internet of Things, which is featured by low cost, high compatibility, easy to upgrade, to replace traditional traffic management system and the proposed system can improve road traffic tremendously.
Ontological Model of Educational Programs in Computer Science (Bachelor and M...ijsrd.com
In this work there is illustrated an ontological model of educational programs in computer science for bachelor and master degrees in Computer science and for master educational program “Computer science as second competence†by Tempus project PROMIS.
Understanding IoT Management for Smart Refrigeratorijsrd.com
Lately the concept of Internet of Things (IoT) is being more elaborated and devices and databases are proposed thereby to meet the need of an Internet of Things scenario. IoT is being considered to be an integral part of smart house where devices will be connected to each other and also react upon certain environmental input. This will eventually include the home refrigerator, air conditioner, lights, heater and such other home appliances. Therefore, we focus our research on the database part for such an IoT’ fridge which we called as smart Fridge. We describe the potentials achievable through a database for an IoT refrigerator to manage the refrigerator food and also aid the creation of a monthly budget of the house for a family. The paper aims at the data management issue based on a proposed design for an intelligent refrigerator leveraging the sensor technology and the wireless communication technology. The refrigerator which identifies products by reading the barcodes or RFID tags is proposed to order the required products by connecting to the Internet. Thus the goal of this paper is to minimize human interaction to maintain the daily life events.
DESIGN AND ANALYSIS OF DOUBLE WISHBONE SUSPENSION SYSTEM USING FINITE ELEMENT...ijsrd.com
Double wishbone designs allow the engineer to carefully control the motion of the wheel throughout suspension travel. 3-D model of the Lower Wishbone Arm is prepared by using CAD software for modal and stress analysis. The forces and moments are used as the boundary conditions for finite element model of the wishbone arm. By using these boundary conditions static analysis is carried out. Then making the load as a function of time; quasi-static analysis of the wishbone arm is carried out. A finite element based optimization is used to optimize the design of lower wishbone arm. Topology optimization and material optimization techniques are used to optimize lower wishbone arm design.
A Review: Microwave Energy for materials processingijsrd.com
Microwave energy is a latest largest growing technique for material processing. This paper presents a review of microwave technologies used for material processing and its use for industrial applications. Advantages in using microwave energy for processing material include rapid heating, high heating efficiency, heating uniformity and clean energy. The microwave heating has various characteristics and due to which it has been become popular for heating low temperature applications to high temperature applications. In recent years this novel technique has been successfully utilized for the processing of metallic materials. Many researchers have reported microwave energy for sintering, joining and cladding of metallic materials. The aim of this paper is to show the use of microwave energy not only for non-metallic materials but also the metallic materials. The ability to process metals with microwave could assist in the manufacturing of high performance metal parts desired in many industries, for example in automotive and aeronautical industries.
Web Usage Mining: A Survey on User's Navigation Pattern from Web Logsijsrd.com
With an expontial growth of World Wide Web, there are so many information overloaded and it became hard to find out data according to need. Web usage mining is a part of web mining, which deal with automatic discovery of user navigation pattern from web log. This paper presents an overview of web mining and also provide navigation pattern from classification and clustering algorithm for web usage mining. Web usage mining contain three important task namely data preprocessing, pattern discovery and pattern analysis based on discovered pattern. And also contain the comparative study of web mining techniques.
APPLICATION OF STATCOM to IMPROVED DYNAMIC PERFORMANCE OF POWER SYSTEMijsrd.com
Application of FACTS controller called Static Synchronous Compensator STATCOM to improve the performance of power grid with Wind Farms is investigated .The essential feature of the STATCOM is that it has the ability to absorb or inject fastly the reactive power with power grid . Therefore the voltage regulation of the power grid with STATCOM FACTS device is achieved. Moreover restoring the stability of the power system having wind farm after occurring severe disturbance such as faults or wind farm mechanical power variation is obtained with STATCOM controller . The dynamic model of the power system having wind farm controlled by proposed STATCOM is developed . To validate the powerful of the STATCOM FACTS controller, the studied power system is simulated and subjected to different severe disturbances. The results prove the effectiveness of the proposed STATCOM controller in terms of fast damping the power system oscillations and restoring the power system stability.
Making model of dual axis solar tracking with Maximum Power Point Trackingijsrd.com
Now a days solar harvesting is more popular. As the popularity become higher the material quality and solar tracking methods are more improved. There are several factors affecting the solar system. Major influence on solar cell, intensity of source radiation and storage techniques The materials used in solar cell manufacturing limit the efficiency of solar cell. This makes it particularly difficult to make considerable improvements in the performance of the cell, and hence restricts the efficiency of the overall collection process. Therefore, the most attainable maximum power point tracking method of improving the performance of solar power collection is to increase the mean intensity of radiation received from the source used. The purposed of tracking system controls elevation and orientation angles of solar panels such that the panels always maintain perpendicular to the sunlight. The measured variables of our automatic system were compared with those of a fixed angle PV system. As a result of the experiment, the voltage generated by the proposed tracking system has an overall of about 28.11% more than the fixed angle PV system. There are three major approaches for maximizing power extraction in medium and large scale systems. They are sun tracking, maximum power point (MPP) tracking or both.
A REVIEW PAPER ON PERFORMANCE AND EMISSION TEST OF 4 STROKE DIESEL ENGINE USI...ijsrd.com
In day today's relevance, it is mandatory to device the usage of diesel in an economic way. In present scenario, the very low combustion efficiency of CI engine leads to poor performance of engine and produces emission due to incomplete combustion. Study of research papers is focused on the improvement in efficiency of the engine and reduction in emissions by adding ethanol in a diesel with different blends like 5%, 10%, 15%, 20%, 25% and 30% by volume. The performance and emission characteristics of the engine are tested observed using blended fuels and comparative assessment is done with the performance and emission characteristics of engine using pure diesel.
Study and Review on Various Current Comparatorsijsrd.com
This paper presents study and review on various current comparators. It also describes low voltage current comparator using flipped voltage follower (FVF) to obtain the single supply voltage. This circuit has short propagation delay and occupies a small chip area as compare to other current comparators. The results of this circuit has obtained using PSpice simulator for 0.18 μm CMOS technology and a comparison has been performed with its non FVF counterpart to contrast its effectiveness, simplicity, compactness and low power consumption.
Reducing Silicon Real Estate and Switching Activity Using Low Power Test Patt...ijsrd.com
Power dissipation is a challenging problem for today's system-on-chip design and test. This paper presents a novel architecture which generates the test patterns with reduced switching activities; it has the advantage of low test power and low hardware overhead. The proposed LP-TPG (test pattern generator) structure consists of modified low power linear feedback shift register (LP-LFSR), m-bit counter, gray counter, NOR-gate structure and XOR-array. The seed generated from LP-LFSR is EXCLUSIVE-OR ed with the data generated from gray code generator. The XOR result of the sequence is single input changing (SIC) sequence, in turn reduces the switching activity and so power dissipation will be very less. The proposed architecture is simulated using Modelsim and synthesized using Xilinx ISE9.2.The Xilinx chip scope tool will be used to test the logic running on FPGA.
Defending Reactive Jammers in WSN using a Trigger Identification Service.ijsrd.com
In the last decade, the greatest threat to the wireless sensor network has been Reactive Jamming Attack because it is difficult to be disclosed and defend as well as due to its mass destruction to legitimate sensor communications. As discussed above about the Reactive Jammers Nodes, a new scheme to deactivate them efficiently is by identifying all trigger nodes, where transmissions invoke the jammer nodes, which has been proposed and developed. Due to this identification mechanism, many existing reactive jamming defending schemes can be benefited. This Trigger Identification can also work as an application layer .In this paper, on one side we provide the several optimization problems to provide complete trigger identification service framework for unreliable wireless sensor networks and on the other side we also provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...ssuser7dcef0
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
CW RADAR, FMCW RADAR, FMCW ALTIMETER, AND THEIR PARAMETERSveerababupersonal22
It consists of cw radar and fmcw radar ,range measurement,if amplifier and fmcw altimeterThe CW radar operates using continuous wave transmission, while the FMCW radar employs frequency-modulated continuous wave technology. Range measurement is a crucial aspect of radar systems, providing information about the distance to a target. The IF amplifier plays a key role in signal processing, amplifying intermediate frequency signals for further analysis. The FMCW altimeter utilizes frequency-modulated continuous wave technology to accurately measure altitude above a reference point.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm
1. IJSRD - International Journal for Scientific Research & Development| Vol. 1, Issue 5, 2013 | ISSN (online): 2321-0613
All rights reserved by www.ijsrd.com 1200
Abstract— The traveling salesman problem (TSP) supports
the idea of a single salesperson traveling in a continuous trip
visiting all n cities exactly once and returning to the starting
point. The multiple traveling salesman problems (mTSP) is
complex combinatorial optimization problem, which is a
generalization of the well-known Travelling Salesman
Problem (TSP), where one or more salesman can be used in
the path. In this paper mTSP has also been studied and
solved with GA in the form of the vehicle scheduling
problem. The existing model is new models are compared to
both mathematically and experimentally. This work presents
a chromosome methodology setting up the MTSP to be
solved using a GA.
Keywords: mTSP, VRP, Genetic algorithm, Chromosome
method, Optimization.
I. INTRODUCTION
The work on TSP has focused on the idea of a single
salesperson traveling in a continuous trip visiting all n cities
exactly once and returning to the starting point [1]. There
has been some work done on the idea of using multiple
salesmen to visit all of the cities exactly once. In the last two
decades the travelling salesman problem received quite big
attention, and various approaches have been proposed for
obtaining either optimal or near optimal solution for the TSP
[2]. In this method used to solve the TSP range from classic
methodologies based on linear programming and branch-
and-bound to artificial intelligence methods such as neural
networks [5]
Some of these methods are exact algorithms, while others
are near-optimal or approximate algorithms. The exact
algorithms use integer linear programming [3] approaches
with additional constraints.
The work on solving mTSPs using GA has focused on
vehicle scheduling problems [4]. The vehicle scheduling
problem (VSP) consists of scheduling a fleet of m vehicles
visit to n cities with each city being visited by and only one
vehicle. More recently, genetic algorithms (GA) are
successfully implemented to solve TSP [1]. Potvin presents
a survey of GA approaches for the general TSP [2].
II. PROBLEM DESCRIPTION
The multiple TSP work has focused on vehicle scheduling
problems with the goal of minimizing the total distance
travelled by all the trucks (salesman) or minimizing the total
number of trucks required [2].
The aim of balancing the workload (or distance travelled)
among the multiple salesman that are being used to visit the
required cities is a problem is very difficult. Using multiple
salesmen makes the problem even harder due to the
increased number of ways to visit each city once. While the
multiple TSP can be modeled as a single TSP, The result is
effectively a longer tour that increases the solution space of
the problem.
The multiple traveling salesman problems (MTSP) are a
difficult problem that can use to significant number of
practical problem. The MTSP is similar to the notoriously
difficult traveling salesman problem (TSP) that seeks on
optimal tour of n cities, visiting each city exactly once with
no sub tours [4]. In the MTSP, the n cities are partitioned
into m tours. With each assigned to a separate salesman. The
MTSP is even more difficult than the TSP because it
requires determining which cities to assign to each salesman
as well as the optimal ordering of the cities within each
salesman’s tour [5].
In this paper tools developed for a modified mTSP related to
the optimization of one to many distribution systems will be
studied and a novel genetic algorithm based solution will be
proposed.
In the case of mTSP, a set of nodes (location or cities) are
given, and all of the cities must be visited exactly once by
the salesman who all start and end at the single depot node.
The number of cities is denoted by n and the number of
salesman by m. The goal is to find tours for all salesmen,
such that the total traveling cost (the cost of visiting all
nodes) is minimized. The cost metric can be defined in
terms of distance, times, etc., some possible variations of the
problem are as follows.
1 Multiple depots: If there exist multiple depots with
a number of salesmen located at each, a salesman
at each depot remains the same after all the travel.
2 Number of salesman: The number of salesmen in
the problem can be fixed number.
3 Fixed charges: If the number of salesmen is a
bonded variable, usually the usage of each
salesman in the solution has an associated fixed
cost; In this case the minimization of this bounded
variable may be involved in the optimization.
4 Other restrictions: These additional restrictions can
consist of the maximum or minimum distance
travelling duration salesman travels, or other
constraints.
The main goal is to minimize the total traveling cost of the
problem that is often formulated as assignment based integer
linear programming [3]:
∑ ∑
∑
∑
The Optimizing Multiple Travelling Salesman Problem
Using Genetic Algorithm
R.Jayasutha1
Dr. B. S. E. Zoraida2
1
Research Scholar 2
Assistant Professor
1,2
Bharathidasan University, Trichirappalli
2. The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm
(IJSRD/Vol. 1/Issue 5/2013/040)
All rights reserved by www.ijsrd.com 1201
∑
∑
+Sub tour elimination constraints (1.6)
{ } (1.7)
Usually, mTSP is formulated by integer programing
formulations; one variation is presented in equation (1.1)-
(1.7). The mTSP problem is defined on a graph G = (V, A),
where V is the set of n nodes (Vertices) and A is the arcs
(edges), Let C = ( ) be a cost (distance) matrix associated
with A. The matrix symmetric if = Ɐ (i,j) € A
asymmetric otherwise. Here € {0, 1} is a being variable
used to represents the cost of the involvement of one
salesman in the solution. Further mathematical
representation can be found in [3].
III. PRELIMINARIES
A. Over View of GA
Genetic algorithms (GAs) are a relatively new optimization
technique that can be applied to TSPs. The basic ideas of
behind Gas evolved in the mind of John Holland at the
University of Michigan in the early 1970s (Holland, 1975).
Most of the work on solving mTSPs using Gas has focused
on the vehicle scheduling problem (VSP) [4]. The
development of effective GA operators for TSPs has led to
great deal of interest and research to improve GA
performance for this type of problem [5].
In a nutshell, GA work by generating a population of
numeric vectors (called chromosome), each representing a
possible solution to a problem. The individual components
(numeric values) with in a chromosome are called genes.
New chromosomes are created by crossover (the
probabilistic exchange of values between vectors) or
mutation (the random replacements of values in a vector).
Mutation provides randomness with in the chromosomes to
increase coverage of the search space and help prevent
premature convergence on a local optimum. Chromosomes
are evaluated according to a fitness (or objective) function,
with the fittest solving and less fit being eliminated. The
result is a gene pool that evolves over time to produce and
better solutions to a problem. The search process typically
continues until a pre-specified fitness value is reached, a set
amount of computing time passes or until no significant
improvement occurs in the population for a given number of
iterations.
A well designed chromosome must accurately represent a
solution to the problem and allow the GA operators to work
effectively to generate better solutions as the iterative
evolutionary process continues. Solving the TSP using Gas
has generated a great deal of research focused on how to
perform the action of “evolving” an optimal (or good)
solution to the problem.
A new approach of chromosome representation, the so-
called two-part chromosome technique can be found [7]
which reduce the size of the search space by the elimination
of redundant solution.
B. Fitness function
The fitness function assigns a numeric value to each
individual in the population. The value define some kind of
goodness, thus it determines the ranking of the individuals.
The fitness function is always problem dependent.
In the case the fitness value is the total cost of the
transportation, i.e. the total length of each round trip. The
fitness function calculates the total length for each function
calculates the total length for each chromosome, and
summarizes these values for each individual. This sum is the
fitness value of a solution. It is a minimization problem, thus
the smallest value is the best.
C. Selection
Individuals are selected according to the fitness. The better
chromosomes are more chances to be selected. The selected
individuals can be presented in the new population without
any changes, or can be selected to be a tournament for a
crossover. We use the so-called tournament selection
because of its efficiency.
Tournament selection, a few individuals are selected from
the population randomly. The winner of the tournament is
the individual with the best fitness value. Some of the first
participants in the randomly are selected in to the new
population.
D. Mutation
The mutation operator induces changes in a small number of
chromosomes units. Its purpose is to maintain the population
diversified enough during the optimization process. The
mutation operation in GA works on a single chromosome at
a time and alters the genes of the chromosomes randomly. In
this TSP application using GA, the mutation plays the
primary role in arriving at the solutions.
IV. GENETIC ALGORITHM IN MTSP
GA is relatively new global stochastic search algorithm
which based an evolutionary biology-and computer science
principles [1]. Due to the effective optimization capabilities
of Ga [2], it makes these techniques suitable solving TSP
and mTSP problems.
A. The Permutation representation for mTSP
If modeled properly the mTSP can be solved using any of
operators developed for the TSP. Researchers have proposed
two methods of modeling the mTSP search that a TSP
operator can be used. One method uses two chromosomes to
model the mTSB. The first chromosome provides a
permutation of the cities and the second chromosome
assigns a salesman to the city in the corresponding position
of the first chromosome [5]. This method requires two
chromosome of length n to represent a solution.
Every genetic algorithm starts with an initial solution set
consist of randomly created chromosomes. This called
population. The individual in the new population are
generated from the previous population’s individuals by the
predetermined chromosome methods. The algorithm
finishes if the stop criteria is satisfied. For a specific
problem it is a much more complex task, we need to define
the encoding is called permutation encoding.
3. The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm
(IJSRD/Vol. 1/Issue 5/2013/040)
All rights reserved by www.ijsrd.com 1202
B. The two part technique
Fig-1 illustrates one approach for representing solution to an
MTSP (where n=15 and m=4) that we refer to as the “Two
chromosome” technique.as the name implies this method
requires two chromosome, each of length m, to represent a
solution. The first chromosome provides a permutation of
the n cities while the second chromosome assigns a
salesman to each of the cities in the corresponding position
of the first chromosome.
1) Cities
2 5 14 6 1 11 8 13 4 10 3 12 15 9 7
2) Salesman
Fig. 1: Example of the two chromosome representation for a
15 city mTSP with 4salesman
In the example in Fig-1, cities 2,8,12 and 9 (in that order)
are visited by salesman 2, cities 5, 14, 10 and 15 (in that
order) are visited by salesman 1; and remaining cities being
assigned to salesman 3 and 4. Using this chromosome
design, there are n! m,n
possible solutions to the problem.
Where n is the number of cities and m is the number of
salesman. However, many of the possible solution are
redundant. For example, the first two genes in each of the
above chromosomes can be interchanged to create a
different chromosome that results in an identical (or
redundant) solution.
V. EXPERIMENTAL RESULT
Although the algorithm was tested with a big number of
problems, only an illustrative result is presented here. As it
was mentioned earlier the algorithm has implemented in
MATLAB. The example represents a whole process of a
real problem’s solution. The input data is given by distance
matrix, MTSP is (n=15, m=4) the multiple traveling
salesman problem is determined as follows: Given n cities,
known as nodes, a distance matrix where, D= [dij] consist of
the distance between city i and city j. An attempt to finding
near optimal solution for NP-hard problem
Fig. 2: The example of MTSP (initial inputs)
To analyses the new representation of genetic algorithm
using this approach was developed in MATLAB. This
approach is more effective of the two chromosome
technique. It requires input set, coordinates of the cities and
the distance table which contain the traveling distances of
cities. The fitness function simply summarizes the overall
route length for salesman inside individuals.
The section is tournament selection, where tournament size
i.e. the number of individuals who complete for survival is
8. The population size must be divisible by 8. The winner of
the tournament is the member with the smallest fitness, the
individual is selected for new individual creation, and the
member will get into the new population
The winner of the tournament is the member with the
smallest fitness, the individual is selected for new individual
creation, and the member will get into the new population
Fig. 3: mTSP Best history solution
The traveling salesman problem (TSP) is considered for
combinational methods.it provides a standard test bed, to
find near optimal to NP-hard problems.
Problem name Optimal solution Best known value
Att48 33551 42402
Dantiz17 699 770
Fri26 937 1100
Gr17 2085 2200
Ha30 Unknown 513
Kn57 Unknown 14914
Table 1: Simulation results
The test problems were selected from a standard collection
of TSPs that were transformed into MTSPs by using more
than one salesman (m) to complete the tour. The repeated
own tests using the objective of minimizing the longest
individual salesman tour. The fitness values decreases as the
number of salesman increase we are dividing the cities up
among more salesman. This creates a situation where each
salesman visits fewer cities, so the fitness values (improve)
with the addition of more salesmen. The results of these
tests are presented in Fig-3
VI. CONCLUSION
This paper explored a chromosome representation for
multiple traveling salesmen problem. A novel representation
based genetic algorithm has been multiple depot version of
MTSP. The main benefit is transparency of the
representation that allows effective incorporation of
heuristic and constraints and allows easy implementation of
minimizing the cost of the tour. Some heuristics can be
applied to improve the effectiveness of the algorithm,
appropriate choice of the initial population. Moreover, the
characteristics of the mTSP seem more appropriate for real-
life applications, and it is also possible to extend the
problem to a wide variety of vehicle routing problems
(VRPs) by incorporating some additional side constraints.
2 1 1 3 4 3 2 4 4 1 3 2 1 2 3
4. The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm
(IJSRD/Vol. 1/Issue 5/2013/040)
All rights reserved by www.ijsrd.com 1203
REFERENCES
[1] Goldberg, D.E., Lingle, R.J (1985). Alleles, Loci, and
the Traveling Salesman Problem, Proceeding of an
International Conference on Genetic algorithms,
London, 154-159.Goldberg, D.E (1989) Genetic
Algorithms in search, Optimization and machine
Learning, Addison-Wesley.
[2] Reading, MA. Carter AE, Ragsdale CT (2006) A
new approach to solving the Multiple Traveling
Salesperson using genetic algorithm, European
journal of operational research 175:246-257.
[3] Bektas T (2006) The multiple traveling salesman
problem: an overview of formulations and solution
procedures. Omega, 34:209–219
[4] Malmberg CJ (1996) A genetic algorithm for service
level based vehicle scheduling. European Journal of
operational research 93(1):121-134.
[5] Kira’ly A, Abonyi J (excepted to 2010) Optimization
Multiple traveling salesman problem by a novel
representation based genetic algorithm. In
M.Koeppean, G.Sehaefer, A.Abraham, and L.Nolle,
editors, Intelligent computational in Engineering:
Techniques & Applications, Advances in Intelligent
and soft computing. Springer.