A new web-based solver for combinatorial optimization problems under permutation property

Combinatorial optimization problems under permutation property (COPP) are generally NP-hard. To address such problems, metaheuristic approaches have increasingly captured the research interest due to their abilities to provide acceptable solutions in a reasonable time. This paper deals with a web based-solver destined for young researchers to solve COPP by metaheuristic approaches. This new tool will provide the opportunities to browse related works proposed for the COPP and metaheuristics. It will evaluate several versions of metaheuristic, and then, to give a best approximated solution to a studied COPP thanks to the design of experiment (DOE) module. As a first application, we will present a genetic solver tool for permutation flow shop scheduling problem.