✦ LIBER ✦

A new iterative-doubling Greedy–Lookahead algorithm for the single container loading problem

✍ Scribed by Wenbin Zhu; Andrew Lim

Book ID: 116437042
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 820 KB
Volume: 222
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.04.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iterative greedy algorithm for solving t

Iterative greedy algorithm for solving the FIR paraunitary approximation problem

✍ Tkacenko, A.; Vaidyanathan, P.P. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 556 KB

A Parallel Genetic Algorithm for Solving

A Parallel Genetic Algorithm for Solving the Container Loading Problem

✍ Hermann Gehring; Andreas Bortfeldt 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

A Tree Search Algorithm for Solving the

A Tree Search Algorithm for Solving the Container Loading Problem

✍ Fanslau, Tobias; Bortfeldt, Andreas 📂 Article 📅 2010 🏛 Operations Research Society of America 🌐 English ⚖ 290 KB

A new greedy algorithm for the quadratic

A new greedy algorithm for the quadratic assignment problem

✍ Theodoros P. Gevezes, Leonidas S. Pitsoulis 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 463 KB

A parallel hybrid local search algorithm

A parallel hybrid local search algorithm for the container loading problem

✍ D. Mack; A. Bortfeldt; H. Gehring 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

A parallel tabu search algorithm for sol

A parallel tabu search algorithm for solving the container loading problem

✍ A Bortfeldt; H Gehring; D Mack 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Iss