hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

In this study, a new method for designing the damping controller was proposed to improve the transient power system stability in a single machine network connected to an infinite bus. The STATCOM controller problem in a wide area of the system function was considered as an optimization problem with multi-purpose objective function. Also, the Honey Bee Mating Optimization Algorithm was used to d...

one of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. several edge detectors have been developed in the past decades, although no single edge detector...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...

the problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. however, most work has paid more attention to the conditionthat machines are available during planning horizon. motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. each agent aims at minimizing ...

One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...