在實務上，許多跨國企業會同時擁有多區域的生產工廠與運輸船隊進行貨物配送，此類型企業的船隊在船舶運輸的分類中可稱為產業專用船運(industrial shipping)，該船隊的短期營運操作問題主要在於客戶訂單的處理與船舶途程規劃，由於客戶訂單的處理與船舶排程直接影響到企業是否可以快速的滿足客戶需求，且在船舶屬性、港口限制和工廠庫存互相影響的環境下，要如何把客戶訂單分配在各區域的生產工廠，並且有效率的規劃船隊的航行路徑進行配送，是個非常複雜決策工作，目前有些企業仍然依靠人工的方式進行訂單的處理與船舶排程，隨著近年來運輸成本的上升與訂單業務增加，傳統的人工已無法應付此工作，因此如何使用電腦系統同時進行訂單分配與船舶途程規劃，降低船舶運輸的成本亦減少規劃人員經驗的差異，成為目前主要需解決的問題。
本研究主要探討產業專用船運的短期營運問題，將原始問題分為多廠區訂單分配問題(MPOAP)與船舶途程規劃問題(SRP)。並在單位運輸成本最小為規劃目標下，在訂單分配問題建構基因演算法與粒子群演算法分別進行求解，在船舶途程規劃問題建構門檻式變動鄰域搜尋法進行求解，本研究使用兩種搜尋架構將子問題的演算法進行整合求解，分別為兩階段式架構演算法與回饋式架構演算法，最後利用個案公司的實例資料進行參數實驗與求解分析。
經過實驗與分析發現兩階段與回饋式方法在實務資料與測試資料中都可以有效求解，且回饋式演算法求解的績效在訂單數量越大時越優於兩階段演算法，而兩階段演算法求解效率較好，所花費的運算時間小於回饋式演算法，因此，可證明本研究方法可應用於實務問題且回饋式演算法可比兩階段演算法帶來更多利潤，決策者可視不同需求與情境選擇使用不同的演算法。

1. 卓裕仁, “以巨集啟發式方法求解多車種與週期性車輛路線問題之研究”國立交通大學運輸工程與管理學系，博士論文，2000。
2. 程耀輝, “多路程車輛排程問題之門檻接受啟發式演算法”義守大學工業工程與管理學系，碩士論文，2006。
3. 劉慧燕，“不定其船運船舶排程問題之研究”，國立成功大學交通管理科學研究所，博士論文，2011。
4. 劉佩玲，“考量產品配送下之多產區訂單分配問題應用門檻值接受法”，元智大學工業工程與管理學系，碩士論文，2004。
5. Bronmo ,G., Christiansen, M., Fagerholt, K. and Nygreen, B., “A Multi-start local search heuristic for ship routing scheduling a omputational” Computer and Operations Research Society , Vol.34,pp.900-917,2007.
6. Chen ,J. C., Hsieh,W. H.,Cheng, C. H. and Chen, C. S. ,“Hybrid Meta-Heuristics for Vehicle Routing Problem with Time Window Constraints” , Institute of Electrical and Electronics Engineers,2009 .
7. Chut, P. C. and Beasley, J. E., “A Geneic Alogorithm for the Generalised Assignment Problem ” , Computers Operational Research, Vol. 24, No. 1, pp. 17-23, 1997.
8. Christiansen ,M. ,and Nygreen ,B., “A method for solving ship routing problems with inventory constraints”, Annals of Operations Research ,Vol. 81 pp.357 – 378,1998.
9. Korsvik ,J. E., Fagerholt, K., and Laporte,G., “A large neighbourhood search heuristic for ship routing and scheduling with split loads” ,Computers & Operations Research , Vol. 38,mpp. 474–483,2011.
10. Fagerholt ,K., Ronen ,D., and Christiansen, M., “Ship Routing and Scheduling: Status and Perspectives”,Transportation Science ,Vol. 38, No. 1,2004.
11. Feltl ,H., and Raidl ,G. R., “An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem ”, ACM Symposium on Applied Computing, March 14-17, 2004.
12. Ford,L. R., and Fulkersom ,D. R.,“Solving the Transportation Problem” ,Management Science, Vol. 3, No. 1 pp. 24-32 ,1956.
13. Fagerholt ,K. and Christiansen M., “A combined ship scheduling and allocation problem” ,Journal of the Operational Research Society, Vol. 51, No. 7, pp. 834-842,2000.
14. Gunnarsson ,H., Ronnqvist M., and Carlsson D., “A combined terminal location and ship routing problem” ,Journal of the Operational Research Society , Vol.57, pp.928–938,2006.
15. Hansen ,P. and Mladenovicae, N., “Variable Neighborhood Search:Principles and applications” European Journal of Operations Research, Vol. 130, pp.449 – 467,2001.
16. Hansen ,Pierre, Mladenovi´c ,Nenad and José A. Moreno Pérez, “Variable neighbourhood search: methods and applications” ,A Quarterly Journal of Operations Research,pp.319-360,2008.
17. Lee ,D. S., Vassiliadis ,V. S., Park ,J. M., “A novel threshold accepting meta-heuristic for the job-shopscheduling problem”,Computers & Operations Research, Vol.31, pp.2199–2213,2004
18. Nikolakopoulos ,A. and Sarimveis ,H., “A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem”,European Journal of Operational Research ,Vol.177,pp.1911–1929 ,2007.
19. Malliappi ,F., Bennell ,J. A., and Potts ,C. N., “A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling” ICCL 2011, LNCS 6971, pp. 273–285, 2011.
20. Mladenovicae ,N. and Hansent, P., “Variable Neighborhood Search” Computer and Operations Research, Vol. 24, No. 1 I. pp. 1097-1100,1997
21. Pang, K.W., Xu, Z. and Li,C.L.,“Ship routing problem with berthing ime clash avoidance constraints”, Int. J. Production Economics, Vol. 131, pp. 752–762,2011
22. Palekar ,U. S., Karwan ,M.H., and Zionts, S., “A Branch-and-bpund Method For The Fixed Charge Transportation Problem”, Management Science, Vol. 36, No. 9, 1990
23. Ross ,G.T. ,and Soland, R. M., “A Branch and Bound Algorithm for the the Generalizd Assignment Problem”,Mathematical Programming,Vol.8,91-130,1975
24. Siswanto, N., Essam, D. and Saroker, R.,“Solving the ship inventory routing and scheduling problem with undedicated compartments”, Computers & Industrial Engineering,2010
25. Trarntlis,C.D.and Kiranoudis ,C.T., “A Meta-heuristic Algorithm for the Efficient Distribution of Perishable Foods” ,Journal of Food Engineering, Vol.50,pp.1-9,2001
26. Trarntlis,C.D. and Kiranoudis ,C.T., “A Meta-heuristic Algorithm for the Efficient Distribution of Perishable Foods” ,Journal of Food Engineering, Vol.50,pp.1-9,2001
27. Tate ,D.M. and Smith ,A. E., “A Genetic Approach to the Quadratic Assignment problem ”, Computers Operational Research,Vol. 22, No. 1, pp. 73-83, 1995
28. Palekar, U. S., Karwan ,M.H. and Zionts ,S., “A Branch-and-Bound Method For The Fixed Charge Transportation Problem”, Management Science,Vol. 36, No. 9, September 1990.
29. Vignaux, G. A., and Michalewicz, Z.,“A Genetic Algorithm for the Linear Transportation Problem” ,IEEE Transactions on System ,Man and Cybernetics, Vol. 21, No. 2, 1991
30. Yin ,P.Y., Yu ,S.S., Wang, P.P.and Wang, Y.T., “A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems”,Computer Standards & Interfaces ,Vol.28, 441–450,2006
31. Yang ,F.C., Chen ,K., Wang ,M.T. ,Chang,P.Y., and Sun ,K.C., “Mathematical modeling of multi-plant order allocation problem and solving by genetic algorithm with matrix representation”,Int J Adv Manuf Technol ,Vol. 51,pp.1251–1259,2010.