Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithm (1)
- Artificial neural networks (1)
- Avatars (1)
- Capacitated Team Orienteering Problem (1)
- Clustering algorithms (1)
-
- Cultural differences (1)
- Cyclic Inventory Routing problem (1)
- Data analysis (1)
- Deep learning (1)
- Distributed processing (1)
- Graph (1)
- Image processing (1)
- Iterated Local Search (1)
- Multiple vehicles (1)
- Orienteering Problem (1)
- Query processing (1)
- Reachability (1)
- Simulated Annealing (1)
- Unsupervised learning (1)
Articles 1 - 4 of 4
Full-Text Articles in Engineering
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Research Collection School Of Computing and Information Systems
Since virtual identities such as social media profiles and avatars have become a common venue for self-expression, it has become important to consider the ways in which existing systems embed the values of their designers. In order to design virtual identity systems that reflect the needs and preferences of diverse users, understanding how the virtual identity construction differs between groups is important. This paper presents a new methodology that leverages deep learning and differential clustering for comparative analysis of profile images, with a case study of almost 100 000 avatars from a large online community using a popular avatar creation …
Efficient Distributed Reachability Querying Of Massive Temporal Graphs, Tianming Zhang, Yunjun Gao, Chen Lu, Wei Guo, Shiliang Pu, Baihua Zheng, Christian S. Jensen
Efficient Distributed Reachability Querying Of Massive Temporal Graphs, Tianming Zhang, Yunjun Gao, Chen Lu, Wei Guo, Shiliang Pu, Baihua Zheng, Christian S. Jensen
Research Collection School Of Computing and Information Systems
Reachability computation is a fundamental graph functionality with a wide range of applications. In spite of this, little work has as yet been done on efficient reachability queries over temporal graphs, which are used extensively to model time-varying networks, such as communication networks, social networks, and transportation schedule networks. Moreover, we are faced with increasingly large real-world temporal networks that may be distributed across multiple data centers. This state of affairs motivates the paper's study of efficient reachability queries on distributed temporal graphs. We propose an efficient index, called Temporal Vertex Labeling (TVL), which is a labeling scheme for distributed …
Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen
Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
This paper studies the Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) as the extension of the Single-Vehicle CIRP (SV-CIRP). The objective is to minimize both distribution and inventory costs at the customers and to maximize the collected rewards simultaneously. The problem is treated as a single objective optimization problem. A subset of customers is selected for each vehicle including the quantity to be delivered to each customer. For each vehicle, a cyclic distribution plan is developed. We construct a mathematical programming model and propose a simulated annealing (SA) metaheuristic for solving both SV-CIRP and MV-CIRP. For SV-CIRP, experimental results on benchmark …
The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team OP (CTOP) which arises in the logistics industry. In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the objective is to find a path for each vehicle in order to maximize the total collected score, without violating the capacity and time budget. We propose an Iterated Local Search (ILS) algorithm for solving the CTOP. Two strategies, either accepting a new solution as …