ipl-logo

Traveling Salesman Problem

989 Words4 Pages

Abstract. We study the Maximal Covering Salesman Problem with the Average Traveling Cost Constraints (MCSPATCC) where the objective is to find a subset of customers with their tour so that the number of covered demand points is maximized. This paper presents a mathematical model to select a profitable subset of demand points to be covered. We also propose an effective heuristic algorithm with three elimination methods to remove unprofitable demand points. The proposed algorithm is based on the genetic algorithm (GA) hybridized with different local search strategies to solve this problem. Parameters of the algorithm are analyzed for calibration by means of the Taguchi method. Extensive computational experiments on a set of standard problems …show more content…

Its associated problems were introduced by William Hamiltone and Thomas Kirkman in 18th century first time. Then, some mathematicians such as Karl Mengerfrom Harvard and Hustler Whitney from Princeton studied the general form of the traveling salesman problem [1], which is a reputable combinatorial optimization problem. Traveling salesman problem is consisting of a set of demand points and the distances each demand point. The objective of traveling salesman problem is to find the shortest possible route that visits each demand point (city) exactly once and returns to the origin city [1]. There are many practical applications for this type of problems such as finding an optimal tour for postmen and tourists [2], process planning for rotating items [3], flow shop scheduling [4], the robotic manipulator control [5], vehicle routing problem [6], computer network design [7], …show more content…

The problem consists of a central depot and a set of cities as demand points. The distance (time) between each two demand point and between the depot and each city is determined. A traveling salesman starts and ends the travel from/to the central depot. The salesman tries to cover some selected demand points among different demand points so that the average traveling cost, which is a function of distance, would not exceed a specified value and also the whole covered demands are maximized. In fact, the goal is to maximize the whole covered

