No abstract

No abstract

Multiple objective combinatorial optimization problems are difficult to solve and often, exact algorithms are unable to produce optimal solutions. The development of multiple objective heuristics was inspired by the need to quickly produce acceptable solutions. In this paper, we present a new multiple objective Pareto memetic algorithm called PMS MO . The PMS MO algorithm incorporates an enhanced fine-grained fitness assignment, a double level archiving process and a local search procedure to improve performance. The performance of PMS MO is benchmarked against state-of-the-art algorithms using 0-1 multi-dimensional multiple objective knapsack problem from the literature and an industrial scheduling problem from the aluminum industry.

No abstract

No abstract