Papers by Keyword: Tabu Search

Abstract: The goal is to minimize the sum of operating cost and passengers’ travel cost, and establish an optimized combinational scheduling model of Bus Rapid Transit (BRT) combined with regular bus, express bus and shuttle bus. A mixed genetic algorithm based on tabu search algorithm (GA-TS) has been designed after analyzing the fundamental principle of genetic algorithm (GA) and tabu search (TS). A case study has been carried out on the combinational scheduling optimization of a selecting BRT line. By adopting the combinational scheduling model, 5.24% of the total system cost can be saved, which is quite prominent. The mixed genetic algorithm based on GA-TS can optimize the BRT scheduling system, shorten the turnaround time of operating BRT vehicles, effectively reduce the total system cost of BRT and improve decision-making efficiency and service quality.

Abstract: The image registration is a very important task in image processing. In the field of medical imaging, it is used to compare the anatomical structures of two or more images taken at different time to track for example the evolution of a disease. Intensity-based techniques are widely used in the multi-modal registration. To have the best registration, a cost function expressing the similarity between these images is maximized. The registration problem is reduced to the optimization of a cost function. We propose to use neighborhood meta-heuristics (tabu search, simulated annealing) and a meta-heuristic population (genetic algorithms). An evaluation step is necessary to estimate the quality of registration obtained. In this paper we present some results of medical image registration

Abstract: The regional aviation as an important part of the modern air transportation system has a very important role in building the perfect route network, accelerating the expansion of air transportation and promoting the development of regional society and economy. Based on a full consideration of the rich tourism resources of the Northeast region, reducing costs and improving the convenience of the traveling of passengers, and improving the benefits of airlines, all these problems can be changed into direct flight routes between non-hub cities, so that a mixed integer linear programming model can be builded that it can make the lowest operating costs in the entire route network. With tabu search method and the shortest path algorithm to solve the model, so as to obtain the Northeast route layout scheme, and verify the feasibility of the scheme.

Abstract: Public transit crew scheduling problem is to carry out the operations task with the minimum drivers and operational cost. It is a multi-objective programming problem, which is well-known to be NP-hard. Restrained by the operational constraints and labor agreement, all the feasible sets of shifts were pre-generated in this paper. This work established a penalty function to ensure the validity of the schedule, and a cost function to reduce costs. With the help of Tabu Search, a solution can be found easily. A computational experiment based on the real-world crew scheduling problem in China demonstrates the strength of this method.

Abstract: In this study, the Tabu search (TS) algorithm is introduced into the optimal sensor placement (OSP) problem in the field of the structural health monitoring and moving force identification. A TS-based OSP procedure is proposed and further evaluated by some numerical simulations on a 2D planar truss model. The mean values of off-diagonal elements in a modal assurance criterion (MAC) matrix are used as the optimization objective function. Based on the criteria of MAC, determinant of fisher matrix, matrix condition number, and the least mean square error, the TS-based OSP procedure is evaluated through comparing with ones due to both of the energy coefficient-effective independence (ECEFI) and the effective independence (EFI) algorithms. The results show that the proposed TS-based OSP procedure is feasible with a higher accuracy.

Abstract: Aiming at general constraints in vehicle routing problem in workshop, this paper improve and simplify some relative constraints to make it more in line with real conditions in workshop. Different situations are discussed and experimentally computed respectively. The results show that tabu search is effective to get satisfactory algorithmic solutions, and this problem can be expanded to meet more additional constraints.

Abstract: Algorithms based on Simulated Annealing and Tabu search has been proposed and implemented on scheduling a problem of parallel machines. The identical parallel machine scheduling problem has been considered to minimize the total flow-time subject to optimal makespan. The proposed algorithms have two phases. In the first phase, an initial solution has been obtained using Longest Processing Time (LPT) dispatching rule and in the second phase, simulated annealing and tabu search have been applied to reach a near optimal solution. The performance of the both proposed algorithms have been evaluated by comparing their results for different number of jobs and processing times. The computational results indicate that the proposed Tabu Search algorithm is capable of obtaining better solutions for the given scheduling problem as compared to the Simulated Annealing algorithm. Although both of these algorithms provide the best solutions as compared to the other heuristic algorithms but in comparison of these two; Tabu Search provides the better solutions for the given problem.

Abstract: The paper presented an optimization scheduling problem in complex conditions. A genetic algorithm and tabu search hybrid algorithm (GATS) was designed to solve this problem. The algorithm used the global optimization capacity of genetic algorithm and the local hill climbing advantage of tabu search in the search process. The principium of the algorithm was introduced and a contrast experiment was carried out. The experiment and the analysis indicate the validity of the GATS to the optimization scheduling problem in complex conditions.

Abstract: Since the 1970s, with the in-depth study of graph partitioning, we have found that, graph partitioning, both in the fields of academic researches and engineering applications, has its own important applications, such as the layout of the fiber-optic network in telecommunication network. Therefore, the graph partitioning problem has been widespread concerning and largely studied by the scholars at home and abroad. Tabu search, as one of the modern optimization algorithm, has been playing an invaluable effect in many fields. And by now, both graph partitioning and tabu search have been developed to a certain extent, but few people consider the integration of the two problems, coordinate optimization, so as to achieve better results. Therefore, this paper proposes a graph partitioning method based on coordination and optimization of constructive graph partitioning algorithm and tabu search algorithm and obtains a graph partitioning algorithms of good efficiency and quality. In the experimental part of the paper, optical distribution network partitioning problem is transformed into a graph partitioning model. Experimental results show that the efficiency and quality of the partitioning method are acceptable in optical distribution network division.

Abstract: In this paper we investigate the elaboration of an efficient production schedule for sustainable manufacturing systems. Because renewable energies are irregular by nature as they often depend on meteorological conditions (e.g. wind and solar energy), their use in the competitive field of manufacturing production must be addressed with caution. The challenge is to elaborate a reliable production schedule that accommodates energy stochastic fluctuations while satisfying customer and operational constraints. We propose to solve the problem using a meta-heuristic based on Tabu search and discuss major elements that are critical to the success of this approach.