摘要
建立了准时到达、总成本最低的多目标定位———运输路线安排问题(LRP)的数学模型;此LRP问题包括配送中心的分派和运输路线优化两方面的决策,属于NP难题。在构建模型算法过程中,采用了两阶段法:首先采用启发式算法确定配送中心分派问题;其次,给出各个目标的优先级,根据优先因子建立以准时到达为最高优先级、总成本最低为次优先级的新的数学模型,并运用遗传算法求解优化运输路线问题。
The mathematical model of Location-Routing Problem （LRP） based on arriving on time and the total lowest cost is given. The model of LRP including assigning delivery center and optimizing the routing is NP-hard. A two-phase approach for solving LRP is proposed in the course of constructing the model. At first the heuristic algorithm to confirm the assignment of delivery center is adopted. Then the PRI of each goal appears and the new mathematics model is set up regarding reaching as supreme PRI on time, the lowest cost as second PRI according to the prior factor. Finally the routing problem is solved and optimized using the hereditary algorithm.
出处
《工业工程与管理》
2005年第5期1-4,共4页
Industrial Engineering and Management
