中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Model and algorithm for bilevel newsboy problem with fuzzy demands and discounts

文献类型:期刊论文

作者Ji, XY; Zhen, S
刊名Applied mathematics and computation
出版日期2006
卷号172期号:1页码:163-174
关键词Newsboy problem Bilevel programming Quantity discount Fuzzy simulation
ISSN号0096-3003
DOI10.1016/j.amc.2005.01.139
通讯作者Ji, xy(xyji@orsc.edu.cn)
英文摘要This paper considers the model for the newsboy problem with fuzzy demands and quantity discounts in hierarchical decision system, in which the manufacturer is considered as the decision-maker (dm) of the top level and decides the wholesale prices of newspaper in order to maximize his profit, while the retailers are the dms of the lower level and decide the ordering quantities of newspaper in order to maximize their own expected profits. a bilevel programming model is formulated for this kind of problem. to solve the model, a hybrid intelligent algorithm based on genetic algorithm and fuzzy simulation is developed, and some numerical examples are given to illustrate its effectiveness. (c) 2005 elsevier inc. all rights reserved.
WOS关键词GENETIC-ALGORITHMS ; STACKELBERG
WOS研究方向Mathematics
WOS类目Mathematics, Applied
语种英语
WOS记录号WOS:000235511200014
出版者ELSEVIER SCIENCE INC
URI标识http://www.irgrid.ac.cn/handle/1471x/2378488
专题中国科学院大学
通讯作者Ji, XY
作者单位1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
2.Chinese Acad Sci, Grad Sch, Sch Management, Beijing 100039, Peoples R China
推荐引用方式
GB/T 7714
Ji, XY,Zhen, S. Model and algorithm for bilevel newsboy problem with fuzzy demands and discounts[J]. Applied mathematics and computation,2006,172(1):163-174.
APA Ji, XY,&Zhen, S.(2006).Model and algorithm for bilevel newsboy problem with fuzzy demands and discounts.Applied mathematics and computation,172(1),163-174.
MLA Ji, XY,et al."Model and algorithm for bilevel newsboy problem with fuzzy demands and discounts".Applied mathematics and computation 172.1(2006):163-174.

入库方式: iSwitch采集

来源:中国科学院大学

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。