Abstract: To improve the efficiency and safety of railway departments for transporting hazardous materials,the multi-objective transfer station location problem with multi-class material,station capacity and delivery deadline was considered for rail-road intermodal transportation of hazardous materials.The location for each type of hazardous material transfer station from given candidate sites was selected,and the transportation route for each material in the constructed intermodal network was determined.Aiming at minimizing the total cost and total risk in transportation,transfer and location processes,a bi-objective 0-1 linear programming model with node-arc multi-commodity network design formulation was formulated.Compared with the hub location model widely formulated by existing works,the proposed model could reduce the model size significantly,and also exhibits a more compact structure.By exploiting the characteristics of the problem,an augmented ε-constraint algorithm was customized to balance the two objectives and find representative non-dominated solutions.A large-scale realistic case was constructed to test the effectiveness and efficiency of the proposed approaches.Computational results demonstrated that the augmented ε-constraint algorithm using the formulated model could find high quality representative non-dominated solutions within a reasonable time.Meanwhile,the algorithm was better than the weighted-sum algorithm widely employed in related works in terms of the number and uniformity of distinct non-dominated solutions.

Key words: hazardous materials transportation, rail-road intermodal transportation, transfer station location, integer programming, multi-objective optimization

摘要： 为提高铁路部门开展危险货物运输的效率和安全性,研究了具有多品类多批次运输需求、办理站能力限制和货物运到时限的多目标危险货物铁公联运办理站选址问题,从给定候选点中选择各类型危险废物办理站的位置,并确定各批危险货物在构造联运网络中的运输路径,同时以运输、转运和选址过程中的总费用和总风险最小为目标,构造了基于点—弧多商品网络设计的双目标0-1线性规划模型。相比于既有研究常构建的hub选址模型,所提模型可显著缩减模型规模,且结构更为紧凑。根据问题特点,定制增广ε-约束算法对两目标进行折中,以寻找若干代表性非支配解。设计了大规模切实案例,对所提方法的效果和效率进行测试。结果表明,基于所提模型,增广ε-约束算法可在合理时间内寻找到高质量的代表性非支配解,且在不同非支配解的数量和均匀度上优于既有文献普遍采用的线性加权求和算法。

关键词: 危险货物运输, 铁公联运, 办理站选址, 整数规划, 多目标优化