Article
Pareto clustering search applied for 3D container ship loading plan problem
The3DContainershipLoadingPlanProblem(CLPP)isanimportantproblemthatappearsinseaportcontainerterminaloperations.Thisproblemconsistsofdetermininghowtoorganizethecontainersinashipinordertominimizethenumberof ovementsnecessarytoloadandunloadthecontainershipandtheinstabilityoftheshipineachport.TheCLPPiswellknowntobeNP hard.Inthispaper,thehybridmethodParetoClusteringSearch(PCS)isproposedtosolvetheCLPPandobtainagoodapproximationtotheParetoFront.ThePCSaimstocombinemetaheuristicsandlocalsearchheuristics,andtheintensificationisperformedonlyinpromisingregions.ComputationalresultsconsideringinstancesavailableintheliteraturearepresentedtoshowthatPCSprovidesbettersolutionsfortheCLPPthanamono-objectiveSimulatedAnnealing.
Judul | Edisi | Bahasa |
---|---|---|
Analysis of proper capacity at Jakarta International Container Terminal | en | |
Planning And Design Of Ports And Marine Terminal | 2nd Edition | en |