نتایج جستجو برای: objective hub covering problem
تعداد نتایج: 1435347 فیلتر نتایج به سال:
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
the problem of staff scheduling at a truck hub for loading and stripping of the trucks is an important and difficult problem to optimize the labor efficiency and cost. the trucks enter the hub at different hours a day, in different known time schedules and operating hours. in this paper, we propose a goal programming to maximize the labor efficiency via minimizing the allocation cost. the propo...
Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different trans...
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
This paper studies a combination problem of parallel machine scheduling and the covering problem. We say a combinatorial optimization problem is a covering problem if it minimizes a linear objective function under some constraints and the variables are binary. The covering problem generalizes many classic combinatorial optimization problems, e.g. the shortest path problem, the vertex cover prob...
This paper addresses the classical single and multiple allocation hub location problems with fully interconnected hubs, in which balanced round-trip flows on links are considered strategic decision making process. The use of is motivated by need to decrease empty-trip rate vehicles increase full-load vehicles. Mixed-integer programming models presented for versions problems. Numerical experimen...
in this paper, we study the problem of integrated capacitated hub location problem and seat inventory control considering concept and techniques of revenue management. we consider an airline company maximizes its revenue by utilizing the best network topology and providing proper booking limits for all itineraries and fare classes. the transportation system arises in the form of a star/star net...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید