Graph Partition Based Decomposition Approach for Large-Scale Railway Locomotive Assignment
نویسندگان
چکیده
منابع مشابه
Graph Partition Based Decomposition Approach for Large-Scale Railway Locomotive Assignment
Locomotive assignment is a classic planning problem in railway industry. Different models and algorithms (e.g., network flow model, MIP model, adaptive dynamic programming) are proposed to solve this problem and have got remarkable progress. In practice, the locomotives are usually in the size of hundreds to even more than a thousand. So assigning individual locomotives to trains on railway net...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملEfficient Graph Based Approach to Large Scale Role Engineering
Role engineering is the process of defining a set of roles that offer administrative benefit for Role Based Access Control (RBAC), which ensures data privacy. It is a business critical task that is required by enterprises wishing to migrate to RBAC. However, existing methods of role generation have not analysed what constitutes a beneficial role and as a result, often produce inadequate solutio...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملLarge Scale Density-friendly Graph Decomposition via Convex Programming
Algorithms for finding dense regions in an input graph have proved to be effective tools in graph mining and data analysis. Recently, Tatti and Gionis [WWW 2015] presented a novel graph decomposition (known as the locally-dense decomposition) that is similar to the well-known k-core decomposition, with the additional property that its components are arranged in order of their densities. Such a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2015
ISSN: 1874-110X
DOI: 10.2174/1874110x01509010243