Algorithm for the traveling salesman problem

Reference no: EM131121883

Consider the rollout algorithm for the traveling salesman problem using as base heuristic the nearest neighbor method, whereby we start from some simple path and at each iteration, we add a node that does not close a cycle and minimizes the cost of the enlarged path (see the paragraph following the description of the rollout algorithm iteration in Section 10.5). Write a computer program to apply this algorithm to the problem involving Hamilton's 20-node graph (Exercise 1.35) for the case where all arcs have randomly chosen costs from the range [0, 1]. For node pairs for which there is no arc, introduce an artificial arc with cost randomly chosen from the range [100, 101]. Compare the performances of the rollout algorithm and the nearest neighbor heuristic, and compile relevant statistics by running a suitable large collection of randomly generated problem instances. Verify that the rollout algorithm performs at least as well as the nearest neighbor heuristic for each instance (since it is sequentially consistent).

Reference no: EM131121883

Questions Cloud

Briefly describe the depreciation methods based on treating : Briefly describe the depreciation methods based on treating assets as (1) units and (2) a group or as having a composite life.

Discuss how this has influenced the policies of today : Discuss the U.S. police philosophy during the specific time period. How did this relate to terrorism policy? Discuss how this has influenced the policies of today.

Develop a price index for new single-family homes : The median sales prices for new single-family houses for the years 1998-2001 are as follows (Statistical Abstract of the United States, 2002). Use 1998 as the base year and develop a price index for new single-family homes over this four-year perio..

Lettuce each day to ensure really fresh produce : The local supermarket buys lettuce each day to ensure really fresh produce. Each morning any lettuce that is left from the previous day is sold to a dealer that resells it to farmers who use it to feed their animals.

Algorithm for the traveling salesman problem : Consider the rollout algorithm for the traveling salesman problem using as base heuristic the nearest neighbor method, whereby we start from some simple path and at each iteration, we add a node that does not close a cycle and minimizes the cost o..

Single-channel single-phase queuing model : A movie theatre complex has a single ticket booth and cashier who can maintain an average service rate of 280 patrons per hour. Service times are assumed to follow a negative exponential distribution. What are the assumptions of a single-channel sing..

Determine economic order quantity annual invetory and oo : Dermine the following: a. The economic order quantity b. The total annual inventory costs c. The optimal ordering frequency

Consider the cutting plane method : Consider the cutting plane method. (a) Give an example where the generated sequence q(µk) is not monotonically nondecreasing. (b) Give an example where, at the kth iteration, the method finds an optimal dual solution µk but does not terminate becau..

What is the purpose of accounting for depreciation : Is the president's proposal within the scope of generally accepted accounting principles? In making your decision discuss the circumstances, if any, under which use of the method would be reasonable and those, if any, under which it would not be reas..

User Account

All Pages