DATA-WA: Demand-based Adaptive Task Assignment with Dynamic Worker Availability Windows
University of Electronic Science and Technology of China(电子科技大学);China Mobile (Suzhou) Software Technology Co., Ltd.(中国移动(苏州)软件技术有限公司);Aalborg University(奥尔堡大学);Beijing University of Posts and Telecommunications(北京邮电大学);Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China(电子科技大学深圳高等研究院)
Jinwen Chen, Jiannan Guo, Dazhuo Qiu, Yawen Li, Guanhua Ye, Yan Zhao, Kai Zheng
With the rapid advancement of mobile networks and the widespread use of mobile devices, spatial crowdsourcing, which involves assigning location-based tasks to mobile workers, has gained significant attention. However, most existing research focuses on task assignment at the current moment, overlooking the fluctuating demand and supply between tasks and workers over time. To address this issue, we introduce an adaptive task assignment problem, which aims to maximize the number of assigned tasks by dynamically adjusting task assignments in response to changing demand and supply. We develop a spatial crowdsourcing framework, namely demand-based adaptive task assignment with dynamic worker availability windows, which consists of two components including task demand prediction and task assignment. In the first component, we construct a graph adjacency matrix representing the demand dependency relationships in different regions and employ a multivariate time series learning approach to predict future task demands. In the task assignment component, we adjust tasks to workers based on these predictions, worker availability windows, and the current task assignments, where each worker has an availability window that indicates the time periods they are available for task assignments. To reduce the search space of task assignments and be efficient, we propose a worker dependency separation approach based on graph partition and a task value function with reinforcement learning. Experiments on real data demonstrate that our proposals are both effective and efficient.
Coded Computation across Shared Heterogeneous Workers with Communication Delay
Beijing National Research Center for Information Science and Technology(北京信息科学与技术国家研究中心);Tsinghua University(清华大学);Chinese University of Hong Kong (Shenzhen)(香港中文大学(深圳));Imperial College London(伦敦帝国理工学院)
Learning to Solve Multiple-TSP with Time Window and Rejections via Deep Reinforcement Learning
Nanyang Technological University(南洋理工大学);Singapore Institute of Manufacturing Technology (SIMTech)(新加坡制造技术研究院(SIMTech));Agency for Science Technology and Research (A*STAR)(科学、技术与研究局(A*STAR));Shandong University(山东大学);Technische Universiteit Delft(代尔夫特理工大学)
Hong Kong University of Science and Technology(香港科技大学);Yale School of Management(耶鲁大学管理学院);The University of Chicago, Booth School of Business(芝加哥大学布斯商学院);Amazon(亚马逊)
Data-Aware Gradient Compression for FL in Communication-Constrained Mobile Computing
Shenzhen International Graduate School, Tsinghua University(清华大学深圳国际研究生院);AI Cloud Business Group, Baidu Incorporated(百度公司AI云业务集团);Department of Computer Science and Technology, Tsinghua University(清华大学计算机科学与技术系);Department of Computer Science and Technology, Harbin Institute of Technology(哈尔滨工业大学计算机科学与技术系);College of Computer Science and Software Engineering, Shenzhen University(深圳大学计算机与软件学院)
Instance Generation for Patient-to-room Assignment and Admission Scheduling Based on Real Hospital Data
Chair of Combinatorial Optimization, RWTH Aachen University(组合优化研究所,亚琛工业大学);Chair of Algorithms and Complexity, RWTH Aachen University(算法与复杂性研究所,亚琛工业大学)