نتایج جستجو برای: sized problem
تعداد نتایج: 922679 فیلتر نتایج به سال:
abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...
in the present work, high temperature tensile properties of medium density polyethylene (mdpe) and its nanocomposites are investigated. for this purpose mdpe reinforced with different weight percentages of nano-sized calcium (2, 5, 10) are produced by compression moulding method. tensile tests have been carried out at different temperatures, i.e. 30, 60, 90c using thermomechanical analysis (tm...
A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and mathematical programming (MP) solver to solve novel model for the districting problem in public bicycle-sharing system is presented. The modelled as an integer problem. While rVNS aims find high-quality set of centres repositioning zones, MP computes optimal allocation network stations zones. We u...
In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
Owing to rising intentional events, supply chain disruptions have been considered by setting up a game between two players, namely, a designer and an interdictor contesting on minimizing and maximizing total cost, respectively. The previous studies have found the equilibrium solution by taking transportation, penalty and restoration cost into account. To contribute further, we examine how incor...
The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups. We present a simple, linear-tim...
This article considers the problem of scheduling preemptive open shops to minimize total tardiness. The problem is known to be NP-hard. An efficient constructive heuristic is developed for solving large-sized problems. A branch-and-bound algorithm that incorporates a lower bound scheme based on the solution of an assignment problem as well as various dominance rules are presented for solving me...
a significant portion of gross domestic production (gdp) in any country belongs to the transportation system. transportation equipment, in the other hand, is supposed to be great consumer of oil products. many attempts have been assigned to the vehicles to cut down greenhouse gas (ghg). in this paper a novel heuristic algorithm based on clark and wright algorithm called green clark and wright (...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید