The adaptable Pareto set problem for facility location: A video game approach

作者：

Highlights：

• A novel method for solving the Pareto set; an adaptable way to find the Pareto set.

• Solutions are found after an initial configuration.

• Two new heuristics (incremental/decremental) and their corresponding algorithms.

• Using crowdsourcing humans can solve complicated problems.

• Efficient method for solving NP-hard problems.

摘要

•A novel method for solving the Pareto set; an adaptable way to find the Pareto set.•Solutions are found after an initial configuration.•Two new heuristics (incremental/decremental) and their corresponding algorithms.•Using crowdsourcing humans can solve complicated problems.•Efficient method for solving NP-hard problems.

论文关键词：Facility location problem,Multi-objective optimization problems,Pareto set,Heuristics,Serious video games,Crowdsourcing

论文评审过程：Received 24 August 2020, Revised 26 July 2021, Accepted 26 July 2021, Available online 24 August 2021, Version of Record 4 September 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.115682