Problem-Solving Strategies in Artificial Intelligence" delves into the core techniques and methods employed by AI systems to address complex problems. This exploration covers the two main categories of search strategies: uninformed and informed, revealing how they navigate the solution space. It also investigates the use of heuristics, which provide a shortcut for guiding the search, and local search algorithms' role in tackling optimization problems. The description offers insights into the critical concepts and strategies that power AI's ability to find solutions efficiently and effectively in various domains.
In "Problem-Solving Strategies in Artificial Intelligence," we dive deeper into the foundational techniques and methodologies that AI systems rely on to tackle challenging problems. This comprehensive exploration begins with an in-depth examination of search strategies. Uninformed search strategies, often referred to as blind searches, are dissected, along with informed search strategies that harness domain-specific knowledge and heuristics to guide the search process more intelligently.
The role of heuristics in AI problem-solving is thoroughly investigated. These problem-solving techniques employ domain-specific rules of thumb to estimate the quality of potential solutions, aiding in decision-making and prioritization. The famous A* search algorithm, which combines actual cost and heuristic estimation, is highlighted as a prime example of informed search.
Local search algorithms, another critical component, are discussed in the context of optimization problems. These algorithms excel in finding the best solution within a local neighborhood of the current solution and are particularly valuable for various optimization challenges. You'll explore methods like hill climbing and simulated annealing, which are vital for optimizing solutions in constrained problem spaces.
This insightful exploration provides a comprehensive understanding of the problem-solving strategies employed in AI, offering a solid foundation for those seeking to apply AI techniques to real-world challenges and further the field of artificial intelligence.
Intelligent mobile Robotics & Perception SystemsIntelligent mobile Robotics ...Gouasmia Zakaria
Recent advances in human-robot interaction, complex robotic tasks, intelligent reasoning, and decision-making are, at some extent, the results of the notorious evolution and success of ML algorithms. This chapter will cover recent and emerging topics and use-cases related to intelligent perception systems in robotics.
Problem-Solving Strategies in Artificial Intelligence" delves into the core techniques and methods employed by AI systems to address complex problems. This exploration covers the two main categories of search strategies: uninformed and informed, revealing how they navigate the solution space. It also investigates the use of heuristics, which provide a shortcut for guiding the search, and local search algorithms' role in tackling optimization problems. The description offers insights into the critical concepts and strategies that power AI's ability to find solutions efficiently and effectively in various domains.
In "Problem-Solving Strategies in Artificial Intelligence," we dive deeper into the foundational techniques and methodologies that AI systems rely on to tackle challenging problems. This comprehensive exploration begins with an in-depth examination of search strategies. Uninformed search strategies, often referred to as blind searches, are dissected, along with informed search strategies that harness domain-specific knowledge and heuristics to guide the search process more intelligently.
The role of heuristics in AI problem-solving is thoroughly investigated. These problem-solving techniques employ domain-specific rules of thumb to estimate the quality of potential solutions, aiding in decision-making and prioritization. The famous A* search algorithm, which combines actual cost and heuristic estimation, is highlighted as a prime example of informed search.
Local search algorithms, another critical component, are discussed in the context of optimization problems. These algorithms excel in finding the best solution within a local neighborhood of the current solution and are particularly valuable for various optimization challenges. You'll explore methods like hill climbing and simulated annealing, which are vital for optimizing solutions in constrained problem spaces.
This insightful exploration provides a comprehensive understanding of the problem-solving strategies employed in AI, offering a solid foundation for those seeking to apply AI techniques to real-world challenges and further the field of artificial intelligence.
Intelligent mobile Robotics & Perception SystemsIntelligent mobile Robotics ...Gouasmia Zakaria
Recent advances in human-robot interaction, complex robotic tasks, intelligent reasoning, and decision-making are, at some extent, the results of the notorious evolution and success of ML algorithms. This chapter will cover recent and emerging topics and use-cases related to intelligent perception systems in robotics.
Swarm intelligence is a modern artificial intelligence discipline that is concerned with the design of multiagent systems with applications, e.g., in optimization and in robotics. The design paradigm for these systems is fundamentally different from more traditional approaches.
Knowledge representation and reasoning (KR) is the field of artificial intelligence (AI) dedicated to representing information about the world in a form that a computer system can utilize to solve complex tasks such as diagnosing a medical condition or having a dialog in a natural language
Mathematical Functions
Types of functions
Activation function
Laws of activation function
Types of Activation functions
Limitations of activation function
Swarm intelligence is a modern artificial intelligence discipline that is concerned with the design of multiagent systems with applications, e.g., in optimization and in robotics. The design paradigm for these systems is fundamentally different from more traditional approaches.
Knowledge representation and reasoning (KR) is the field of artificial intelligence (AI) dedicated to representing information about the world in a form that a computer system can utilize to solve complex tasks such as diagnosing a medical condition or having a dialog in a natural language
Mathematical Functions
Types of functions
Activation function
Laws of activation function
Types of Activation functions
Limitations of activation function
SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATIONFransiskeran
Successful applications coming from biologically inspired algorithm like Ant Colony Optimization (ACO)
based on artificial swarm intelligence which is inspired by the collective behavior of social insects. ACO
has been inspired from natural ants system, their behavior, team coordination, synchronization for the
searching of optimal solution and also maintains information of each ant. At present, ACO has emerged as
a leading metaheuristic technique for the solution of combinatorial optimization problems which can be
used to find shortest path through construction graph. This paper describe about various behavior of ants,
successfully used ACO algorithms, applications and current trends. In recent years, some researchers
have also focused on the application of ACO algorithms to design of wireless communication network,
bioinformatics problem, dynamic problem and multi-objective problem.
Performance Evaluation of Different Network Topologies Based On Ant Colony Op...ijwmn
All networks tend to become more and more complicated. They can be wired, with lots of routers, or wireless, with lots of mobile node. The problem remains the same, in order to get the best from the network; there is a need to find the shortest path. The more complicated the network is, the more difficult it is to manage the routes and indicate which one is the best. The Nature gives us a solution to find the shortest path. The ants, in their necessity to find food and brings it back to the nest, manage not only to explore a vast area, but also to indicate to their peers the location of the food while bringing it back to the nest. Most of the time, they will find the shortest path and adapt to ground changes, hence proving their great efficiency toward this difficult task. The purpose of this paper is to evaluate the performance of different network topologies based on Ant Colony Optimization Algorithm. Simulation is done in NS-2.
Swarm Intelligence: An Application of Ant Colony OptimizationIJMER
Swarm intelligence, a branch of artificial intelligence is a part which discusses the collective
behaviour of social animals such as ants, fishes, termites, birds, bacteria. The collective behaviour of
animals to achieve target can be used in practical applications. One of the applications is ant colony
optimization. Ongoing research of ACO, there are diverse applications namely data mining, image
processing, power electronic circuit design etc. One of that is network routing. By using ACO, we can
find the shortest path in network routing
This Presentation were Made By BugsBusters team from faculty of Computers and information, Helwan University - Egypt
IMPORTANT NOTE !!!
Do not view this online or it will not be compatible Download it to view videos and see original slides :))
Swarm intelligence systems often comprise a population of essential agents interacting locally with one another and their surroundings. Again, nature, particularly biological systems, is a frequent source of inspiration. Although no centralized control structure dictates how individual agents should behave, local and, to some extent, random interactions between such agents create "intelligent" global behaviour unknown to the respective agents.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
3. Swarm Intelligence General
Characteristics
Composed of many individuals
Individuals are homogeneous
Local interaction based on simple rules
Self-organization
Constituting a natural model particularly
suited to distributed problem solving
4. Swarm Intelligence General
Characteristics
Collective system capable of accomplishing
difficult tasks in dynamic and varied
environments without any external guidance or
control and with no central coordination
Achieving a collective performance which could
not normally be achieved by an individual acting
alone
Constituting a natural model particularly suited
to distributed problem solving
9. Ant Colony System
First introduced by Marco Dorigo in 1992 as a
method for solving hard combinatorial
optimization problems (COPs).
Progenitor to “Ant Colony System,” later
discussed
Result of research on computational intelligence
approaches to combinatorial optimization
Originally applied to Traveling Salesman
Problem
Applied later to various hard optimization
problems
11. Real Ant actual scenario
Almost blind.
Incapable of achieving complex tasks alone.
Rely on the phenomena of swarm intelligence for
survival.
Capable of establishing shortest-route paths from
their colony to feeding sources and back.
Use stigmergic communication via pheromone trails.
Follow existing pheromone trails with high
probability.
What emerges is a form of autocatalytic behavior:
the more ants follow a trail, the more attractive that
trail becomes for being followed.
12. Real Ant actual scenario
The process is thus characterized by a positive
feedback loop, where the probability of a
discrete path choice increases with the number
of times the same path was chosen before.
13. Natural behavior of an ant :
Foraging modes
Wander mode
Search mode
Return mode
Attracted mode
Trace mode
Carry mode
14. Behavior of Ant colony
regulation of nest temperature within 1 degree celsius
range;
forming bridges;
raiding specific areas for food;
building and protecting nest;
sorting brood and food items;
cooperating in carrying large items;
emigration of a colony;
finding shortest route from nest to food
source;
preferentially exploiting the richest food source
available.
15. Autocatalyzation
Autocatalysis is a positive feedback
loop that drives the ants to explore
promising aspects of the search space
over less promising areas.
16. A key concept: Stigmergy
Stigmergy is: indirect communication via
interaction with the environment.
A problem gets solved bit by bit ..
Individuals communicate with each other in the
above way, affecting what each other does on the
task.
Individuals leave markers or messages – these
don’t solve the problem in themselves, but they
affect other individuals in a way that helps them
solve the problem.
17. Stigmergy in Ants
Ants are behaviourally unsophisticated, but
collectively they can perform complex tasks.
Ants have highly developed sophisticated sign-
based stigmergy.
– They communicate using pheromones;
– They lay trails of pheromone that can be
followed by other ants.
18. Pheromone Trails
Individual ants lay pheromone trails while travelling
from the nest, to the nest or possibly in both
directions.
The pheromone trail gradually evaporates over time.
But pheromone trail strength accumulate with
multiple ants using path.
Food source
Nest
23. ACO Algorithms: Basic Ideas
Ants are agents that: Move along between nodes in a
graph.
They choose where to go based on pheromone
strength (and maybe other things)
An ant’s path represents a specific candidate solution.
When an ant has finished a solution, pheromone is laid
on its path, according to quality of solution.
This pheromone trail affects behaviour of other ants
by `stigmergy’
24. Artificial Ants
• artifcial ants may simulate pheromone
laying by modifying appropriate pheromone
variables associated with problem states
they visit while building solutions to the
optimization problem. Also, according to the
stigmergic communication model, the
artifcial ants would have only local access
tothese pheromone variables.
25. Artificial Ants
Main characteristics of stigmergy can be extended to
artificial agents by
• Associating state variables with different problem
states; and
• Giving the agents only local access to these
variables.
• Coupling between the autocatalytic mechanism
and the implicit evaluation of solutions
• Just like real ants, artificial ants create their
solutions sequentially by moving from one
problem state to another
26. Differences between real and artificial
ants:
Artificial ants live in a discrete world| they move
sequentially through a finite set of problem states.
The pheromone update (i.e., pheromone
depositing and evaporation) is not accomplished
in exactly the same way by artificial ants as by real
ones. Sometimes the pheromone update is done
only by some of the artificial ants, and often only
after a solution has been constructed.
Some implementations of artificial ants use
additional mechanisms that do not exist in the
case of real ants. Examples include look-ahead,
local search, backtracking, etc.
28. SHORTEST PATH
Ants deposit pheromones on ground that form
a trail. The trail attracts other ants.
Pheromones evaporate faster on longer paths.
Shorter paths serve as the way to food for
most of the other ants.
30. General ACO
• A stochastic construction procedure
• Probabilistically build a solution
• Iteratively adding solution components to partial
solutions
- Heuristic information
- Trace/Pheromone trail
• Reinforcement Learning reminiscence
• Modify the problem representation at each
iteration
• Ants work concurrently and independently
• Collective interaction via indirect communication
leads to good solutions
31. Some inherent advantages
• Positive Feedback accounts for rapid
discovery of good solutions
• Distributed computation avoids premature
convergence
• The greedy heuristic helps find acceptable
solution in the early solution in the early
stages of the search process.
• The collective interaction of a population of
agents.
32. Disadvantages in Ant Systems
Slower convergence than other Heuristics
Performed poorly for TSP problems larger
than 75 cities.
No centralized processor to guide the AS
towards good solutions
33. Ant System (AS) Algorithm
1. Initialization
2. Randomly place ants
3. Build tours
4. Deposit trail
5. Update trail
6. Loop or exit
34. Ant with Binary Bridge
• Let the amount of pheromone on a branch be proportional
to the number of ants that used the branch in the past and
let ms(t) and ml(t) be the numbers of ants that have used
the short and the long branches after a total of t ants have
crossed the bridge, with ms(t) þ ml(t) =t.The probability
ps(t) with which the (t+1) th ant chooses the short branch
can then be written as
35. Ant with Binary Bridge
The number of ants choosing the short branch is
given by
The number of ants choosing the long branch by
where q is a uniform random number drawn from the interval [0; 1].
Mote Carlo Simulation method will give good solution
39. ACO system -PSEUDOCODE
Often applied to TSP (Travelling Salesman Problem):
shortest path between n nodes
Algorithm in Pseudocode:
– Initialize Trail
– Do While (Stopping Criteria Not Satisfied) – Cycle Loop
• Do Until (Each Ant Completes a Tour) – Tour Loop
• Local Trail Update
• End Do
• Analyze Tours
• Global Trail Update
– End Do
40. ACO Algorithm
• Ant Colony Algorithms are typically use to solve
minimum cost problems.
• We may usually have N nodes and A undirected arcs
• There are two working modes for the ants: either
forwards or backwards
• The ants memory allows them to retrace the path it
has followed while searching for the destination node
• Before moving backward on their memorized path,
they eliminate any loops from it. While moving
backwards, the ants leave pheromones on the arcs
they traversed.
41. ACO Algorithm
• At the beginning of the search process, a constant amount of
pheromone is assigned to all arcs. When located at a node i an
ant k uses the pheromone trail to compute the probability of
choosing j as the next node:
where is the neighborhood of ant k when in node i.
42. ACO Algorithm
k
ij ij
• When the arc (i,j) is traversed , the pheromone value changes
as follows:
• By using this rule, the probability increases that forthcoming
ants will use this arc.
• After each ant k has moved to the next node, the pheromones
evaporate by the following equation to all the arcs:
(1 ) , ( , )
ij ij
p i j A
43. Steps for Solving a Problem by ACO
1. Represent the problem in the form of sets of
components and transitions, or by a set of weighted
graphs, on which ants can build solutions
2. Define the meaning of the pheromone trails
3. Define the heuristic preference for the ant while
constructing a solution
4. If possible implement a efficient local search
algorithm for the problem to be solved.
5. Choose a specific ACO algorithm and apply to
problem being solved
6. Tune the parameter of the ACO algorithm.
44. Combinatorial optimization
• Find values of discrete variables
• Optimizing a given objective function
Π = (S, f, Ω) – problem instance
S – set of candidate solutions
f – objective function
Ω – set of constraints
set of feasible solutions (with respect to Ω)
Find globally optimal feasible solution s*
45. Combinatorial optimization
problem mapping
• Combinatorial problem (S, f, Ω(t))
• Ω(t) – time-dependent constraints
Example – dynamic problems
• Goal – find globally optimal feasible solution
s*
• Minimization problem
• Mapped on another problem
46. Combinatorial optimization
problem mapping
• C = {c1, c2, …, cNc} – finite set of
components
• States of the problem:
X = {x = <ci, cj, …, ch, …>, |x| < n < +∞}
• Set of candidate solutions:
49. Combinatorial optimization
problem mapping
• Cost g(s, t) for each
• In most cases – g(s, t) ≡ f(s, t)
• GC = (C, L) – completely connected graph
• C – set of components
• L – edges fully connecting the components
(connections)
• GC – construction graph
• Artificial ants build solutions by performing
randomized walks on GC(C, L)
50. ACO for Traveling Salesman Problem
The first ACO algorithm was called the Ant system and
it was aimed to solve the travelling salesman problem,
in which the goal is to find the shortest round-trip to
link a series of cities. At each stage, the ant chooses to
move from one city to another according to some
rules:
It must visit each city exactly once;
A distant city has less chance of being chosen (the visibility);
The more intense the pheromone trail laid out on an edge between
two cities, the greater the probability that that edge will be chosen;
Having completed its journey, the ant deposits more pheromones
on all edges it traversed, if the journey is short;
After each iteration, trails of pheromones evaporate.
51. ACO for Traveling Salesman Problem
TSP PROBLEM : Given N cities, and a distance function d between cities,
find a tour that:
1. Goes through every city once and only once
2. Minimizes the total distance.
52. HOW TO IMPLEMENT IN A PROGRAM
• Ants: Simple computer agents
• Move ant: Pick next component in the const. solution
• Pheromone:
• Memory: MK or TabuK
• Next move: Use probability to move ant
• Graph (N,E): where N = cities/nodes, E = edges
• = the tour cost from city i to city j (edge weight)
• Ant move from one city i to the next j with some transition probability.
53. A simple TSP example
A
D
C
B
1
[]
4
[]
3
[]
2
[]
dAB =8;dBC = 4;dCD =15;dDA =6
53
59. Path and Pheromone Evaluation
1
[A,B,C,D
L1 =27
L2 =25
L3 =29
L4 =18
2
[B,C,D,A]
3
[C,D,A,B]
4
[D,A,B,C]
59
Best tour
60. MAX–MIN Ant System
• MAX–MIN Ant System (MMAS) (Stu¨ tzle & Hoos,
1997, 2000; Stu¨ tzle, 1999) introduces four main
modifications with respect to AS. First, it strongly
exploits the best tours found: only either the
iteration-best ant, that is, the ant that produced
the best tour in the current iteration, or the best-
so-far ant is allowed to deposit pheromone.
Unfortunately, such a strategy may lead to a
stagnation situation in which all the ants follow
the same tour, because of the excessive growth of
pheromone trails on arcs of a good, although
suboptimal, tour.
61. MAX–MIN Ant System
• To counteract this effect, a second modification
introduced by MMAS is that it limits the possible
range of pheromone trail values to the interval
[Ʈmin; Ʈmax]. Third, the pheromone trails are
initialized to the upper pheromone trail limit,
which, together with a small pheromone
evaporation rate, increases the exploration of
tours at the start of the search. Finally, in MMAS,
pheromone trails are reinitialized each time the
system approaches stagnation or when no
improved tour has been generated for a certain
number of consecutive iterations.
62. Greedy Search Algorithm
• A greedy algorithm is an algorithm that
follows the problem solving heuristic of
making the locally optimal choice at each
stage[1] with the hope of finding a global
optimum. In many problems, a greedy
strategy does not in general produce an
optimal solution, but nonetheless a greedy
heuristic may yield locally optimal solutions
that approximate a global optimal solution
in a reasonable time.
63. Greedy Search Algorithm
• For example, a greedy strategy for the
traveling salesman problem (which is of a
high computational complexity) is the
following heuristic: "At each stage visit an
unvisited city nearest to the current city".
This heuristic need not find a best solution,
but terminates in a reasonable number of
steps; finding an optimal solution typically
requires unreasonably many steps. In
mathematical optimization, greedy
algorithms solve combinatorial problems
having the properties of matroids.
64. Constructive Heuristics
• Start from an “empty solution”
• Repeatedly, extend the current solution until a
complete solution is constructed
• Use heuristics to try to extend in such a way that
the final solution is a good one
It is essential to know the difference between:
• Constructive methods
Extend empty solution until get complete
solution
• Local search
Take complete solution and try to improve it
via local moves