Pareto clustering search applied for 3D container ship loading plan problem
作者：
Highlights：
• Pareto Clustering Search (PCS) is a hybrid method to solve multi-objective problems.
• PCS detects promising areas and applies local search heuristics only in these areas.
• We apply the PCS to solve the 3D Container ship Loading Plan Problem (CLPP).
• The PCS provides better solutions for the CLPP than mono-objective methods.
• Decision maker chooses the solution that best meets their interests in a situation.
摘要
•Pareto Clustering Search (PCS) is a hybrid method to solve multi-objective problems.•PCS detects promising areas and applies local search heuristics only in these areas.•We apply the PCS to solve the 3D Container ship Loading Plan Problem (CLPP).•The PCS provides better solutions for the CLPP than mono-objective methods.•Decision maker chooses the solution that best meets their interests in a situation.
论文关键词：Stowage planning,Hybrid heuristics,Clustering search,Pareto front
论文评审过程：Received 4 March 2015, Revised 1 September 2015, Accepted 4 September 2015, Available online 15 September 2015, Version of Record 10 November 2015.
论文官网地址：https://doi.org/10.1016/j.eswa.2015.09.005
