Ozakca, ArifYuceer, Umit01. Çankaya Üniversitesi06. Mühendislik Fakültesi06.04. Endüstri Mühendisliği2016-06-142025-09-182016-06-142025-09-182010Yüceer, Ü., Özakça, A. (2010). A truck loading problem. Computers&Industrial Engineering, 58(4), 766-773. http://dx.doi.org/10.1016/j.cie.2010.02.0080360-8352https://doi.org/10.1016/j.cie.2010.02.008https://hdl.handle.net/20.500.12416/14689A vehicle with m compartments transports q different products of various sizes from a source to n different destinations. The operational problem is how to load the compartments of the vehicle so that the replenishment time is maximized for a given route of destinations. A mixed integer linear programming model is developed for this class of problems. An investigation of the structure of the model reveals that a subproblem can be obtained in the form of a weighted distribution problem. Consequently, a simple subalgorithm finds an integer solution to this subproblem. The main algorithm bisects the interval of uncertainty until it becomes sufficiently small. There is another subalgorithm to test whether a feasible solution exists in the final interval of uncertainty by solving a Phase I problem. Our numerical experience has shown its computational efficiency and the quality of the solutions obtained. A problem of size 30 can be solved by this method in a fraction of a second. Further, an optimal solution is obtained in 82% of the randomly chosen problems. (C) 2010 Elsevier Ltd. All rights reserved.eninfo:eu-repo/semantics/closedAccessLoading ProblemMilpWeighted Distribution ProblemA Truck Loading ProblemA truck loading problemArticle10.1016/j.cie.2010.02.0082-s2.0-77950690693