Research of A Chemicals Transportation Routing Problem A Study on the Chemicals Transportation Routing Problem / 化工原料運輸路徑規劃之研究

碩士 / 南臺科技大學 / 行銷與流通管理系 / 105 / Transport and logistics industry is the most important economic lifeline of the country. However, the development level of a country is complementary to the growth of industry logistics. Transport and logistics industry is also the key point of deciding the growth of the company. Among them, the cost of the large transport may affect the company. With the floating rate of the International oil, the fuel costs is corresponding ups and downs. Therefore, the company must think how to reduce the costs. Reducing the distance of the transport is the sticking point. If the shorten distance is not enough, it can not reduce the cost of the company efficiently. And it may even have the loss to the company. This is why the arrangement of the route can be the key point to the company.
In response to the global economic recession with government's carbon reduction policies, the number of companies consider to reduce carbon emission and cut costs. Due to the lack of the relevant expertise, the dispatch vehicles and route planning are unreasonable. They cannot finish the work of transportation in the shortest time or mileage. Therefore, this research is to investigate the problem of the route planning of the transportation. The route in the least cost that we search is to extend the problem of traveling salesman.
This research will investigate two problems:
The first is the use of the 「3-OPT method」to solve the problem. The kilometers of the original transportation route planning is 206.7. However, with 3-OPT method, it can be completed with the best way of mathematical concepts. And the best way that we have is 194.3 kilometers. It is less than the
vi
original route by 12.4. So we know that 3-OPT method can solve the problem of the route planning of transportation effectively.
Second, company A is a private oil trucking company, and the company's operating conditions and vehicle arrangements for the path to discuss and try to find the shortest path. Also, it's compared with the original path, calculate the savings cost, and to simulate the system software ProModel6 to verify the answer.

Identiferoai:union.ndltd.org:TW/105STUT0691001
Date January 2017
Creators黃柏文
Contributors黃仲正
Source SetsNational Digital Library of Theses and Dissertations in Taiwan
Languagezh-TW
Detected LanguageEnglish
Type學位論文 ; thesis
Format60

Page generated in 0.0124 seconds