A Tabu Search Algorithm for a Routing and Container Loading Problem

2006 ◽  
Vol 40 (3) ◽  
pp. 342-350 ◽  
Author(s):  
Michel Gendreau ◽  
Manuel Iori ◽  
Gilbert Laporte ◽  
Silvano Martello
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Container Loading ◽  
Loading Problem ◽  
Container Loading Problem

Study on Tabu Search Algorithm for Multi-Cargo Loading Problem

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Loading Problem

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.

A tabu search algorithm for the pallet loading problem

OR Spectrum ◽  
2005 ◽  
Vol 27 (1) ◽  
pp. 43-61 ◽  
Author(s):  
R. Alvarez-Valdes ◽  
F. Parre�o ◽  
J. M. Tamarit
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Pallet Loading ◽  
Loading Problem

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

2013 ◽  
Vol 345 ◽  
pp. 3-6
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Bearing Capacity ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Neighborhood Structure ◽  
Loading Problem ◽  
Annealing Algorithm

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.

Fast Tabu Search Algorithm for Solving Multi-Vehicle and Multi-Cargo Loading Problem

2013 ◽  
Vol 655-657 ◽  
pp. 2397-2400
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Loading Capacity ◽  
Tabu Search Algorithm ◽  
Speed Of Convergence ◽  
Taboo Search ◽  
Insertion Method ◽  
Loading Problem ◽  
Taboo Search Algorithm

This paper studies multi-vehicle and multi-cargo loading problem under the limited loading capacity. According to the characteristics of model and problem, fast taboo search algorithm is used to get the optimization solution from the overall situation. Firstly, it applies newly improved insertion method to construct initial solution in order to improve the feasibility of the solution. Secondly, it centers cubage-weight balance to design three operations for fastening the speed of convergence, stock elite to improve the searching efficiency of algorithm. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples for solving practical problems.

A beam search algorithm for the biobjective container loading problem

2020 ◽  
Vol 286 (2) ◽  
pp. 417-431
Author(s):  
Ignacio Araya ◽  
Mauricio Moyano ◽  
Cristobal Sanchez
Keyword(s):  
Search Algorithm ◽  
Beam Search ◽  
Container Loading ◽  
Loading Problem ◽  
Container Loading Problem
Sign in / Sign up

Export Citation Format

Share Document