نتایج جستجو برای: dynamic hub covering problem
تعداد نتایج: 1291239 فیلتر نتایج به سال:
one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...
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...
hub covering location problem, network design, single machine scheduling, genetic algorithm, shuffled frog leaping algorithm hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
چکیده شبکه های هاب یکی از انواع مهم شبکه های حمل ونقل هستند که در زمینه های مختلفی مانند حمل ونقل هوایی، پست و مخابرات کاربرد دارند. از ویژگی های مهم این شبکه ها، امکان وقوع اختلال در عملکرد آن ها به دلایلی ازقبیل ازکار افتادن تسهیل های هاب یا عدم دسترسی به یال های ارتباطی است. در این مطالعه، مسئله مکان یابی یال هاب پوششی با تخصیص چندگانه، تحت شرایط اختلال یال های هاب بررسی می شود. برای ای...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید