نتایج جستجو برای: bound algorithm
تعداد نتایج: 907664 فیلتر نتایج به سال:
Bus network design is an important problem in public transportation. The main step to this design, is determining the number of required terminals and their locations. This is an especial type of facility location problem, a large scale combinatorial optimization problem that requires a long time to be solved. Branch & bound and simulated annealing methods have already been used for solving Urb...
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
in this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. the proposed algorithm relaxes the accuracy requirements in the solution of the newton equation system, by using an inexact newton direction. furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
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 ...
the present study presents an algorithm that models uncertainties at the structural component level to estimate the performance reliability of rc structures. the method calculates the performance reliability using a systemic approach and incorporates the improved response surface method based on sampling blocks using the first-order reliability method and conditional reliability indices. the re...
we consider online scheduling of jobs with speci c release time on m identical machines. each job has a weight and a size; the goal is maximizing total weight of completed jobs. at release time of a job it must immediately be scheduled on a machine or it will be rejected. it is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contr...
During the last three decades, the integrated optimization approach to logistics systems has become one of the most important aspects of the supply chain optimization. This approach simultaneously considers the interdependence of the location of the facilities, suppliers/customers allocation to the facilities, the structure of transportation routes, and inventory planning and control. Location...
P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید