检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《武汉理工大学学报(交通科学与工程版)》2007年第5期902-905,共4页Journal of Wuhan University of Technology(Transportation Science & Engineering)
基 金:国家社科基金项目(批准号:04BJY067);中南大学博士创新选题基金项目(批准号:CSU20030126)资助
摘 要:考虑到客户、初始回收点和回收中心3个层次的逆向物流网络,选择合适的回收中心,确定初始回收点个数和回收周期,基于一些基本假设,以最小化总的相关成本建立了1个内嵌两个指派模型的非线性混合整数规划模型,对符号体系和求解思路进行了分析.借助遗传算法,结合具体实例,给出了求解步骤和求解结果分析.A simple description of the structure and characteristics of a general multi-level reverse logistics network is presented firstly in this paper. Considering tree basic nodes in reverse logistics network in- cluding customer, initial collecting point and return center, a planning problem is proposed to locate return center, determining the number and periods of the required initial levels collecting points with the objective of minimizing the aggregate cost. Then, to reduce the solving complexity of the problem to some extent, some necessary presumptions are presented, based on which a non linear mixed inte- ger programming model is developed. Simultaneously, two assignment models are embedded. Denota- tion system and existing solving methods are described and discussed respectively. Furthermore, com- bined with a specific instance, a genetic algorithm (GA) is chosen to solve the problem and detailed solving process is listed as well. At last, by Matlab programming, the optimal solution to the instance is obtained and corresponding numerical analysis is carried out.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28