the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

the advent of e-commerce has prompted many manufacturers to redesign their traditional channel structure by engaging in direct sales. in this paper, we present a dual channel inventory model based on queuing theory in a manufacturer-retailer supply chain, consisting of a traditional retail channel and a direct channel which stocks are kept in both upper and lower echelon. the system receives st...

‎this paper proposes a multi-supplier multi-product inventory model in which the suppliers have unlimited production capacity, allow delayed payment, and offer either an all-unit or incremental discount. the retailer can delay payment until after they have sold all the units of the purchased product. the retailer’s warehouse is limited, but the surplus can be stored in a rented warehouse at a...

In order to further enhance the performance of syntax parsing, for the shortcomings of hidden Markov model (HMM) in the parameter optimization, an improved syntax parsing method based on adaptive genetic annealing and HMM was presented. First, an adaptive hybrid genetic annealing algorithm was adopted to optimize HMM initial parameters. Second, the improved HMM was trained by Baum Welch algorit...

In recent years, metaheuristics have been applied with some success to the Unit Commitment (UC) problem. Methods like Simulated Annealing, Tabu Search and Evolutionary Programming can be found in several papers, presenting results that are sufficiently interesting to justify further research in the area. In this paper, a new metaheuristic approach based on GRASP Greedy Randomized Adaptive Searc...

Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive approximation of image data. This article first addresses selected computational aspects concerning image approximation on triangular meshes, before four recent image approximation algorithms, each relying on anisotropic triangulations, are discussed. The discussion includes generic triangulations o...

Two well known optimization algorithms, the Genetic Algorithm (GA) and the Simulated Annealing Algorithm (SAA), are investigated for IIR adaptive phase equalizers. For non-convex error surfaces, gradient-based algorithms often fail to find the global optimum. This work compares the ability of the GA and the SAA to achieve the global minimum solution for multi-order all-pass adaptive filters to ...

A comparison of the performance of three diierent Natural Algorithms applied to the task of IIR system identiication is presented. In all cases, stability of the adaptive lter is guaranteed through the choice of a lattice lter structure and appropriate coding of the lattice lter reeection coeecient space. We show that whilst simulated annealing-based adaptive algorithms perform well, algorithms...

Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promising [5, 2, 6, 14]. The success of this heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In par...