Mathematical models and solution methods for container loading problems

In this thesis, mathematical models and solution methods are considered for container loading problems. In order to solve container loading and container assortment problem two-objective mixed integer mathematical models and mathematical model based heuristics are proposed under various assumptions and constraints. Two different solution methods, weighted sum and conic scalarization methods are used to solve proposed two objective mathematical model and mathematical model based heuristic. For this problem, a new filling and a ranking heuristics are proposed. Also, a simulating annealing metaheuristic is developed and new filling and ranking heuristics are used in this algorithm to solve problems. Test problems and generated new problems are solved and results are compared with liretature and other proposed solution methods.