Travelling salesman problem

Decent Essays
Improved Essays
Superior Essays
Great Essays
Brilliant Essays
    Page 1 of 50 - About 500 Essays
  • Improved Essays

    The travelling salesman problem sets up a benchmark for comparison test for different computational methods. Even though the problem is easily expressed, its solution is computationally difficult. A salesperson has a task to take a closed round tour of a mentioned number of cities. All these mentioned cities are connected to each other by means of roads and a criterion of Hamilton is that, each city can be visited only once. The main aim of program is to obtain minimum optimal tour length by the optimization of given problem. In order to do this, once can change the order in which cities are being traversed. N is the total number of given cities, and every city is assigned with an ordinal number from 1 to N. Brief history: This travelling…

    • 864 Words
    • 4 Pages
    Improved Essays
  • Improved Essays

    ALGORITHM AND GENETIC ALGORITHM IN SOLVING TRAVELLING SALESMAN PROBLEM Ajaz Ahmed Khan Electronics and communication department SSGI FET Bhilai, India ajz70277@gmail.com Mrs. Himani Agrawal Electronics and communication department SSGI FET Bhilai, India Abstract—In this paper, we have used two algorithms, i.e. the Nearest Neighbor algorithm and Genetic Algorithm to solve the Travelling Salesman problem. The Travelling Salesman problem is a widely studied problem in…

    • 1906 Words
    • 8 Pages
    Improved Essays
  • Improved Essays

    manufacturing plants or central depots through the transportation network to consumers. It is an expensive function, especially for the industries involving distribution. The Operational Research literature has addressed this problem by calling it as the vehicle routing problem (VRP). Vehicle scheduling or vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem. The Travelling Salesman Problem (TSP) was introduced much before the Vehicle Routing…

    • 1806 Words
    • 8 Pages
    Improved Essays
  • Superior Essays

    In this project, Vehicle Routing Problem (VRP) is studied. VRP is an NP-hard combinatorial optimization problem. It appears in a large number of real world situations, such as transportation of people and products, delivery services, garbage collection etc. It can be applied everywhere, for vehicles, trains, plains; that is why Vehicle Routing Problem is of great practical importance in real life. The Vehicle Routing Problems (VRPs) are the ones concerning the distribution of goods between…

    • 1702 Words
    • 7 Pages
    Superior Essays
  • Improved Essays

    “What you watch is yourself, struggling against the fate you made for yourself” (Kazan 198). “…To me, the tragedy of Willy Loman is that he gave his life, or sold it, in order to justify the waste of it” (miller 14). Arthur Miller’s first version of Death of a Salesman was a short story which he wrote in his seventeen, Miller in his own words said that this story based on a real man who thrown himself under a train, after that Miller in his autobiography admit that he found the inspiration of…

    • 1051 Words
    • 5 Pages
    Improved Essays
  • Great Essays

    Travelling Salesman Problem (using SA and GA) Authors : IIT2015508, ITM2015006, IIT2015507, IIT2015131, IIT2015138 Under Guidance of : Dr. Vrijendra Singh Abstract — TSP is an NP complete problem, presently there is no polynomial solution available. In this paper we try to solve this very hard problem using various heuristics such as Simulated Annealing, Genetic Algorithm to find a near optimal solution as fast as possible. We try to escape the local optimum,…

    • 1698 Words
    • 7 Pages
    Great Essays
  • Great Essays

    Arthur Miller is known for addressing serious social issues in his plays. His Death of a Salesman reflects the American society of the times in which it was written. The main character, Willy Loman is the victim of the American dream that makes him strongly believe in the possibility of attaining wild and grand success in a land of immense possibilities. Willy takes his own life in his vain pursuit of success. Death of a Salesman met with instant success when it was first staged in 1940’s, as…

    • 1643 Words
    • 7 Pages
    Great Essays
  • Superior Essays

    Two of literature’s greatest tragedies, Thomas Hardy’s Tess of the D’Urbervilles and Arthur Miller’s Death of a Salesman follow the lives of two memorable characters. Hardy’s Tess Durbeyfield is a young, beautiful peasant. Miller’s Willy Loman is an old, worn-out salesman. Although on the surface it does not seem so, Tess and Willy’s stories follow similar formats. They both have singular moments that drive the rest of their lives. Tess’s being when she was raped and Willy’s his extramarital…

    • 1281 Words
    • 5 Pages
    Superior Essays
  • Decent Essays

    As a response to your request to investigate the moisture buildup in the master bedroom at unit 5203 Pointmeadows place condominium, a licensed building contractor was sent to inspect your unit. The contractor removed the drywall and insulation above the window in order to find the source of the water intrusion. All areas around the window were found to be dry and in original condition with no sign of intrusion in the outer wall. A couple of photos are included. The contractor believes…

    • 270 Words
    • 2 Pages
    Decent Essays
  • Improved Essays

    Superior Filament Case

    • 861 Words
    • 4 Pages

    Observations made were that the high costs and inconsistencies in the plastics quality are the main problems for Superior Filament. Seeing this shows that Superior Filament needs to find a way to obtain these plastics themselves, but it has to have an efficient cost. One idea is for Superior Filament to set up donation bins around grocery stores and the campus to collect empty water bottles. For the grocery stores, Superior Filament would place the bins by the can recycling center to collect…

    • 861 Words
    • 4 Pages
    Improved Essays
  • Previous
    Page 1 2 3 4 5 6 7 8 9 50