| Article ID: | iaor20071288 |
| Country: | China |
| Volume: | 14 |
| Issue: | 4 |
| Start Page Number: | 15 |
| End Page Number: | 18 |
| Publication Date: | Aug 2005 |
| Journal: | Operational Research and Management Science |
| Authors: | Tang Guochun |
| Keywords: | heuristics |
The loader problem is a real problem from logistics technology. The embryonic form of the problem was proposed and studied by Institute of Mathematics, Academia Sinica, in 1960s. The rapid development of modern logistics technology motivates the presentation and study of the loader problem. The loader problem is a new NP-hard combinatorial optimization problem. In this paper we provide a restricted case of the loader problem and prove that it is pseudo-polynomially solvable.