多仓库定位-运输路线安排问题的模型和算法研究

针对现实问题的复杂性,考虑到单独研究物流设施选址和车辆运输路线安排问题的局限性,根据集成物流管理思想,综合考虑两个问题,重点研究了集成物流管理系统中多仓库定位-运输路线安排问题(LRP)。首先提出了LRP的数学模型,由于LRP属于NP-hard问题,提出了一种用于求解该类问题的两阶段混合启发式算法:禁忌搜索-蚁群混合算法。在选址阶段使用禁忌搜索算法求得一个较好的设施位置后,便转向运输路线安排阶段,并采用蚁群算法获得了一个与已得到的设施位置相对应的优化运输路线,这两阶段反复、连续运算,直到满足预先设置的终止条件。最后,给出算例验证模型和算法的有效性。

Model of Solving Problems about Multi-depot Location - Routing Algorithm

Considering the complication of the realistic problem and the limitation of research into locations-routing problem of logistics separately and integrated logistics, the paper studies lo- cation-routing problem including multi-depot in integrated logistics. Model of LRP is given on the basis of some hypotheses. Because LRP is NP-hard problem, a two-phase heuristic approach for solving the LRP is proposed. In location-allocation phase, after the candidate facilities and their customers are determined by using taboo-search algorithm, vehicle routing phase is assorted to by adopting ant colony algorithm to search the optimal routes. These two phases operate repeatedly and continuously until meeting the condition of termination. At last, the dissertation gives an ex- ample to illustrate the model and algorithm effectiveness.