Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution

Abstract

• Competitive location problem with the distance-based coverage is introduced. • The objectives include maximum total coverage and minimum total distances. • The coverage of the facility is represented as a mathematical formulation. • A novel heuristic algorithm is introduced to find best non-dominated solution sets. • The introducted algorithm demonstrates the good performance comparing with exhausive method. The multi-objective competitive location problem (MOCLP) with distance-based attractiveness is introduced. There are m potential competitive facilities and n demand points on the same plane. All potential facilities can provide attractiveness to the demand point which the facility attractiveness is represented as distance-based coverage of a facility, which is “full coverage” within the maximum full coverage radius, “no coverage” outside the maximum partial coverage radius, and “partial coverage” between those two radii. Each demand point covered by one of m potential facilities is determined by the greatest accumulated attractiveness provided the selected facilities and least accumulated distances between each demand point and selected facility, simultaneously. The tradeoff of maximum accumulated attractiveness and minimum accumulated distances is represented as a multi-objective optimization model. A proposed solution procedure to find the best non-dominated solution set for MOCLP is introduced. Several numerical examples and instances comparing with introduced and exhaustive method demonstrates the good performance and efficiency for the proposed solution procedure.