Show More
Related

  • Nt1330 Unit 1 Case Analysis

    1295 Words  | 6 Pages

    Also, to ensure there are always 6 customers in the store. The max between. The max between the arrival time and end of service time at station 1 is used to ensure the 7th customer is served after the 6th is

    Read More

  • Al Waysmoking: A Case Study

    1087 Words  | 5 Pages

    Al Waysmoking was a 72 year-old retired factory worker who was a chain smoker. He is experiencing fatigue, shortness of breath, but continues to smoke. Upon exam his Nurse Practitioner notes that he has a prolonged expiratory phase, expiratory wheezes, and an increased anteroposterior chest diameter. His nail beds were cyanotic and he had moderate pitting edema. Pulmonary Function Testing (PFT) revealed that Al had a decreased VC and an increased RV and FRC.

    Read More

  • Nt1330 Unit 5 Term Paper

    1353 Words  | 6 Pages

    Problem 3. 6 Machines 8 parts The problem is represents by Table 7. This is multiple route, part volume (and single batch) and sequential CF problem.

    Read More

  • Nt1310 Unit 1

    956 Words  | 4 Pages

    Before proceeding to our experiment, we made sure the voltage knob in the power supply is set to 0. Then, the sensor was inserted in the canter of the Helmholtz coil through the hole in the radius. To calibrate the sensor to 0, we clicked “start” in the window

    Read More

  • Nt1310 Unit 1 Lab Report

    596 Words  | 3 Pages

    The error will be ${\bf {\varepsilon}_i = u- \frac{P_1^T X_i}{P_3^T X_i} }$ which is precisely the error in image measurements in equation

    Read More

  • Nt1310 Unit 1 Exercise 2

    490 Words  | 2 Pages

    % The details about the calculation is given in Appendix~\ref{Adedpsystable}. %, for example in 1.45~GeV data set 30$\%$ to 15$\%$ %1.45~GeV to have a larger systematic error (30$\%$) than 1.50~GeV (21$\%$) is still

    Read More

  • Nt1330 Unit 3 Numerical Analysis

    1212 Words  | 5 Pages

    In Figs. (\ref{fig:NC3Mont.eps}-\ref{fig:NC6Mont.eps}), the results of the Monte Carlo analysis is presented along with the result obtained for the central values of the parameter. It is observed that for the form factors $C_3^{N \Delta}(Q^2)$, $C_4^{N \Delta}(Q^2)$ and $C_6^{N \Delta}(Q^2)$, Monte Carlo analysis and the prediction for the central values agree at large values of $Q^2$, but deviate from each other for small values of

    Read More

  • Nt1330 Unit 1 Program Analysis

    1580 Words  | 7 Pages

    To compute rho, the program GSC threshold.m de nes two non-linear functions root2d and root2r as in Equation (15) and (16) of [1]. Each of these functions represents a system of non-linear equations in two variables. The program numerically solves these two by two systems of non-linear equations by using the inbuilt MatLab function f-solve. Since the probabilities, PNi are numerical solution computed by MatLab these values can be very very small numbers. To avoid these artifacts, the program replaces values of rho less than l_t by

    Read More

  • Pt2520 Unit 1 Problem Analysis Paper

    320 Words  | 2 Pages

    In our algorithm, we have already taken a good quality of image. 3) Binarize To binarize the image the ridges are denotted by black and furrow are denotted by the white.

    Read More

  • Fly To Timmins Research Paper

    221 Words  | 1 Pages

    Fly to Timmins Timmins is the home town of country music star Shania Twain, and one look at this beautiful city is all you need to know why. Many visitors fly to Timmins for its abundance of natural beauty. In the winter, snowmobiling, skiing and snowshoeing are also popular. Many of the city’s top destinations are parks, conservation areas, golf courses and resorts.

    Read More

  • Long Distance Commerce Case Study

    1328 Words  | 6 Pages

    Daniel Serrato HISTORY 111 Document and Essay Question assignment 7 1. What motivated and sustained the long-distance commerce of the Silk Roads, Sea Roads, and Sand Roads? Why did the peoples of the Eastern Hemisphere develop long-distance trade more extensively than did those of the Western Hemisphere? One thing that I noticed that motivated the long-distance commerce of the Silk Roads, Sea Roads, and Sand Roads was the fact that the elites were desired luxury items from distant parts of the Eurasian network.

    Read More

  • The Traveling Pant

    853 Words  | 4 Pages

    The Sisterhood of The Traveling Pants, written and published by Ann Brashares in 2001, is a book about four friends, spending the summer apart sharing pants that magically fit them all. The cinematic version was released on May 31, 2005, with a similar yet very different storyline compared to the young adult novel. For the most part, the cinematic version did a mediocre job at recreating the basic foundation of the book. For instance, the book starts out with Carmen, a heavier half Puerto Rican girl, thrift shopping with one of her best friends Lena and Lena’s sister Effie. Carmen buys the pants, but throws them in the back of her closet only to be found again at the beginning of summer.

    Read More

  • The Island Hopping Campaign

    228 Words  | 1 Pages

    The Island Hopping campaign implemented by the Allies in the Pacific Theater would not have been successful without the use of the Navajo Code Talkers. Code developed by the Navajo was indecipherable, and has been credited as the the only unbreakable code in military history. Prior to the involvement of the Navajo Indians the United States marines changed their code every twenty-four hours in an attempt to keep their enemies for decrypting the important messages. Hours were spent trying to code simple messages then send them to be decoded later; this was a great inconvenience to the Allies and extremely ineffective.

    Read More

  • The Knight's Tour Research Paper

    849 Words  | 4 Pages

    The knight’s tour In this paper, I will discuss the knight’s tour, a chess puzzle relatable to graph theory. I will talk about the history of the problem, how it is related to the Hamiltonian paths and circuits, and some techniques to finding the many different tours and proving their existence. The knight is, as you might know, the only chess piece that does not move in a straight line.

    Read More

  • Nt1310 Unit 9 Study Guide

    478 Words  | 2 Pages

    If x(n) is N1 point sequence, if y(n) is N2 point sequence, if rxy (m) is the correlation sequence starts at m=m1, then the value of m corresponding to last sample of rxy (m) is a) b)c)d) 14. For a system, y(n)=nx(n), the inverse system will be, a) y(1/n) b) y(n)/n c) ny(n) d) n-1y(n) 15. The evaluation of correlation involves, a) Shifting, rotating and summation b) Shifting, multiplication and summation c) Change of index, folding and summation d) Change of index, folding, shifting and multiplication 16. Z-transform of x(n)=δ(n) a) -1

    Read More

More about Traveling Salesman Problem

Open Document