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.

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.

Study on Tabu Search Algorithm for Min-Max Vehicle Routing Problem

2011 ◽  
Vol 63-64 ◽  
pp. 160-163
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Routing Problem

The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the longest route 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.

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.

Improved Heuristic Search Algorithm for Multi-Cargo Loading Problem

2012 ◽  
Vol 253-255 ◽  
pp. 1482-1485
Author(s):  
Chun Yu Ren
Keyword(s):  
Heuristic Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Heuristic Search Algorithm ◽  
Loading Problem

The paper is focused on the Multi-cargo Loading Problem (MCLP). And solve this type of problems utilizing improved Heuristic Search Algorithm from the overall situation. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-exchange 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.

Study on Improved Tabu Search Algorithm for Min-Max Vehicle Routing Problem

2011 ◽  
Vol 87 ◽  
pp. 178-181 ◽  
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Routing Problem

The paper is focused on the Min-Max Vehicle Routing Problem. And solve this type of problems utilizing improved tabu search algorithm from the overall situation. According to the features of the problem, the essay centered the longest route to construct neighborhood structure. For the operation, 1-exchange 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.

Improved Heuristic Search Algorithm for Multi-Vehicle and Multi-Cargo Loading Problem

2013 ◽  
Vol 278-280 ◽  
pp. 2289-2292
Author(s):  
Chun Yu Ren
Keyword(s):  
Heuristic Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Loading Capacity ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Heuristic Search Algorithm ◽  
Algorithm Construct ◽  
Loading Problem

This paper studies multi-vehicle and multi-cargo loading problem under the limited loading capacity. According to the characteristics of model, improved Heuristic Search Algorithm is used to get the optimization solution. Firstly, on the basis of cubage-weight balance algorithm, construct initial solution to improve the feasibility. Secondly, adopt the operations of 1-exchange and 2-opt* to 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.

Tabu Search Algorithm for for Capacitated Vehicle Routing Problem

2013 ◽  
Vol 753-755 ◽  
pp. 3060-3063
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Neighborhood Structure ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

The paper is focused on the capacitated vehicle routing problem. 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 build 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.

New Tabu Search Algorithm for Multi-Vehicle and Multi-Cargo Loading Problem

2014 ◽  
Vol 886 ◽  
pp. 589-592
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Loading Capacity ◽  
Tabu Search Algorithm ◽  
Insertion Method ◽  
Loading Problem

This paper studies multi-vehicle and multi-cargo loading problem under the limited loading capacity. The new tabu search algorithm is used to get the solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; centers cubage-weight balance to design dual layered random operation to construct its neighborhood, to boost the efficiency and quality of the searching. Applies auto adaptive tabu length to control the searching capability dynamically; at last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.

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

scholarly journals An Order Effect of Neighborhood Structures in Variable Neighborhood Search Algorithm for Minimizing the Makespan in an Identical Parallel Machine Scheduling

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Ibrahim Alharkan ◽  
Khaled Bamatraf ◽  
Mohammed A. Noman ◽  
Husam Kaid ◽  
Emad S. Abouel Nasr ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Order Effect ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Neighborhood Structure ◽  
Identical Parallel Machine ◽  
Neighborhood Structures

Variable neighborhood search (VNS) algorithm is proposed for scheduling identical parallel machine. The objective is to study the effect of adding a new neighborhood structure and changing the order of the neighborhood structures on minimizing the makespan. To enhance the quality of the final solution, a machine based encoding method and five neighborhood structures are used in VNS. Two initial solution methods which were used in two versions of improved VNS (IVNS) are employed, namely, longest processing time (LPT) initial solution, denoted as HIVNS, and random initial solution, denoted as RIVNS. The proposed versions are compared with LPT, simulated annealing (SA), genetic algorithm (GA), modified variable neighborhood search (MVNS), and improved variable neighborhood search (IVNS) algorithms from the literature. Computational results show that changing the order of neighborhood structures and adding a new neighborhood structure can yield a better solution in terms of average makespan.

Sign in / Sign up

Export Citation Format

Share Document