In this paper, tabu search algorithm, the laminated overlay has been optimized. The total thickness of the laminated structure under certain circumstances, to composite laminates maximum system reliability indices as ...
详细信息
ISBN:
(纸本)9783037852767
In this paper, tabu search algorithm, the laminated overlay has been optimized. The total thickness of the laminated structure under certain circumstances, to composite laminates maximum system reliability indices as the objective function, the composite fiber orientation angle and relative thickness of the optimized design. It is through the local neighborhood search mechanism and the corresponding tabus to avoid circuitous search criteria and standards to cut through the broken tabu excellent release from the state, thereby ensuring a variety of effective exploration in order to ultimately achieve global optimization. This article is laminated overlay design provide a new and efficient framework, the framework of the algorithm relative to the previously used method has obvious advantages: After a limited number of cycles that can converge to satisfactory results, the optimization process shows good robustness of the algorithm, and the method to solve the structural optimization of composite materials and other combinatorial optimization problems provide a new way of thinking. This paper describes the basic idea of tabu search algorithm, composition, processes, principles, and so on.
In this paper we present a tabusearch-based algorithm, which is dedicated to solving the routing and spectrum allocation problem in elastic optical networks. To evaluate performance of the proposed method, we carry a...
详细信息
ISBN:
(纸本)9781479956012
In this paper we present a tabusearch-based algorithm, which is dedicated to solving the routing and spectrum allocation problem in elastic optical networks. To evaluate performance of the proposed method, we carry a number of experiments on realistic network topologies. We compare our method with both optimal results yielded by the CPLEX solver and results obtained by heuristic algorithms that were proposed in the literature for the same optimization problem. The findings of our investigation show that the proposed tabusearch method provides the solutions close to optimal ones and it significantly outperforms the reference methods.
This paper studies the delivery and pickup vehicle routing problem with time windows. The vehicle routing problems with delivery and pickup are divided into five categories. The existing papers studied mainly the ante...
详细信息
ISBN:
(纸本)9781424420124
This paper studies the delivery and pickup vehicle routing problem with time windows. The vehicle routing problems with delivery and pickup are divided into five categories. The existing papers studied mainly the anterior four categories and this paper studies the fifth category. In the problem, each customer has two time windows and the pickup and delivery at each customer can be fulfilled by being visited once or twice. On the basis of describing the problem and the pickup and delivery integrated tactics, the delivery and pickup vehicle routing problem with time windows is modeled. A tabu search algorithm for the problem is designed by using a new solution indicating method. It is shown that the tabu search algorithm gives a better solution to this problem in a short computation time and the results are stable. This electronic document is a "live" template. The various components of your paper [title, text, heads, etc.] are already defined on the style sheet, as illustrated by the portions given in this document. (Abstract)
One of the special variants of VRP model, the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) is discussed in this paper. The objective is to minimize the total delivery cost, including vehicle fixed cost a...
详细信息
ISBN:
(纸本)9781424455690
One of the special variants of VRP model, the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) is discussed in this paper. The objective is to minimize the total delivery cost, including vehicle fixed cost and traveling variable cost. An effective parallel improving tabu search algorithm is developed to solve the model. Multiple neighborhood searching strategy and parallel improving technique are used to efficiently take advantage of the searching iterations. A waste function is introduced to evaluate the solution instead of directly calculating the total cost function. This change helps improve the convergent speed of the random searching process. Numerical experiments based on the typical CVRP and VFM instances are discussed, and the results show a satisfied performance in term of both quality and computational time.
Wireless sensor networks (WSNs) are utilized to monitor physical or environmental conditions to cooperatively send data to a main location or sink, where the data can be observed and analyzed. WSNs are usually self-co...
详细信息
ISBN:
(纸本)9781728172064
Wireless sensor networks (WSNs) are utilized to monitor physical or environmental conditions to cooperatively send data to a main location or sink, where the data can be observed and analyzed. WSNs are usually self-configured and infrastructure-less. Therefore, network lifetime is a significant parameter for evaluating the performance of WSNs. The lifetime of a network is defined as the operational time of the network, which can perform the dedicated task(s) before the first sensor node or a group of sensor nodes runs out of energy. Accordingly, a fuzzy logic-based tabusearch (TS) algorithm model is proposed to increase the lifetime of WSNs considering energy consumption and distance. The lifetime enhancement is formulated as an optimization problem. Simulation results show that the proposed TS algorithm outperforms existing algorithms such as particle swarm optimization (PSO), LEACH and hybrid LEACH-PSO by reducing the energy consumption resulting in extended network lifetime.
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 t...
详细信息
ISBN:
(纸本)9783037851371
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.
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 so...
详细信息
ISBN:
(纸本)9783037854242
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.
This study extends the well-known traveling purchaser problem (TPP) by considering a transportation time limit of perishable food in cold-chain logistics. The problem is called the traveling purchaser problem with tra...
详细信息
ISBN:
(纸本)9783031436116;9783031436123
This study extends the well-known traveling purchaser problem (TPP) by considering a transportation time limit of perishable food in cold-chain logistics. The problem is called the traveling purchaser problem with transportation time limit (TPP-TTL). The objective of the TPP-TTL is to find a route and procurement plan for the purchaser to satisfy the demand of a number of product types with minimum cost. To satisfy the product demand, the purchaser visits a number of capacitated markets, in which the available amount of products is limited. Furthermore, since the travel times cause deterioration on the perishable products, a transportation time limit is taken into account in the TPP-TTL for each product type. The problem is formulated as a mixed-integer programming model and solved by using a tabusearch (TS) algorithm. In the computational experiments, TS is carried out for a number of different-sized instances and the results are compared to the results obtained by GUROBI solver to determine the performance of the proposed algorithm. The results of the experiments show that the TS is capable to find many optimal results with less computational time than the GUROBI solver.
The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoi...
详细信息
The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.
This paper propose a new heuristic optimization approach for optimal telecommunication networks design considering both economics and reliability. tabu search algorithms are controlled by central program in order to t...
详细信息
ISBN:
(纸本)8955191197
This paper propose a new heuristic optimization approach for optimal telecommunication networks design considering both economics and reliability. tabu search algorithms are controlled by central program in order to they cooperate with other. This algorithm is called Multiple tabu search algorithm (MTSA). It improves the performance of the classical tabu search algorithm (TS) providing better computation time and enhancing solution accuracy. However, MTSA is similar to TS in that both methods avoid the local optimum and search for the global optimum. This approach is interested on the model of the reality telecommunication network. Simulation results on multiple test problems with various degrees of constraint show that this approach has high efficiency and is superior to the conventional tabualgorithm.
暂无评论