Study on Mechanical Bearing Capacity with Tabu Search Algorithm for Multi-Vehicle and Multi-Cargo Loading Problem

Article Preview

Abstract:

This paper studies multi-vehicle and multi-cargo loading problem under the limited mechanical bearing capacity. Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. Firstly, for the operation, 1-move and 2-opt were applied. Secondly, through utilizing Boltzmann mechanism of simulated annealing algorithm, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and the mechanical engineering examples.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3-6

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Shachnai H, Tamir T. Polynomial time approximation schemes for class-constrained packing problems. Journal of Scheduling, Vol. 4(2001), pp.312-338.

DOI: 10.1002/jos.86

Google Scholar

[2] Bhattacharya S, Roy R. An exact depth-first algorithm for the pallet loading problem. European Journal of Operational Research, Vol. 110(1998), pp.610-625.

DOI: 10.1016/s0377-2217(97)00272-5

Google Scholar

[3] Seheithauer G, Sommerweib U. 4-Bloek heuristic for the rectangle Packing Problem. European Journal of Operational Research, Vol. 108(1998), pp.509-526.

DOI: 10.1016/s0377-2217(96)00359-1

Google Scholar

[4] LEI ding you, CHEN De-liang. Optimizing model and its algorithms of balanced loading problems. Journal of Systems Engineering, Vol. 19(2004), pp.251-257.

Google Scholar

[5] Vitoria Pureza, Reinaldo Morabito. Some Experiments with a Simple Tabu Search Algorithm for the Manufacturer's Pallet Loading Problem. Computers & Operations Research, Vol. 33(2006), pp.804-819.

DOI: 10.1016/j.cor.2004.08.009

Google Scholar

[6] John Levine, Frederick Ducatelle. Ant Colony Optimization and Local Search for Bin Packing and Cutting Stock Problems. Journal of the Operational Research Society, Special Issue on Local Search, Vol. 55(2004), pp.705-716.

DOI: 10.1057/palgrave.jors.2601771

Google Scholar

[7] YANG Xi-qing, NIU Hui-min. Model and Algorithm for the Multi-model and Multi-cargo Loading Problem. Journal of Lanzhou Jiaotong University, Vol. 28(2009), pp.123-125.

Google Scholar