this paper studies a new multi-objective fuzzy optimization prob- lem. the objective function of this study has dierent levels. therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. we study this problem and determine some special structures related...

majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. however in real-world applications, these assumptions are not well-matched with reality. in this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the cap...

in this paper, a location allocation (la) problem in construction and demolition (c&d;) waste management (wm) is studied. a bi-level model for this problem under a fuzzy random environment is presented where the upper level is the governments who sets up the processing centers, and the lower level are the administrators of different construction projects who control c&d; waste and the after tre...

ZRAM is a software library which renders the power of parallel computers usable for combinatorial optimization and enumeration. It provides a set of parallel search engines for branch-and-bound, reverse search, backtrack¬ ing and tree-size estimation. These search engines hide the complexity of parallelism from the application programmer. ZRAM contains the first parallel implementation of the r...

Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumera...

In this paper we propose convex and LP bounds for Standard Quadratic Programming (StQP) problems and employ them within a branch-and-bound approach. We first compare different bounding strategies for StQPs in terms both of the quality of the bound and of the computation times. It turns out that the polyhedral bounding strategy is the best one to be used within a branch-and-bound scheme. Indeed,...

Residential demand response is one of the key enabling technologies which plays an important role in managing load prosumers. However, scheduling problem becomes quite challenging due to involvement dynamic parameters and renewable energy resources. This work has proposed a bi-level mechanism with electricity pricing integrated storage system overcome this problem. The first level involves form...

PT XYZ as the best and largest Bed Sheet Set company in Indonesia with products such Covers, Sheets, Pillowcases, Bolsters Blankets. The Traveling Salesman Problem (TSP) is a problem faced finding route to visit shops that sell from BIG. A shop carried out on condition each city can only be visited once except of origin. algorithms applied this TSP include Complete Enumeration, Branch & Bou...