DiscussionThe Traveling Salesman Problem Essay Example | Topics and Well Written Essays - 250 words

DiscussionThe Traveling Salesman Problem - Essay Example In particular, the paper discusses how a business manager can effectively deliver a specific food product to major hotels located in the five cities. Transport problems, in business management, are considered as networks. A network, according to Shenoy et al (1989), is a set of nodes and arcs, where nodes are destinations and arcs are routes followed. In the problem, nodes are the cities, while arcs are the routes linking the cities. Apart from the nodes and arcs, a business manager considers capacity of a route, maximum flow of an entire system, and activity times in each path or route. In solving delivery problems, business managers use Critical Path Method (CPM) and Project Evaluation Review Technique (PERT). CPM uses the concept of critical activity and critical path in solving transport problems. A critical activity, in a network, is an activity whose time of start affects completion time of the entire project. In delivery problems, critical activities include loading and offloading, fueling and servicing, and drivers’ exchange times. In the delivery problem, critical activities also include time taken by a driver and /or a turn-boy to have breakfast, lunch, dinner, or supper. All these activities determine how fast or slow delivery to hotels in the five cities will be. Therefore, in CPM, a manager identifies points with these activities and organizes them such that minimum time and cost is spent in one complete flow of the food product (Shenoy et al., 1989). In PERT, direction of a flow is not fixed and is thus, considered as random variable. A probabilistic model is, therefore, used to identify a route with the shortest flow time. PERT considers activity time (t0), optimistic time (a), pessimistic time (b), and most likely time (m). Activity time measures duration of an activity, while optimistic time is the shortest possible time an activity can take. Pessimistic time is the longest possible time an activity