In this article we consider the Rural Postman Problem with Time Windows (RPPTW) for the undirected case. The problem occurs in the monitoring of roads for black-ice detection. We give different formulations and compare them on sets of instances adapted from the literature. We propose a cutting plane algorithm to solve the problem based on valid inequalities for the Traveling Salesman Problem wi...

Due to Windows NT’s widespread acceptance on desktops in business and industry, it is also being considered for use in real-time systems. The fact that Windows NT is a general-purpose operating system complicates its application into a real-time environment. We have performed an extensive performance evaluation of Windows NT to determine if we can use it in the development of future real-time s...

flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

This study determines the major difference between rumors and non-rumors and explores rumor classification performance levels over varying time windows-from the first three days to nearly two months. A comprehensive set of user, structural, linguistic, and temporal features was examined and their relative strength was compared from near-complete date of Twitter. Our contribution is at providing...

Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T , find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified ti...

In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several customer locations. Two mixed integer linear programming formulations are presented for this problem: a classical arc flow model and a sequential assignment model. Several polyhedral results are provided for the second f...

Advanced Planning and Scheduling systems (APS) are intensively utilized in the industry, namely because they allow generating and analyzing planning scenarios very quickly. They are not well suited for make-to-order situations since due dates are not considered hard constraints to be fulfilled. Processing time windows allow to take into account due dates in the development of APS enhanced heuri...

Navigation of multiple mobile robots using neuro-fuzzy controller has been discussed in this paper. In neuro-fuzzy controller the output from the neural network is fed as an input to fuzzy controller and the final outputs from the fuzzy controller are used for motion control of robots. The inputs to the neural network are obtained from the robot sensors (such as left, front, right obstacle dist...

In this paper, we propose a new defects recognition algorithm for dynamic image based on “super fuzzy” feature. With this algorithm, the image is divided into some variable windows, and the eigenvector of each window is constructed. We introduce “super fuzzy” vector to make window vectors “super fuzzy” processing, thus the window feature has “super fuzzy” characteristic with the difference of t...

In this paper ,we fuzzify the new class of algebraic structure introduced by Kim[5].In this fuzzification(called fuzzy KS-semigroups),we introduce the notions of fuzzy sub KS-semigroups,fuzzy KS-ideal,fuzzy KS-p-ideal and investigate some of their related properties.The purpose of this study is to implement the fuzzy set theory and ideal theory in the KS-semigroups.This fuzzification leads to d...