Study on Tabu Search Algorithm for Multi-Cargo Loading Problem

Chun Yu Ren

doi:10.4028/www.scientific.net/AMM.178-181.1802

Paper Titles

Effects of the Visibility on Traffic Flow
p.1782

Simulation and Experiment for Highway Toll Station
p.1786

The Research on the Optimization of Transportation Routing for Fresh Food by Improved Genetic Algorithm
p.1790

Urban Rail Transit Operation during World Expo 2010 Shanghai
p.1797

Study on Tabu Search Algorithm for Multi-Cargo Loading Problem
p.1802

Road Safety in Developing Countries - The Case of Transportation Management in Dar Es Salaam City
p.1806

The Classified Management of Transport of Dangerous Goods Section
p.1815

Urban Traffic Management and Urban Planning
p.1820

Urban Mass Transit Network Project Selection Using the Fuzzy Expandable Engineering Optimization Model
p.1824

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 178-181Study on Tabu Search Algorithm for Multi-Cargo...

Study on Tabu Search Algorithm for Multi-Cargo Loading Problem

Abstract:

The paper is focused on the Multi-cargo Loading Problem (MCLP). 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. For the operation, 1-move and 2-opt were applied, 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 concrete examples.

You might also be interested in these eBooks

Sustainable Environment and Transportation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 178-181)

Pages:

1802-1805

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.178-181.1802

Citation:

Cite this paper

Online since:

May 2012

Authors:

Chun Yu Ren

Keywords:

1-Move, 2-Opt, Multi-Cargo Loading Problem, Tabu Search Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Armstrong Ronald D，Jin Zhiying. Strongly polynomial simplex algorithm for bipartite vertex packing. Discrete Applied Mathematics, Vol. 64(1996), pp.97-103

DOI: 10.1016/0166-218x(94)00122-t

Google Scholar

[2] Rob van Stee. An approximation algorithm for square packing. Operations Research Letters, Vol. 32(2004), P.535-539

DOI: 10.1016/j.orl.2004.02.003

Google Scholar

[3] E. K. Burke, G. Kendall, G. Whitwell. A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research, Vol. 52(2004), P. 655-671

DOI: 10.1287/opre.1040.0109

Google Scholar

[4] Leung T W, Chan Chi Kin, Troutt Marvin D. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research, Vol. 145(2003), P. 530-542

DOI: 10.1016/s0377-2217(02)00218-7

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), P. 804-819

DOI: 10.1016/j.cor.2004.08.009

Google Scholar

[6] BU Lei, YIN Chuan-zhong, PU Yun. Genetic algorithm for optimal arrangement of general piece goods. Journal of Traffic and Transportation Engineering, Vol. 34(2004), P.84-87

Google Scholar

[7] CAO Hongmei, GAO Li, ZHANG Tiangong. Ant algorithm for optimal loading of multi category goods. Computer and Communications, Vol. 26(2008), P. 11-14

Google Scholar