Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...

optimization models have been used to support decision making in production planning for a long time. however, several of those models are deterministic and do not address the variability that is present in some of the data. robust optimization is a methodology which can deal with the uncertainty or variability in optimization problems by computing a solution which is feasible for all possible ...

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

In this paper the piecewise level set method is combined with phase field method to solve the shape and topology optimization problem. First, the optimization problem is formed based on piecewise constant level set method then is updated using the energy term of phase field equations. The resulting diffusion equation which updates the level set function and optimization ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

compared to conventional chlorination methods which apply chlorine at water treatment plant, booster chlorination has almost solved the problems of high dosages of chlorine residuals near water sources and lack of chlorine residuals in the remote points of a water distribution system (wds). however, control of trihalomethane (thm) formation as a potentially carcinogenic disinfection by-product ...

in recent years, wavelet packet modulation ofdm (wpm-ofdm) signals have been introduced for radar applications. these signals have important properties such as inherent high range resolution and high resistance of radar system against jamming reception. this paper investigates the problem of designing these family of signals according to the following criteria: constrained maximization of the d...

In recent years, the vigorous rise in computational intelligence has opened up new research ideas for solving chemical dynamic optimization problems, making application of swarm-intelligence techniques more and widespread. However, potential algorithms with different performances still needs to be further investigated this context. On premise, paper puts forward a universal framework, which tra...

the pupose of this paper is modeling of partial digest problem (pdp) as a mathematical programming problem. in this paper we present a new viewpoint of pdp. we formulate the pdp as a continuous optimization problem and develope a method to solve this problem. finally we constract a linear programming model for the problem with an additional constraint. this later model can be solved by the simp...