Learn More
This paper investigates the development of an effective heuristic to solve the set covering problem (SCP) by applying the meta-heuristic Meta-RaPS (Meta-heuristic for Randomized Priority Search). In Meta-RaPS, a feasible solution is generated by introducing random factors into a construction method. Then the feasible solutions can be improved by an(More)
This paper describes an iterative technique between optimization and simulation models used to determine solutions to optimization problems and ensure that the solutions are feasible for real world operations (in terms of a simulation model). The technique allows for the development of separate optimization and simulation models with varying levels of(More)