نتایج جستجو برای: multi objective hub covering problem

تعداد نتایج: 1806651  

Journal: :Transportation Research Part C: Emerging Technologies 2017

Journal: :IEEE Access 2023

Although current technologies allow simple online banking transactions, it is vital to guarantee access bank branches both for customers and businesses. Banking branch interactions improve trust in institutions everyday situations emergencies. This research addresses the problem of location facilities. A set objective functions related socio-economic variables, geographical coverage bankers pre...

2018
Doruk Oner Altuug Karakurt Atilla Eryilmaz Cem Tekin

In this paper, we introduce the COmbinatorial Multi-Objective Multi-Armed Bandit (COMOMAB) problem that captures the challenges of combinatorial and multi-objective online learning simultaneously. In this setting, the goal of the learner is to choose an action at each time, whose reward vector is a linear combination of the reward vectors of the arms in the action, to learn the set of super Par...

Journal: :Annals OR 2013
Cem Iyigun

Abstract. Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a fa...

Journal: :تحقیقات مالی 0
مهسا رجبی دانشجوی دکتری برق ـ کنترل و سیستم، دانشگاه صنعتی خواجه نصیرالدین طوسی، تهران، ایران حمید خالوزاده استاد دانشگاه صنعتی خواجه نصیرالدین طوسی، تهران، ایران

despite the growing use of evolutionary multi-objective optimization algorithms in different categories of science, these algorithms as a powerful tool in portfolio optimization and specially solving multi-objective portfolio optimization problem is still in its early stages. in this paper, moeas have been used for solving multi-objective portfolio optimization problem in tehran stock market. f...

2011
Thibaut Lust Jacques Teghem Daniel Tuyttens

Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is almost no study of VLSNS for multiobjective optimization. We show in this paper that this technique is very efficient for the resolution of multiobjective combinatorial optimization problems. Two problems are considered: the multiobjective multidimensional knapsack pr...

Journal: :international journal of mathematical modelling and computations 0
ghasem tohidi department of mathematics, islamic azad university, central tehran branch, iran iran, islamic republic of shabnam razavyan

this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

Abstract The purpose of this study is to consider an international facility location problem under uncertainty and present an integrated model for strategic and operational planning. The paper offers two methodologies for the location selection decision. First the extended VIKOR method for decision making problem with interval numbers is presented as a methodology for strategic evaluation of po...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید