An Improved Imperialist Competitive Algorithm to Solve the Dynamic Vehicle Routing Problem in Logistics Management
碩士 === 國立臺灣科技大學 === 工業管理系 === 106 === In today's fierce competitive environment, any enterprise considers increasing its profitability as main purpose. Apart from reducing production costs and increasing sales, the most important thing is to increase the efficiency of logistics. After the fourt...
Main Authors: | Jen-Chun Song, 宋仁鈞 |
---|---|
Other Authors: | Shih-Che Lo |
Format: | Others |
Language: | en_US |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/w98232 |
Similar Items
-
On the Study of Improved Imperialist Competitive Algorithm to Solve the Capacitated Vehicle Routing Problem in Logistics Management
by: Yung-Hsien Wang, et al.
Published: (2013) -
Apply Improved Imperialist Competitive Algorithm to Solve the Capacitated Vehicle Routing Problem with Backhaul in Reverse Logistics Management
by: Ji-rong Ciou, et al.
Published: (2014) -
An Efficient Imperialist Competitive Algorithm for Solving the QFD Decision Problem
by: Xue Ji, et al.
Published: (2016-01-01) -
Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
by: Shuhui Xu, et al.
Published: (2014-05-01) -
An imperialist competitive algorithm for solving the production scheduling problem in open pit mine
by: Mojtaba Mokhtarian Asl, et al.
Published: (2016-06-01)