作者: José Fernández , Boglárka Tóth , Frank Plastria , Blas Pelegrín
关键词: Biobjective optimization 、 Operations research 、 Profit (economics) 、 Multi-objective optimization 、 Computer science 、 Branch and bound method 、 Lexicographical order 、 Franchise 、 Regular polygon 、 Planar
摘要: This paper deals with a hard nonlinear biobjective optimization problem: finding the optimal location and design for new franchised facility within region where facilities (both of franchise not) already exist compete market. The franchisor franchisee both want to maximise their own profit in market, but these two objectives are conflict. Customers patronize all facilities, old new, proportionally attraction them. Both resulting objective functions neither convex nor concave. An interval branch bound method is proposed obtain an outer approximation whole set efficient solutions. Computational experiments highlight different kinds information provided by this variation lexicographic method.