2. ทฤษฎีและงานวิจัยที่เกี่ยวข้อง 2.

2. theory and related research issues 2.1 selecting the path to the selected shipping routes from the starting point to the destination point, where there are many paths to choose from that can map dapen travel or network path, as shown in Figure 1, the selected route would require.Most ta funds Problems selecting the path this cargo is similar to a problem selecting the shortest path (Shortest..path problem), which is the crux of the journey through the selection of projects. Networks to provide the shortest distance, which researchers have proposed a method of. To Panama route solution to transport goods from the starting place to many destinations, such as [1] have been proposed in the context of a dynamic system to check NA (Dynamic programming), which is a mathematical technique to find the answer to the problem of prices. There are systems and processes in the context of the integration gateway check box. All decisions of the highest performance problems. If the problem is related to a decision to leave this way and the shortest way to solve the problem effectively. Figure 1 the transport network from the source to the destination. Later, [2] proposed a Dijkstra algorithm based on Directed graph where every line connects with Uncle heavy positive. The algorithm for finding the shortest distance from the node to any node in the graph to find the shortest path to each knot gradually until the following requirements have been applied [3] method on fas for selecting a transport route from the North of the country, South to the Thai request.Ngoprathet China with a tennis court and many factors and involves ambiguity in order to effect the decision to better suit the actual conditions of the problem, as well as the work of [4] has been designed to support the system. To support the decision for the selection of the transport system. Continuous multiple formats for exporting of timber.

2. Theory and Related Research 2.1 routing problem. Choosing a freight route from the start. To the point of destination There are many routes to choose from, which can be defined as a network of trails, or plan a trip, as shown in Figure 1, the selected route must be the most cost lower freight route selection problem is similar. The problem of choosing the shortest route. (Shortest..path problem), a journey through the various nodes in the chassis. Network to provide the shortest distance possible. The researchers propose a solution to a friend or routing of freight. Starting place to another place multiple destinations, such as [1] The present set of dynamics (Dynamic programming), a mathematical technique to find the answer of the problem with the system and the process by which a. Set Integration All decisions of the problem to be most effective when the issue was decided that ties together the sequence and how it can solve their shortest effectively
form the first citywide transit from point of origin to its destination
later [. 2] proposes Dijkstra's algorithm based Directed graph in which every edge weight is a plus for the algorithm. To find the shortest distance from one node to any node in the graph to find the shortest path to each node until it reaches the desired later [3] have applied. Fuzzy approach in choosing transport routes from the north. Thailand to southern China with the cutting of a new heart. Multiple factors are involved, and there is ambiguity, so the decision is appropriate to the real conditions of. The problem, as with the [4] The design of the system. The decision support For the selection of the transportation system. Multimodal format For the export of timber.

2. Theory and related research 2.1 trouble choosing route. A selection problem of transport routes from the beginning, to the point of destination, which has many เส้นทางให้ choose can, defined as a journey, or network of route planning As shown in Figure 1.Most problems of choosing transport routes is similar to Problems of choosing the shortest route (Shortest..Path problem), which is a journey through the knot in the structure. Network to provide the shortest distance. The researchers have proposed to solve the problem, friends, to choose the path transportation products.Such [] has to offer. 1. Upholding the dynamics (Dynamic programming) which is the mathematical techniques to find, the answer of the problem, a systematic process, and that The schedule included, all decisions of the problem to be most effective.The order and this method can solve the shortest path effectively
.Figure 1 transport network from the point of origin to reach the destination!Later [] proposed 2 Dijkstra 's algorithm by considering Directed graph every connected to the water. The weight are positive, for the step this way. Will find the shortest distance from one node to any node in the graph, by will find the shortest route to each node.Later [3] Apply Fuzzy method to choose the path transportation from the north. Thailand to the south of China are cut completely. Multiple factors and ambiguity involved.The problem, as well as the work of [] 4 system support, deciding for the selection of transport systems, continuous many forms, for the export of rubber.