This paper suggests an algorithm to solve a three level large scale linear programming problem with fuzzy numbers, where all coefficients of the objective functions are symmetric trapezoidal fuzzy numbers. A three-level programming problem can be thought as a static version of the Stackelberg strategy. The suggested algorithm uses a linear ranking function at each level to define a crisp model ...

This paper presents a bi level large scale multi objective quadratic programming problem (BLLSMOQPP) with fuzzy parameters in the objective functions problem. In the first phase convert the fuzzy parameters of the problem to equivalent crisp problem to make it easy in solving. In the second phase use Taylor series to convert the quadratic problem to linear problem to be easy for solving with th...

Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

in recent years, significant research efforts have been devoted to the optimal planning of power systems. substation expansion planning (sep) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future demand. the large number of design variables, and combination of discrete ...

urban large-scale projects have always been a controversial topic of debates. these projects are time- and money-consuming and the rejection or approve of their functionality is based on political intentions. in the last hundred years, each of them costed billions of dollars from private or public budgeting, used technical and human resources. these risky-complex creatures are built to fulfill ...

We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...

We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...

The Steiner minimum tree problem, which asks for a minimum-length interconnection of a given set of terminals in the plane, is one of the fundamental problems in Very Large Scale Integration (VLSI) physical design. Although advances in VLSI manufacturing technologies have introduced additional routing objectives, minimum length continues to be the primary objective when routing non-critical net...

VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems and are potentially amenable to CP techniques. To the best of our knowledge, though, there has been little CP work in this domain to date. We describe a successful application of a CP based tool to a particular pin-assignment p...