New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior

详细信息    查看全文

• 作者：Pascual Ferná ; ndez^a ; ^pfdez@um.es ; Blas Pelegrí ; n^a ; Algirdas Lančinskas^b ; Julius Žilinskas^b
• 关键词：Competitive location ; Heuristic algorithm ; Binary and partially binary rules
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：79
• 期：Complete
• 页码：12-18
• 全文大小：568 K
• 卷排序：79

文摘

Binary/partially binary choice rules for competitive location problems are studied. Two new heuristic algorithms based on ranking of potential locations are proposed. Algorithms’ performance has been checked using optimal solutions given by Xpress. The quality of the solution obtained with RDOA-D is around 0.98 for all cases.