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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University
2019-01-01
|
| Series: | Journal of Industrial Engineering International |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s40092-018-0302-6 |
| _version_ | 1818606667657379840 |
|---|---|
| author | Ehsan Mirzaei Mahdi Bashiri Hossein Shams Shemirani |
| author_facet | Ehsan Mirzaei Mahdi Bashiri Hossein Shams Shemirani |
| author_sort | Ehsan Mirzaei |
| collection | DOAJ |
| description | 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 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. |
| first_indexed | 2024-12-16T14:14:30Z |
| format | Article |
| id | doaj.art-0014111f4bc048e3ab46199a515a5570 |
| institution | Directory Open Access Journal |
| issn | 1735-5702 2251-712X |
| language | English |
| last_indexed | 2024-12-16T14:14:30Z |
| publishDate | 2019-01-01 |
| publisher | Islamic Azad University |
| record_format | Article |
| series | Journal of Industrial Engineering International |
| spelling | doaj.art-0014111f4bc048e3ab46199a515a55702022-12-21T22:28:38ZengIslamic Azad UniversityJournal of Industrial Engineering International1735-57022251-712X2019-01-0115342343310.1007/s40092-018-0302-6Exact algorithms for solving a bi-level location–allocation problem considering customer preferencesEhsan Mirzaei0Mahdi Bashiri1Hossein Shams Shemirani2Faculty of Engineering, Shahed UniversityFaculty of Engineering, Shahed UniversityFaculty of Engineering, Shahed UniversityAbstract 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 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.http://link.springer.com/article/10.1007/s40092-018-0302-6Competitive location–allocation problemBi-level programmingBranch and boundFull enumerationClustering |
| spellingShingle | Ehsan Mirzaei Mahdi Bashiri Hossein Shams Shemirani Exact algorithms for solving a bi-level location–allocation problem considering customer preferences Journal of Industrial Engineering International Competitive location–allocation problem Bi-level programming Branch and bound Full enumeration Clustering |
| title | Exact algorithms for solving a bi-level location–allocation problem considering customer preferences |
| title_full | Exact algorithms for solving a bi-level location–allocation problem considering customer preferences |
| title_fullStr | Exact algorithms for solving a bi-level location–allocation problem considering customer preferences |
| title_full_unstemmed | Exact algorithms for solving a bi-level location–allocation problem considering customer preferences |
| title_short | Exact algorithms for solving a bi-level location–allocation problem considering customer preferences |
| title_sort | exact algorithms for solving a bi level location allocation problem considering customer preferences |
| topic | Competitive location–allocation problem Bi-level programming Branch and bound Full enumeration Clustering |
| url | http://link.springer.com/article/10.1007/s40092-018-0302-6 |
| work_keys_str_mv | AT ehsanmirzaei exactalgorithmsforsolvingabilevellocationallocationproblemconsideringcustomerpreferences AT mahdibashiri exactalgorithmsforsolvingabilevellocationallocationproblemconsideringcustomerpreferences AT hosseinshamsshemirani exactalgorithmsforsolvingabilevellocationallocationproblemconsideringcustomerpreferences |