Computational Evaluation of Greedy Heuristic Methods for 2-objective MMSCP

The set cover problem, which is a classical question in combinatorial optimization, is known to be NP-hard and has been studied by many researchers. We proposed the 2-objective min-max set multi-cover problem and applied the greedy heuristic method to the problem. In this paper, the performance of t...

Full description

Saved in:
Bibliographic Details
Main Authors: SUN, Qiwei, MIYAMOTO, Toshiyuki, KITAMURA, Shoichi, TANIGUCHI-MATSUOKA, Ayako, NAITO, Kento, MORI, Kazuyuki, IZUI, Yoshio
Format: Conference Proceeding
Language:English
Subjects:
Conferences
Consumer electronics
greedy solution
min-max problem
Optimization
set multi-cover problem
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The set cover problem, which is a classical question in combinatorial optimization, is known to be NP-hard and has been studied by many researchers. We proposed the 2-objective min-max set multi-cover problem and applied the greedy heuristic method to the problem. In this paper, the performance of the method is evaluated on the clearing problem of reserve market.
ISSN:2158-4001
DOI:10.1109/ICCE50685.2021.9427629