This paper presents an exact algorithm, a constructive heuristic algorithm, and a metaheuristic for the Hamiltonian p-Median Problem (HpMP). The exact algorithm is a branch-and-cut algorithm based on an enhanced p -median based formulation, which is proved to dominate an existing p -median based formulation. The constructive heuristic is a giant tour heuristic, based on a dynamic programming fo...

Abstract We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for networks where some vertices do not have the multicast capability. Computation results show tha...

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence opt...

We describe a new method for bounded model-checking of probabilistic automata (PAs), based on heuristic search and integrated into the PRISM model-checker. PA models include both probabilistic transitions and nondeterministic choice transitions. Our search-based approach aims to address weaknesses in statistical and dynamic-programming approaches to checking bounded PCTL properties of probabili...

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis...

This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the “divide and pas conquer” principle. Dynamic programming and tabu search are conj...

Combining elements of the theory of dynamic programming with features appropriate for on-line learning has led to an approach Watkins has called incre-mental dynamic programming. Here we adopt this incremental dynamic programming point of view and obtain some preliminary mathematical results relevant to understanding the capabilities and limitations of actor-critic learning systems. Examples of...

the partial differential equations for water flow and solute transport in a two-dimensional saturated domain are rendered discrete using the finite difference technique; the resulting system of algebraic equations is solved using a dynamic programming (dp) method. the advantage of the dp algorithm is that the problem is converted from solving an algebraic system of order nc(nl-1) nc(nl-1) into...

It is well known that A algorithm reduces the search space in many applications. For shortest path computations, the algorithm uses a heuristic estimator which can better guide the search to the destination. It allocates memory dynamically to store only the necessary vertices, which are those vertices in its open list and close list. Therefore, an A algorithm for the shortest paths search probl...