A heuristic zero/one programming for a bi-objective web-based convergent product networks

R. Hassanzadeh, I. Mahdavi, N. Mahdavi-Amiri
{"title":"A heuristic zero/one programming for a bi-objective web-based convergent product networks","authors":"R. Hassanzadeh, I. Mahdavi, N. Mahdavi-Amiri","doi":"10.1504/IJAOM.2015.068310","DOIUrl":null,"url":null,"abstract":"In the proposed work, by applying the Steiner tree, a bi–objective mathematical model is developed to consider promotion of convergent products to satisfy two objectives of cost and benefit. The results are some new products with more utility for both the buyer and the producer. The methodology proposed to determine value adding functionalities for convergent products. A collection of base functions and sub–functions configure the nodes of a web–based (digital) network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub–functions. Then, numerical values as benefits and costs are determined for arcs and nodes, respectively, using a mathematical approach. A heuristic zero/one programming is developed to provide a solution framework. Finally, the Steiner tree methodology is adapted to a bi–objective model for the network to find the optimal tree determining the value adding sub–functions to bases in a convergent product. An example is worked out to illustrate the applicability of the proposed approach.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Adv. Oper. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAOM.2015.068310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the proposed work, by applying the Steiner tree, a bi–objective mathematical model is developed to consider promotion of convergent products to satisfy two objectives of cost and benefit. The results are some new products with more utility for both the buyer and the producer. The methodology proposed to determine value adding functionalities for convergent products. A collection of base functions and sub–functions configure the nodes of a web–based (digital) network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub–functions. Then, numerical values as benefits and costs are determined for arcs and nodes, respectively, using a mathematical approach. A heuristic zero/one programming is developed to provide a solution framework. Finally, the Steiner tree methodology is adapted to a bi–objective model for the network to find the optimal tree determining the value adding sub–functions to bases in a convergent product. An example is worked out to illustrate the applicability of the proposed approach.
基于web的双目标收敛产品网络的启发式零/一规划
本文应用Steiner树,建立了一个双目标数学模型,考虑收敛产品的推广,以满足成本和效益两个目标。结果是一些对购买者和生产者都有更多效用的新产品。提出了确定收敛产品增值功能的方法。基本功能和子功能的集合配置了表示功能的基于web(数字)网络的节点。网络中的每条弧线都被指定为两个节点之间的链路。目标是在网络中找到一个最优的功能树,在网络环境中为产品增加价值。首先,在产品网络中进行一个净化过程,以分配碱基和子功能之间的联系。然后,使用数学方法分别确定弧和节点的收益和成本数值。开发了一种启发式零/一编程来提供解决方案框架。最后,将斯坦纳树方法应用于网络的双目标模型,以寻找确定收敛积中基的增值子函数的最优树。算例说明了所提方法的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信