DocumentCode :
1896874
Title :
Exact and Approximation Algorithms for the Loader Problem
Author :
Chen, Feng ; Tang, Guochun
Author_Institution :
Inst. Eng. Dept., Shanghai Jiao Tong Univ.
fYear :
2006
fDate :
21-23 June 2006
Firstpage :
405
Lastpage :
410
Abstract :
The paper considers the loader problem that is commonly faced by a 3PL company. Based on the linear programming relaxation of the integer linear programming model for the problem, an approximation algorithm is first present for the loader problem using the random rounding techniques, and then its performance is analyzed. Secondly, a simple upper rounding algorithm is present for a special case of the loader problem without labor constraint with its performance analysis. Thirdly, a branch and bound algorithm is proposed by observing the upper bounds, lower bounds, branch rules and dominate rules. Finally, computational experiments are given to show the efficiency of these algorithms
Keywords :
approximation theory; integer programming; linear programming; loading; logistics; 3PL company; approximation algorithm; bound algorithm; integer linear programming model; loader problem; random rounding techniques; third party logistics; trucks; Algorithm design and analysis; Approximation algorithms; Indexing; Industrial engineering; Integer linear programming; Linear programming; Logistics; Performance analysis; Remuneration; Upper bound; Approximation algorithm; Branch and bound; Loader problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
1-4244-0317-0
Electronic_ISBN :
1-4244-0318-9
Type :
conf
DOI :
10.1109/SOLI.2006.329037
Filename :
4125614
Link To Document :
بازگشت