[PDF] Top 20 Exact and Heuristic Algorithms for the q-mode Problem

... search algorithms in combinatorial optimization problems (also referred to in literature as local search ...effective heuristic unless we can search the neighborhood ... See full document

... the exact and heuristic algorithms that cluster data from dif- ferent types simultaneously, ...an exact algorithm and a heuristic algorithm is available for downloading ... See full document

... problem, exact methods become impractical for instances with medium to large number of jobs and ...various heuristic algorithms. The flow-shop problem was first studied by Johnson ... See full document

... the problem of determining the optimal price and lot-size for a ...complex problem in production planning, the multi-stage lot-sizing problem with capacity ...lot-sizing problem and ... See full document

... The problem of scheduling in permutation flow shops has been extensively investigated by many ...researchers. Exact and heuristic algorithms have been proposed over the years for solving the ... See full document

... Vending Problem (MVP) , where the objective is to simultaneously minimize the total dis­ tance travelled and maximize the total reward ...this problem is the OP, where for a fixed time limit the objective ... See full document

... the problem of intermediate data placement in big data-driven ap- ...the problem is how to efficiently store and access the intermediate data taking into account the inter- and intra-job (process) ... See full document

... Paquette et al. Paquette et al. (2013), and Cordeau Cordeau (2006) formulate mixed integer programming models in which the objective function minimizes total travel time. In their formulation, there are constraints on ... See full document

... assignment problem where the results are compared with other heuristic algorithms such as genetic algorithm ...assignment problem. In [4], double meta-heuristic algorithm such as ... See full document

... this problem and then the GA and PSO algorithms with the values of 7702357 and 7703750 had the highest ...this problem and the results showed that meta-heuristic algorithms have a high ... See full document

... In this paper, researchers have some good plans to solve the proposed model. First of all, we presented two powerful recent meta-heuristics. These methods are used repeatedly in the recent papers to solve the NP- hard ... See full document

... tication, i.e., a large number of low fidelity simulations and a small number of high fidelity simulations. These are fitted to a stochastic model for predicting the uncovered area in the design space. The concept of ... See full document

... MPFCPDP problem concerning the production, transportation and storage of finished goods from ‘m’ suppliers (industrial producers) to ‘n’ customers (demand centers like assembling centers, distribution centers ... See full document

... Inventory Routing Problem addresses the issue of coordinating inventory replenishment policies and distribution plans in a cost effective manner. More precisely, the IRP integrates inventory and distribution ... See full document

... basic problem of robust subspace ...guarantee exact subspace recovery under some conditions on the underlying ...other algorithms for robust PCA on synthetic and real data sets and demonstrate ... See full document

... Covering problem firstly was introduced by ...approximation algorithms for classic bin covering and they proved that Next Fit is a 2-approximation algorithm ...approximation algorithms for this ... See full document

... view-selection algorithms that are competitive, that is, algorithms that provide optimality guarantees on their outputs without necessarily exploring the entire search space of ...view-selection ... See full document

... Mapping problem which mainly caused by terrains’ sizes and their query ...This problem is a challenge when we want to make ‘truly’ 3D WebGIS systems in equivalent to what have been represented in 2D ... See full document

... well-known heuristic approach that has been applied to a number of optimization ...Tabu heuristic combines the recent history of the optimization with iterative improvement to seek feasible ...Tabu ... See full document

... Our approach may also be seen in the context of classifier combination for string-valued variables. While ensemble methods for structured prediction have been considered in several works (see, e.g., Nguyen and Guo ... See full document