检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙浩[1]
出 处:《工业工程与管理》2009年第3期70-77,共8页Industrial Engineering and Management
基 金:国家自然科学基金资助项目(70472033)
摘 要:首先构建了一个制造/再制造集成物流网络:在该网络中,正向物流和逆向物流都是双层结构的,所有的物流设施均有能力限制,且假设再制造产品与新产品同质,都可以用来满足顾客的需求。在此基础上建立了一个混合整数非线性规划(MINLP)模型。然后提出了混合启发式算法求解。该算法用禁忌搜索法确定整型变量,用基于优先权的遗传算法解决多阶段运输问题。最后通过一个算例说明了模型和算法的有效性。Firstly an integrated manufacturing/remanufacturing logistics network is constructed, in which the structures of both the forward and the reverse logistics are of two-level; and all the logistics facilities are capacitated. It is also assumed that remanufacturing products and new products are homogeneous and both can be satisfied the demands of customers. On such a basis, a mixed-integer non-linear programming (MINLP) model is built. Then a hybrid heuristic algorithm (HHA) is proposed to solve the model, which uses the tabu search algorithm to establish the binary variables and a genetic algorithm based on priority weight coding to solve multi-stage transportation problem. Finally the validity of both the model and the algorithms is illustrated by an example.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.93.255