Sparse learning framework, which is very popular in the field of nature language processing recently due to the advantages of efficiency and generalizability, can be applied to Conditional Random Fields (CRFs) with L1 regularization method. Stochastic gradient descent (SGD) method has been used in training L1-regularized CRFs, because it often requires much less training time than the batch tra...

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...

Design of Cellular Manufacturing System (CMS) involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA). These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. However; solving complexity by simultaneous consideration of these problems will be increased. In order to over come th...

In the two-stage capacitated facility location problem a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost ...

A Two-phase model for configuring a cellular manufacturing system is proposed. In phase (I), for the first time, number of cells is considered as a decision variable. In phase (II), pursing two different objectives, one minimization of underload and the other, maximization of similarity of parts within a group, the design procedure is performed. As one cannot have these two objects together, a ...

We propose a heuristic for the construction of variable-stride multibit tries. These multibit tries are suitable for one-dimensional packet classification using a pipelined architecture. The variable-stride tries constructed by our heuristic require significantly less per-stage memory than required by optimal pipelined fixed-stride tries. We also develop a tree packing heuristic, which dramatic...

In this research, we investigate a three-stage supply chain with one supplier, several manufacturers and multiple retailers where the supplier provides a common raw material to each manufacturer, who in turn uses a single stage production facility to convert it into final products that are delivered at fixed lot sizes to retailers. An integrated economic procurement, production, and delivery mo...