Bi-Level Programming Model and Taboo Search Algorithm in Industrial Location Under the Condition of Random Price

2013 ◽  
pp. 395-403 ◽  
Author(s):  
Yuan Qu ◽  
Zhong-ping Jiang
Keyword(s):  
Programming Model ◽  
Search Algorithm ◽  
Industrial Location ◽  
Taboo Search ◽  
Taboo Search Algorithm

scholarly journals Research on Cooperative Scheduling of Automated Quayside Cranes and Automatic Guided Vehicles in Automated Container Terminal

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Qianru Zhao ◽  
Shouwen Ji ◽  
Dong Guo ◽  
Xuemin Du ◽  
Hongxuan Wang
Keyword(s):  
Search Algorithm ◽  
Container Terminal ◽  
Container Terminals ◽  
Automated Guided Vehicles ◽  
Total Energy Consumption ◽  
Two Stage ◽  
Taboo Search ◽  
Automatic Guided Vehicles ◽  
Collaborative Scheduling ◽  
Taboo Search Algorithm

According to previous research studies, automated quayside cranes (AQCs) and automated guided vehicles (AGVs) in automated container terminals have a high potential synergy. In this paper, a collaborative scheduling model for AQCs and AGVs is established and the capacity limitation of the transfer platform on AQCs is considered in the model. The minimum total energy consumption of automated quayside cranes (AQCs) and Automatic Guided Vehicles (AGVs) is taken as the objective function. A two-stage taboo search algorithm is adopted to solve the problem of collaborative scheduling optimization. This algorithm integrates AQC scheduling and AGV scheduling. The optimal solution to the model is obtained by feedback from the two-stage taboo search process. Finally, the Qingdao Port is taken as an example of a data experiment. Ten small size test cases are solved to evaluate the performance of the proposed optimization methods. The results show the applicability of the two-stage taboo search algorithm since it can find near-optimal solutions, precisely and accurately.

Cross Warehouse Scheduling of Logistics Distribution and Cycle Re-Claimer Based on Heuristics Algorithm

2014 ◽  
Vol 644-650 ◽  
pp. 2606-2610 ◽  
Author(s):  
Rong Hua Ma
Keyword(s):  
Heuristic Algorithm ◽  
Programming Model ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Simulation Method ◽  
New Method ◽  
Logistics Distribution ◽  
Suboptimal Solution ◽  
Taboo Search Algorithm ◽  
Heuristics Algorithm

In the uncertain environment, the cycle re-claimer and logistics distribution cross warehouse scheduling is important and it should be optimized. The mathematical programming model is constructed, and the proposed two-stage heuristic algorithm is proposed, the optimal solution of heuristic algorithm is used as the initial value. And the taboo search algorithm is designed to improve the initial solution. In order to verify the availability of the method, the Monte Carlo simulation method is used for numerical experiment. The experiment results show that the new method can solve the suboptimal solution which close to the optimal solution in fast, and the taboo searching algorithm can improve the solution of heuristic algorithm, it has significantly improvement performance for new method, and it has good application value in practice.

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.

Sign in / Sign up

Export Citation Format

Share Document