The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence...The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. In this paper, we review the tabu search literature on the TSP and its variations, point out trends in it, and bring out some interesting research gaps in this literature.展开更多
目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的...目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的用药数据,运用Tabu禁忌搜索算法,对真实世界喜炎平注射液治疗儿童肺炎人群的联合用药情况进行回顾性数据挖掘分析。结果在核心联用西药方面,抗感染治疗可以联用青霉素/美洛西林/阿莫西林、头孢呋辛/头孢曲松/头孢替安、阿奇霉素等;对症治疗可以联用对乙酰氨基酚/布洛芬、氨溴索+布地奈德+沙丁胺醇等;并发症治疗可以联用水合氯醛+苯巴比妥、磷酸肌酸+抗坏血酸等。在核心联用中药方面,可以联用小柴胡颗粒/小儿柴桂退热颗粒+鼻渊通窍颗粒、热毒宁注射液/蓝芩口服液/连花清瘟胶囊+开喉剑喷雾剂/口腔炎喷雾剂/双料喉风散、小儿肺咳颗粒+醒脾养儿颗粒/四磨汤口服液等。结论本研究的喜炎平注射液核心联用中西药方案,基本符合相关指南及诊疗规范,为优化临床联合用药、合理用药提供了一定的指导和参考。建议临床实际应用过程中,根据患儿的疾病进展情况,合理评估临床联合用药方案的疗效及安全性,注意用药配伍禁忌。展开更多
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS)...Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.展开更多
With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various so...With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.展开更多
By considering the eigenratio of the Laplacian matrix as the synchronizability measure,this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring.The re...By considering the eigenratio of the Laplacian matrix as the synchronizability measure,this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring.The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved.As demonstrated in the simulation results,the performance of the proposed approach outperforms the existing methods for a large variety of initial networks,both in terms of speed and quality of solutions.展开更多
In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
In China, economic centers are far from energy storage bases, so it is significant to select a proper energy transferring mode to improve the efficiency of energy usage. To solve this problem, an optimal allocation mo...In China, economic centers are far from energy storage bases, so it is significant to select a proper energy transferring mode to improve the efficiency of energy usage. To solve this problem, an optimal allocation model based on energy transfer mode was proposed after objective function for optimizing energy using efficiency was established, and then, a new Tabu search and particle swarm hybrid optimizing algorithm was proposed to find solutions. While actual data of energy demand and distribution in China were selected for analysis, the economic critical value in comparison between the long-distance coal transfer and electric power transmission was gained. Based on the above discussion, some proposals were put forward for optimal allocation of energy transfer modes in China. By comparing other three traditional methods that are based on regional price differences, freight rates and annual cost with the proposed method, the result indicates that the economic efficiency of the energy transfer can be enhanced by 3.14%, 5.78% and 6.01%, respectively.展开更多
In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency s...In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.展开更多
An optimization model for scheduling of quay cranes (QCs) and yard trailers was proposed to improve the overall efficiency of container terminals. To implement this model, a two-phase tabu search algorithm was designe...An optimization model for scheduling of quay cranes (QCs) and yard trailers was proposed to improve the overall efficiency of container terminals. To implement this model, a two-phase tabu search algorithm was designed. In the QCs scheduling phase of the algorithm, a search was performed to determine a good QC unloading operation order. For each QC unloading operation order generated during the QC's scheduling phase, another search was run to obtain a good yard trailer routing for the given QC's unloading order. Using this information, the time required for the operation was estimated, then the time of return to availability of the units was fed back to the QC scheduler. Numerical tests show that the two-phase Tabu Search algorithm searches the solution space efficiently, decreases the empty distance yard trailers must travel, decreases the number of trailers needed, and thereby reduces time and costs and improves the integration and reliability of container terminal operation systems.展开更多
文摘The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. In this paper, we review the tabu search literature on the TSP and its variations, point out trends in it, and bring out some interesting research gaps in this literature.
文摘目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的用药数据,运用Tabu禁忌搜索算法,对真实世界喜炎平注射液治疗儿童肺炎人群的联合用药情况进行回顾性数据挖掘分析。结果在核心联用西药方面,抗感染治疗可以联用青霉素/美洛西林/阿莫西林、头孢呋辛/头孢曲松/头孢替安、阿奇霉素等;对症治疗可以联用对乙酰氨基酚/布洛芬、氨溴索+布地奈德+沙丁胺醇等;并发症治疗可以联用水合氯醛+苯巴比妥、磷酸肌酸+抗坏血酸等。在核心联用中药方面,可以联用小柴胡颗粒/小儿柴桂退热颗粒+鼻渊通窍颗粒、热毒宁注射液/蓝芩口服液/连花清瘟胶囊+开喉剑喷雾剂/口腔炎喷雾剂/双料喉风散、小儿肺咳颗粒+醒脾养儿颗粒/四磨汤口服液等。结论本研究的喜炎平注射液核心联用中西药方案,基本符合相关指南及诊疗规范,为优化临床联合用药、合理用药提供了一定的指导和参考。建议临床实际应用过程中,根据患儿的疾病进展情况,合理评估临床联合用药方案的疗效及安全性,注意用药配伍禁忌。
文摘Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
基金This work was supported by the National Natural Science Foundation of China(61772196,61472136)the Hunan Provincial Focus Social Science Fund(2016ZDB006)Thanks to Professor Weijin Jiang for his guidance and suggestions on this research.Funding Statement。
文摘With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.
基金Project supported by the grant from City University of Hong Kong (Grant No. 7008105)
文摘By considering the eigenratio of the Laplacian matrix as the synchronizability measure,this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring.The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved.As demonstrated in the simulation results,the performance of the proposed approach outperforms the existing methods for a large variety of initial networks,both in terms of speed and quality of solutions.
文摘In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
基金Project(20050079008) supported by the Specialized Research Fund for the Doctoral Program of Higher Education
文摘In China, economic centers are far from energy storage bases, so it is significant to select a proper energy transferring mode to improve the efficiency of energy usage. To solve this problem, an optimal allocation model based on energy transfer mode was proposed after objective function for optimizing energy using efficiency was established, and then, a new Tabu search and particle swarm hybrid optimizing algorithm was proposed to find solutions. While actual data of energy demand and distribution in China were selected for analysis, the economic critical value in comparison between the long-distance coal transfer and electric power transmission was gained. Based on the above discussion, some proposals were put forward for optimal allocation of energy transfer modes in China. By comparing other three traditional methods that are based on regional price differences, freight rates and annual cost with the proposed method, the result indicates that the economic efficiency of the energy transfer can be enhanced by 3.14%, 5.78% and 6.01%, respectively.
文摘In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.
文摘An optimization model for scheduling of quay cranes (QCs) and yard trailers was proposed to improve the overall efficiency of container terminals. To implement this model, a two-phase tabu search algorithm was designed. In the QCs scheduling phase of the algorithm, a search was performed to determine a good QC unloading operation order. For each QC unloading operation order generated during the QC's scheduling phase, another search was run to obtain a good yard trailer routing for the given QC's unloading order. Using this information, the time required for the operation was estimated, then the time of return to availability of the units was fed back to the QC scheduler. Numerical tests show that the two-phase Tabu Search algorithm searches the solution space efficiently, decreases the empty distance yard trailers must travel, decreases the number of trailers needed, and thereby reduces time and costs and improves the integration and reliability of container terminal operation systems.
