نتایج جستجو برای: dynamic hub covering problem
تعداد نتایج: 1291239 فیلتر نتایج به سال:
The biggest challenges faced in big cities are greenhouse gas emission and growing energy needs. Efficient utilization of existing infrastructures has a prominent role in response to the challenges. Energy hub approach embraces performance of different energy networks. Energy hub is defined as a super node in electrical system receiving distinctive energy carriers such as gas and electricity in...
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
In this paper, we identify a fundamental algorithmic problem that we term space-constrained dynamic covering (SCDC), arising in many modern-day web applications, including ad-serving and online recommendation systems in eBay and Netflix. Roughly speaking, SCDC applies two restrictions to the well-studied Max-Coverage problem [9]: Given an integer k, X = {1, 2, . . . , n} and I = {S1, . . . , Sm...
This paper considers the discrete two-hub location problem. We need to choose two hubs from a set of nodes. The remaining nodes are to be connected to one of the two hubs which act as switching points for intemodal flows. A configuration which minimizes the total flow cost needs to be found. We show that the problem can be solved in polynomial dme when the hub locations are fixed. Since there a...
Two robust nonlinear controllers along with a nonlinear observer have been developed in this study to control a 1D nonlinear flexible spacecraft. The first controller is based on dynamic inversion, while the second one is composed of dynamic inversion and µ-synthesis controllers. The extension of dynamic inversion approach to flexible spacecraft is impeded by the non-minimum phase characteristi...
The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either single or multiple allocation. Both pro...
The concept of Receding Horizon Control (RHC) is introduced into Genetic Algorithm (GA) in this paper to solve the problem of Arrival Scheduling and Sequencing (ASS) at a busy hub airport. A GA based method is proposed for solving the dynamic ASS problem, and the focus is put on the methodology of integrating the RHC strategy into the GA for real-time implementations in a dynamic environment of...
We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch may yield high costs. Instead, the hub operator may wait to consolidate with future arrivals. A consolidation policy...
We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuri...
This paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not linear but stepwise and the capacity of a hub restricts the amount of traffic transiting through the hub rather than the incoming traffic. In this paper both an exact and a he...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید