Exact algorithms for solving a bi-level location–allocation problem considering customer preferences

Exact algorithms for solving a bi-level location–allocation problem considering customer preferences

Abstract The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonl...

Full description

Bibliographic Details
Main Authors: Ehsan Mirzaei, Mahdi Bashiri, Hossein Shams Shemirani
Format: Article
Language:English
Published: Islamic Azad University 2019-01-01
Series:Journal of Industrial Engineering International
Subjects:
Competitive location–allocation problem
Bi-level programming
Branch and bound
Full enumeration
Clustering
Online Access:http://link.springer.com/article/10.1007/s40092-018-0302-6

Internet

http://link.springer.com/article/10.1007/s40092-018-0302-6

Similar Items