LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo by nate_dumlao from unsplash

AbstractThe 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… Click to show full abstract

AbstractThe 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 nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior means that the customer patronizes the most attractive (most comfort) location that he/she wants to be served among the locations of the first-level decision maker (Leader) and the second-level decision maker (Follower). Four types of exact algorithms have been introduced in this paper which include three types of full enumeration procedures and a developed branch-and-bound procedure. Moreover, a clustering-based algorithm has been presented that can provide a good approximation (a good lower bound) to the mentioned binary problem. For this purpose, the numerical results obtained are compared with the results of the full enumeration, heuristic and the branch-and-bound procedure.

Keywords: customer; problem; customer preferences; level; considering customer; exact algorithms

Journal Title: Journal of Industrial Engineering International
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.