...Ant Colony Optimization 1 A Seminar Report on “Ant Colony Optimization” A Seminar submitted in partial fulfilment of the requirements for the award of degree BACHELOR OF TECHNOLOGY In COMPUTER SCIENCE ENGINEERING Presented By Ranjith Kumar A (06J11A0534) Department of computer science engineering HITECH COLLEGE OF ENGG & TECHNOLOGY (Affiliated to Jawaharlal Nehru Technological University, Hyderabad) Himayathnagar, C.B.Post, Moinabad, Hyderabad-5000 2 075. CERTIFICATE This is to certify that the Seminar Report on “Ant Colony Optimization”, is a bonafide Seminar work done by Ranjith Kumar A (06J11A0534), in partial fulfillment for the award of the degree Bachelor of Technology in “Computer Science engineering” J.N.T.U Hyderabad during the year 2010. Y.V.S Pragathi M.Tech Head of CSE Department 3 Abstract Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build solutions step by step adding solution components that are represented by graph nodes. The existing ACO algorithms are suitable when the graph is not very large (thousands of nodes) but is not useful when the graph size can be a challenge for the computer memory and cannot be completely generated or stored in it. In this paper we study a new ACO model that overcomes the difficulties found when working with a huge construction graph. In addition to the description...
Words: 5585 - Pages: 23
...UNIVERSITY OF VIENNA Faculty of Business, Economics and Statistics Department of Business Administration 040661 KFK PM/SCM/TL: Seminar B (E) WS /2014 Stochastic Vehicle Routing Problem with Restocking Professor : O.Univ.Prof.Dr. Richard Hartl Vienna,2014 Student: Shkodran Ahmeti 0851254 Table of contents Table of contents List of figures 1.Introduction 1.2. Problem Presentation 2. Stochastic Vehicle Routing Problem With Optimal Restocking 3. Single Vehicle Routing Problem 4. Multiple Vehicle Routing 4.1. Heuristic Algorithms 4.1.1. Route-First-Cluster-Next Heuristic Algorithm 4.1.2. Cluster-First- Route- Second Algorithm 4.1.3. Improving the Heuristic Solution 5. Computational Study and Results 5.1. Set – partitioning problem formulation 5.2.Test of Algorithms over Problem Sizes and Expected Route Length Limits 5.3. Comparison of the Algorithms over Demand Variations 5.4. Comparison with a Deterministic Method 6. Summary References List of figures Figure 1 A desired truck route with restocking action of returning to the depot when a stockout occurs or in anticipation of a stockout Figure 2 The two updating Strategies a and b Figure 3 Defined or particular route of a single vehicle Figure 4 Expected costs of going directly to the next node Figure 5 Expected costs of the restocking action Figure 6 Monotonicity of function fj(q) Figure 7 Choosing the unused vehicle Figure 8 Forming the clusters Figure 9 Routing through the clusters Figure 10 Cyclic transfer...
Words: 5634 - Pages: 23
...Graphing Applications and the TSP Name: Institution: Graphing Applications and the TSP Question 1 A Hamiltonian cycle is a closed loop within a graph that visits all its vertices exactly once. An example of the Hamiltonian cycle is the Travelling salesman problem. The solution to the minimum length of a Hamiltonian cycle is an NP complete problem that cannot be computed in polynomial time. This means that the minimum possible path cannot be computed by a deterministic machine. When completing a Hamiltonian cycle, one has to make sure that there are only two edges getting in and out of a vertex. In addition one has to ensure that there are no sub-cycles in the cycle. In a Hamiltonian cycle with n vertices, the number of different cycles that can be completed is (n-1)! /2 in a complete undirected graph and (n-1)! In a complete directed graph (Narasimhan, 2009). Question 2 A Euler cycle is a path that passes through all the edges of a graph exactly once. It usually starts and ends at the same vertex. For one to construct a Euler cycle all the vertices in the graph must have an even degree. Therefore, one can conclude that any graph with all vertices of an even degree connected is a Euler cycle. Unlike the Hamiltonian cycle, the Euler cycle can be computed in polynomial time. The Euler cycle can be constructed using the Fleury’s or Hierholzer’s algorithm. Question 3 The minimum length of a Hamiltonian cycle is the shortest path that can...
Words: 1227 - Pages: 5
...Six Sigma, Lean, and Kaizen J. Paul Seiberlich Siena Heights University Prof. Anderson February 5, 2015 Kaizen and Six Sigma are associated with the Quality Model for achieving success in business. The term Kaizen has many different uses ranging from referring to a principle of personal conduct to a company wide strategy for achieving business success (Imai, 1986). In the United States, one of its most common uses is as the name of a lean enterprise tool for improving work processes. In this use, it refers to a systematic and specialized application of problem solving to uncover and extract waste from a work process. Kaizen as a company wide strategy for achieving business success is derived from the writings of W. Edwards Deming although the completeness of that connection seems to be unrecognized. It abstracts from Deming’s work the ideas that improvements must benefit customers; that they must occur every day, everywhere, and be implemented by everyone; that management must lead the implementation and that managers must be models and agents of its adoption; and that management and non-management employees must operate cooperatively. (Vitalo, R. 2013) The term “Kaizen” has two uses. One use refers to the principle of continuous improvement and describes a fundamental element in the Quality Model and in Lean thinking. The second use refers to methods that either suggest (e.g., Teian Kaizen) or generate and implement improvement ideas. Of the methods...
Words: 641 - Pages: 3
...“Creating Lean Suppliers” a Consider that the new corporate procurement strategy in support of your manufacturing business includes securing purchased critical parts and subassemblies from “lean” practicing suppliers. Your supply chain management in previous years has practiced the strategy of single sourcing as well as long-term partnering for critical purchased material. Prepare a list of bullets showing the advantages and disadvantages of staying with current suppliers (i.e. not switching) that currently do not have a “lean” in place and also define in the response your plan to achieve the new “lean” supplier requirement. I Advantage: * Better relationship – further involved in new production process * Better reputation (ethics) * Knowing the supplier better – its problems, cost-structure, and technology * Supplier may be more responsive * Creating “trust” II Disadvantage: * Cost of the BP team * Require extensive capital investment or extra personnel for suppliers * Time consuming (for the suppler to be lean) * Difficulty to change and sustain In order to achieve the new “lean” supplier requirement, I would want suppliers that have substantial responsibility during product development; the ability to accommodate and respond to the request of changes in product or manufacturing process; extensive capital investment or extra human resources. Also the suppliers that is reliable, and “self-reliant.” b Analyze Honda’s...
Words: 1010 - Pages: 5
...Final Case Submission: Avion Inc. 1. What parts of the supply chain are most closely involved with the situation in this case? What is the responsibility of each part in order to maintain a smooth flow of material? Procurement and Contracts: Should be responsible to amend the agreement that clearly defines what the service level requirements are, sets out the change control mechanism, the communication protocol and representative of both parties and review the agreement in conjunction with the supplier to remove any ambiguity. Category Management: Should be responsible for developing a SQM that will allow provide both parties with a forum to work in partnership and set targets and KPIs. Material Management: Should be responsible to understand the required and forecast inventory stocks and coordinate accordingly. Logistics: Should be responsible for transporting the product through the supply chain. 2. What initially appears to be the problem? What really is the problem(s) in this case? The problem initially appears to be that the vendor is not meeting the expected performance level required by the customer. However the problem is not with the vendor rather within Avion. It appears that the company does not have appropriate cross function engagement, rather working in silos. There is no obvious communication structure whereby the SCM understands the scope requirements and can translate this to the vendor. Also following contract award it is not clear what...
Words: 672 - Pages: 3
...Demo Script Parallel Computing on Azure - Travelling Salesman Demo Demo version: 1.0.0 Last updated: 12/7/2011 Contents Overview 3 Key Messages 4 Key Technologies 4 Prerequisites 4 Time Estimates 5 Setup and Configuration 6 Demo Flow 7 Opening Statement 9 Step-by-Step Walkthrough 10 Segment #1: Scaling-Up Windows Azure Applications using a Single Instance 10 Segment #2: Scaling-Out Windows Azure Applications using Multiple instances 17 Summary 24 * Overview This demo highlights how to scale-up Web Applications on Windows Azure, using the .NET Task Parallel Library (TPL) classes from .NET Framework 4.0. This library efficiently utilizes multiple processors within Windows Azure roles, where the size of the Virtual Machine instance is greater than Small (i.e. where there are multiple processors available). Additionally, the demo shows how to scale-out applications taking advantage of Technical Computing across multiple role instances, using a Job scheduling algorithm. The work is distributed to all the available instances, maximizing the CPU processing of each. Travelling Salesman demo is using a “genetic” algorithm to quickly solve the problem that would ordinarily require very many conventional interactions to solve. The problem and its real–life applications are widely documented (for example, see http://www.tsp.gatech.edu/index.html). The algorithm used in this demo was taken from http://www.heatonresearch.com/online/introduction–neural–networks–cs–edition–2/chapter–6...
Words: 3071 - Pages: 13
...World Academy of Science, Engineering and Technology Vol:7 2013-06-25 Optimization Using Simulation of the Vehicle Routing Problem International Science Index Vol:7, No:6, 2013 waset.org/Publication/15351 Nayera E. El-Gharably, Khaled S. El-Kilany, and Aziz E. El-Sayed Keywords—Discrete event system simulation, optimization using simulation, vehicle routing problem. points or require a solution to be found quickly. Computational time on the fastest computers for optimization methods has been too long for many practical problems. Cognitive, heuristic, or combination heuristic-optimization solution procedures have been good alternatives [8]. The aim of this work is threefold; to present a new mathematical formulation of the VRP problem that uses fewer decision variables, to show how to model the TSP problem as a discrete event simulation model, and to employ the developed simulation model in finding the optimum/near optimum solution of the problem. This paper is organized as follows: in Section II, the basic concepts of VRP and the solution techniques found in literature will be briefly discussed. In Section III, proposed problem formulations will be presented followed by the simulation model development and optimization using simulation in sections IV and V. Finally, in section VI, the conclusions drawn from this work are presented. I. INTRODUCTION II. LITERATURE REVIEW HE vehicle routing problem (VRP) is one of the most intensively studied problems in operations research...
Words: 4604 - Pages: 19
...ADVANCED OPERATION RESEARCH ASSIGNMENT OF O.R. METHODOLOGY DEVELOPMENT DEVELOPMENT OF TRANSPORTATION METHODOLOGY IN OPERATION RESEARCH “PENGEMBANGAN METODE TRANSPORTASI DALAM OPERASI PENELITIAN” TYPE II – COMPARE & CONTRAST IQBAL TAWAKKAL - 1506694736 PROGRAM MAGISTER TEKNIK INDUSTRI - SALEMBA UNIVERSITAS INDONESIA 1. INTRODUCTION A special class of linear programming problem is Transportation Problem, where the objective is to minimize the cost of distributing a product from a number of sources (e.g. factories) to a number of destinations (e.g. warehouses) while satisfying both the supply limits and the demand requirement. Because of the special structure of the Transportation Problem the Simplex Method of solving is unsuitable for the Transportation Problem. The model assumes that the distributing cost on a given rout is directly proportional to the number of units distributed on that route. Generally, the transportation model can be extended to areas other than the direct transportation of a commodity, including among others, inventory control, employment scheduling, and personnel assignment. Transportation was one of the earliest application areas of operations research, and important transportation problems, such as the traveling salesman problem, vehicle routing problem, and traffic assignment problem, contributed to fundamental knowledge in operations research. Transportation remains one of the most important and vibrant areas of operations...
Words: 2523 - Pages: 11
...A Library of Local Search Heuristics for the Vehicle Routing Problem Chris Gro¨r1 e Oak Ridge National Laboratory, 1 Bethel Valley Rd, Oak Ridge, TN 37831 cgroer@gmail.com Bruce Golden R.H. Smith School of Business, University of Maryland, College Park, MD 20742, USA, bgolden@rhsmith.umd.edu Edward Wasil2 Kogod School of Business, American University, Washington, DC 20016, USA, ewasil@american.edu The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, straightforward to compile, and is freely available online. The code contains several applications that can be used to generate solutions to the capacitated VRP. Computational results indicate that these applications are able to generate solutions that are within about one percent of the best-known solution on benchmark problems. Key words: vehicle routing;...
Words: 10780 - Pages: 44
...Introduction TSP (Travelling salesman problem) is an optimization problem that it is difficult to solve using classical methods. Different Genetic Algorithm (GA) have been right to solve the TSP each with advantages and disadvantages (Davis, 2005) In this research paper, I highlight a new algorithm by merging different genetic Algorithm results to the better solution for TSP. In amalgam algorithm, appropriateness of algorithm and traveled distance for TSP has been considered. Results obtained suggest that it does not quickly establish in the local optimum and enjoys a good speed for an inclusive answer (Fogel, 2010). New methods such as GAs, refrigeration algorithms, Artificial Neural Networks, and ACO (Ant Colony Optimization) to solve TSP problem, in recent past have been suggested. Both ACO and GAs is centered on repetitive (Goldenberg, 2005) ACO system was unfilled for the first time by Dorigoat al. to solve TSP. In ACO algorithms, people work together to find the solution. In collective intelligence algorithms, it uses the real life of creatures without putting in consideration the complex mechanisms in run their day to day life in all aspects as best as possible. GA is an iterative procedure that contains a population of individuals or chromosomes. Coding of randomly or heuristic by a string of symbols as a gene in possible solution is done. All possible solution in this search space is examined. When search space is large, GAs usually are used. People can select an...
Words: 3446 - Pages: 14
...Have you ever had that feeling that you just know it’s right but you can’t explain why? It’s like bigger than a ‘gut-feeling’, it just sounds right in your mind. Although, you can’t really explain why, it’s quite confusing really. I’ll try my best to let you understand this feeling for you. For me, I was born in Gothenburg, a small, quiet place in Sweden. I had the pleasure of living there for nine years, I never really at the time thought what an amazing place it really is. I’m not trying to say it has everything because it doesn’t - it just feels like home to me. It’s where I was born and raised. When you’re born somewhere and live there for quite a long time, you genuinely start to make a connection with it. It sounds really silly, but if you move country, the connection you had with that place will become a lot more apparent. As if your whole life, your heart is developing a special, strong bond with that place, you just don’t know it until you’re gone. I remember how at the age of seven (when you start school in Sweden), I would take a bus and a train, I loved this, it made me feel really independent, as if my parents had built that faith in me. I felt like I really deserved it, I felt like an adult. It was a total of forty-five minutes journey to school, by myself. At the time, I didn’t think that was a big deal, everyone did that. When all your surroundings have the same routine as you, it’s as if that small, precious thing isn’t really that valued anymore. You...
Words: 1143 - Pages: 5
...to follow the path wherever I go. You were the one who never gave up on me, You are the one who loved me truly. You are always there to guide me, You made my wishes come into reality. Mother I never thought living in this place, but for her, I am their cute received grace. In God, she always prays, to have a child a little bit same as her face. She never got tired of telling me, the person she wanted me to be. She never gave up on me, even if I am a brat dummy. She wants us to be together, sharing thoughts with each other. I will never find another, Cause she's the only person I can "Mother". Moving On It's really hard to say goodbye, to my one and only guy. It's really hard to tell a lie, when my friends will ask me why. My tears came running down, it can even make the people drown. And sadly I didn't have the crown, to be the girl he'll be proud of in our town. Time is running fast, but my love for him didn't last. All I remember is our past, but forgetting him is a must. Moving on is what I will do,...
Words: 643 - Pages: 3
...second glance is a college student whose face is peeling due to the excessive amount of makeup covering her entire face. She is already starting to talk like she is a forty year smoker. I just saw her outside with a full 12oz. that she was rapidly finishing in order to get herself to as many of us young people would put it, “On Her Level”. I keep walking and feel my feet sticking to the floor with every step from the spilled 12oz., that someone spilled earlier in the night and has now dried up and become ant infested. As I pass the sticky ground, I make my way up the crowded stairs, trying to pass two people who have both of their arms around their friend, who is stumbling down the stairs due to her intoxication level. I think to myself “Why?” As I squeeze past the three of them. Many with...
Words: 818 - Pages: 4
...where Maggie put the envelopes? 3.We need to print 200 newsletters this week—even more than last week! 4.Wow! 5.Randy looked at the ground, and sighed,it was all he could do. 6.The Train leaves in an hour;but you need to buy the tickets first! Write a letter to a friend about a movie you have seen or a book you have recently read. Dear Lindsay, I just read The hunger Games and Catching Fire, I cant believe I did it !They are so amazing,and good .I honestly recommend them to you; you like things like that action , horror, sci-fi and futuristic books .So I wonder why haven't recommended them to you before? Katniss is my new hero, Because even tho she got into trouble—didn’t expect to become such a role model in all of the district to cause that massive rebellion. This is some of the reasons why you should read them : They are a action packed intense ride, leaves you to wonder why do they do what they do, they have so much suspense , and leave you wanting more. Hope this has you pumped to read them love you miss you best friend. Sincerely,...
Words: 320 - Pages: 2
