We present a hybrid algorithm for nonparametric maximum likelihood estimation from censored data when the log-likelihood is concave. The hybrid algorithm uses a composite algorithmic mapping combining the expectation-maximization (EM) algorithm and the (modified) iterative convex minorant (ICM) algorithm...
#include "algorithm.h" #include <boost/heap/binomial_heap.hpp> using namespace HybridAStar; //原始A*算法,用来搜索计算 holonomic-with-obstacles heuristic float aStar(Node2D &start, Node2D &goal, Node2D *nodes2D, int width, int height, CollisionDetection &configurationSpace, Visualize &visualizat...
A Hybrid Algorithm for the Vehicle Routing Problem with Soft Time Windows and Hierarchical Objectives[J] . Tharinee Manisri,Anan Mungwattana,Gerrit K. Janssens,An Caris.Journal of Information and Optimization Sciences . 2015 (3)Tharinee Manisri, Anan Mungwattana, Gerrit K. Janssens, & An ...
(2012). “A hybrid algorithm of harmony search and bees algorithm for a university course timetabling problem.” International Journal of Computer Science Issues , Vol. 9, No. 1, pp. 12–17. MathSciNetNguyen K, Nguyen P, Tran N (2012) A hybrid algorithm of harmony search and bees ...
The ant colony optimization (ACO) is one efficient approach for solving the travelling salesman problem (TSP). Here, we propose a hybrid algorithm based on
Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A Hybrid Algorithm for the Examination Timetabling Problem. In: Practice and Theory of Automated Timetabling IV, pp. 207–231. Springer, Heidelberg (2003)L. Merlot , N. Boland , B. Hughes and P. Stuckey Practice and ...
Hybrid approaches that combine different metaheuristics were used to solve VRPs as well; for example, Bortfeldt et al. [4] described a hybrid algorithm for the VRP that involves clustered backhauls and loading constraints. Beheshti and Hejazi [3] proposed a hybrid algorithm of column generation ...
clustering is useful; in Section 3 we present two approaches for ordering the data; in Section 4 we present our hybrid clustering algorithm (HCA); and in Section 5 we compare our hybrid clustering algorithm to some traditional clustering techniques (e.g. k-Means, Ward's minimum variance ...
abstract 要点现存方法主要基于领域预处理和离散化, 这在当领域为任意形状的情况下是不实际的. 本文中TSP问题的领域被泛化为平面欧几里得空间的任意连接区域. 我们提出包含基于边界的编码方案以及一个双循环的混合…
N. Baba. A hybrid algorithm for finding a global minimum. Int. J. Control 37, 929-942, 1983.Baba N.A Hybrid Algorithm for Finding a Global Minimun. International Journal of Control . 1993BABA, N., “A Hybrid Algorithm for Finding the Global Minimum”, International Journal of Control ,...