Quite a few problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made under uncertainty. In this paper, we focus on Fuzzy nonlinear optimization problems in the Linear Fuzzy Real (LFR) numbers. The problems will consist of fuzzy constraints and objective functions, crisp constraints with a fuzzy objective function, o...

We report on a growing class of assignment problems that are increasingly of interest and very challenging in terms of the difficulty they pose to attempts at exact solution. These problems address economic issues in the location and design of factories, hospitals, depots, transportation hubs and military bases. Others involve improvements in communication network design. In this article we sur...

different decisions, including location decisions of companies which are operating in international dynamic environment are subject to significant uncertainty.so in this research an international facility location problem under uncertainty is considered and an integrated model for strategic and operational planning is presented. in strategic level countries are assessed according to internation...

Many exact and approximate solution techniques have been used to solve facility location problems and, more generally, supply chain network design problems. Yet, the Large Neighborhood Search technique (LNS) has almost never been suggested for solving such problems, although it has proven its efficiency and flexibility in solving other complex combinatorial optimization problems. In this paper,...

abstract minimizing service cost and adverse effects on environment and society are important in waste management. due to this, landfill and transfer station location become important. this article as a practical research uses analytical hierarchy process in multi criteria decision making considering environmental and social criteria in levels of benefit, opportunity, cost and risk (bocr) for p...

Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...

In one-to-one Pickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people...

In this paper, we study a generalized version of the Weber problem finding point that minimizes sum its distances to finite number given points. our setting, these may be cut off at value [Formula: see text], and allow for option an empty solution fixed cost text]. We analyze under which circumstances problems can reduced simpler problem, also when definitely have solve more complex with cutoff...

The emergence of artificial intelligence (AI)-based optimization heuristics like genetic and ant algorithms is useful in solving many complex transportation location optimization problems. The suitability of such algorithms depends on the nature of the problem to be solved. This study examines the suitability of genetic and ant algorithms in two distinct and complex transportation problems: (1)...