The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper observes optimal replacement times for a parallel system with n units, when it is operating for successive jobs with a random working cycle. The classical approach of "whichever occurs first" and the newly proposed approach of "whichever occurs last" are respectively employed for replacements scheduled at time T and at working cycle Y , whose policies are called replacement...
In this article, we present several sufficient optimal conditions for unconstrained quadratic binary problems, which can be applied in algorithms combining with SDP relaxations in branch-and-bound approaches for the primal problem. These optimal conditions can work for many situations when the Lagrangian duality gap is not zero.
In this paper, we propose two methods for computing a sequence of circumscribing polygons for a simple polygon. These methods are based on the greedy method, and are called the na¨ıve method and pocket method. The computational complexity of the two methods is O(n2) time and O(n) space for a simple polygon with n vertexes. We applied two methods to sets of simple polygons. We measured the number of...
This paper describes an efficient implementation of a form of linear semi-infinite programming (LSIP). We look at maximizing (minimizing) a linear function over a set of constraints formed by positive trigonometric polynomials. Previous studies about LSIP are formulated using semi-definite programming (SDP), this is typically done by using the Kalman Yakubovich Popov (KYP) lemma or using a trace operation...
The vehicle routing problem (VRP) is an attractive topic in logistics research work. Multi-vehicle routing problem with time window (MVRTW) is a variant of VRP, which accommodates realistic system specifics such as capacity of multi-vehicle, time constraint and network constraint (one-way, banning of turning movement etc.). To solve the MVRPTW, an improved approach combining geographical information...
With the rapid development of information technology, the number of datasets, as well as their complexity and dimension, have been growing dramatically. This dramatic growth of biology data and non-biological commercial databases becomes a challenging issue in data mining. Classification technique is one of the major tools in the captured research area. However, the performance of classification may...
The task assignment problem of warehouse robots in the smart warehouse (TAWRSW) based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given, and the task assignment problem for picking one order is formulated into a mathematical model to minimize the total operation cost. Then a heuristic algorithm is designed to solve the task assignment...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.