CAJ | 학술논문

针对现实问题的复杂性，考虑到单独研究物流设施选址和车辆运输路线安排问题的局限性，根据集成物流管理思想，综合考虑两个问题，重点研究了集成物流管理系统中多仓库定位一运输路线安排问题（LRP）。首先提出了LRP的数学模型，由于LRP属于NP—hard问题，提出了一种用于求解该类问题的两阶段混合启发式算法：禁忌搜索一蚁群混合算法。在选址阶段使用禁忌搜索算法求得一个较好的设施位置后，便转向运输路线安排阶段，并采用蚁群算法获得了一个与已得到的设施位置相对应的优化运输路线，这两阶段反复、连续运算，直到满足预先设置的终止条件。最后，给出算例验证模型和算法的有效性．
침대현실문제적복잡성，고필도단독연구물류설시선지화차량운수로선안배문제적국한성，근거집성물류관리사상，종합고필량개문제，중점연구료집성물류관리계통중다창고정위일운수로선안배문제（LRP）。수선제출료LRP적수학모형，유우LRP속우NP—hard문제，제출료일충용우구해해류문제적량계단혼합계발식산법：금기수색일의군혼합산법。재선지계단사용금기수색산법구득일개교호적설시위치후，편전향운수로선안배계단，병채용의군산법획득료일개여이득도적설시위치상대응적우화운수로선，저량계단반복、련속운산，직도만족예선설치적종지조건。최후，급출산례험증모형화산법적유효성．
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.