检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津大学管理学院,天津300072
出 处:《系统管理学报》2008年第3期343-347,共5页Journal of Systems & Management
基 金:国家自然科学基金资助项目(70572045)
摘 要:针对包含正向和逆向的再制造物流网络,提出一种由3种设施组成的2层物流设施定位优化方法,并给出0-1整数规划模型。基于遗传算法的全局搜索能力,全面考虑了正向流和逆向流及其它们之间的相互约束处理,避免了传统拉格朗日启发式算法中求上下限的繁琐计算过程。仿真实验表明提出方法的有效性。After a brief introduction to the basic concepts of remanufacturing network (RMN), we improve a 0- 1 integer programming model, in which we simultaneously consider ' forward' and ' reverse' flows and their mutual interactions. It is a two-level problem with three types of facility to be located in a specific reverse logistics system. For this problem, an algorithm based on genetic algorithm is developed for novel constraint treatment and its global search ability. This approach avoids the redundant evaluation of the lower and upper bound in the process of Lagrange heuristic algorithm. The model is tested with different values of parameters on data adapted from classical test problems.
分 类 号:N945.25[自然科学总论—系统科学] O231.5[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.148.147