Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (53)
- Physical Sciences and Mathematics (53)
- Computer Engineering (40)
- Operations Research, Systems Engineering and Industrial Engineering (21)
- Databases and Information Systems (13)
-
- Software Engineering (13)
- Computer and Systems Architecture (11)
- Artificial Intelligence and Robotics (10)
- Data Storage Systems (9)
- Public Affairs, Public Policy and Public Administration (8)
- Social and Behavioral Sciences (8)
- Transportation (8)
- Digital Communications and Networking (7)
- Numerical Analysis and Scientific Computing (5)
- OS and Networks (4)
- Theory and Algorithms (4)
- Business (3)
- Graphics and Human Computer Interfaces (2)
- Advertising and Promotion Management (1)
- Electrical and Computer Engineering (1)
- Environmental Sciences (1)
- Hardware Systems (1)
- Health and Medical Administration (1)
- Information Security (1)
- Law (1)
- Law Enforcement and Corrections (1)
- Medicine and Health Sciences (1)
- Mining Engineering (1)
- Programming Languages and Compilers (1)
- Keyword
-
- Unsupervised learning (2)
- Affinity matrix (1)
- Air Pollution (1)
- Algorithm (1)
- Alignment slicing and mending (1)
-
- Amazon Mechanical Turk (1)
- Anomaly (1)
- App reviews (1)
- Approximate dynamic programming approach (1)
- Artificial neural networks (1)
- Attribute-based encryption (1)
- Avatars (1)
- Batch demand (1)
- Batteryless (1)
- Beamforming (1)
- Bundling (1)
- Capacitated Team Orienteering Problem (1)
- Carbon emissions (1)
- Categorical data representation (1)
- Categorization (1)
- Causal inference (1)
- Classification & regression tree (1)
- Cloud security (1)
- Cloud-based clusters (1)
- Cluster deployment (1)
- Clustering (1)
- Clustering algorithms (1)
- Clustering methods (1)
- Co-attention (1)
- Co-change dependencies (1)
Articles 31 - 60 of 63
Full-Text Articles in Engineering
R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao
R2gan: Cross-Modal Recipe Retrieval With Generative Adversarial Network, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Yanbin Hao
Research Collection School Of Computing and Information Systems
Representing procedure text such as recipe for crossmodal retrieval is inherently a difficult problem, not mentioning to generate image from recipe for visualization. This paper studies a new version of GAN, named Recipe Retrieval Generative Adversarial Network (R2GAN), to explore the feasibility of generating image from procedure text for retrieval problem. The motivation of using GAN is twofold: learning compatible cross-modal features in an adversarial way, and explanation of search results by showing the images generated from recipes. The novelty of R2GAN comes from architecture design, specifically a GAN with one generator and dual discriminators is used, which makes the …
Matching Passengers And Drivers With Multiple Objectives In Ride Sharing Markets, Guodong Lyu, Chung Piaw Teo, Wangchi Cheung, Hai Wang
Matching Passengers And Drivers With Multiple Objectives In Ride Sharing Markets, Guodong Lyu, Chung Piaw Teo, Wangchi Cheung, Hai Wang
Research Collection School Of Computing and Information Systems
In many cities in the world, ride sharing companies, such as Uber, Didi, Grab and Lyft, have been able to leverage on Internet-based platforms to conduct online decision making to connect passengers and drivers. These online platforms facilitate the integration of passengers and drivers’ mobility data on smart phones in real-time, which enables a convenient matching between demand and supply in real time. These clear operational advantages have motivated many similar shared service business models in the public transportation arena, and have been a disruptive force to the traditional taxi industry.
Adversarial Contract Design For Private Data Commercialization, Parinaz Naghizadeh, Arunesh Sinha
Adversarial Contract Design For Private Data Commercialization, Parinaz Naghizadeh, Arunesh Sinha
Research Collection School Of Computing and Information Systems
The proliferation of data collection and machine learning techniques has created an opportunity for commercialization of private data by data aggregators. In this paper, we study this data monetization problem as a mechanism design problem, specifically using a contract-theoretic approach. Our proposed adversarial contract design framework provides a fundamental extension to the classic contract theory set-up in order to account for the heterogeneity in honest buyers’ demands for data, as well as the presence of adversarial buyers who may purchase data to compromise its privacy. We propose the notion of Price of Adversary (PoAdv) to quantify the effects of adversarial …
Coordinating Supply And Demand On An On-Demand Service Platform With Impatient Customers, Jiaru Bai, Kut C. So, Christopher S. Tang, Xiqun Chen, Hai Wang
Coordinating Supply And Demand On An On-Demand Service Platform With Impatient Customers, Jiaru Bai, Kut C. So, Christopher S. Tang, Xiqun Chen, Hai Wang
Research Collection School Of Computing and Information Systems
We consider an on-demand service platform using earning sensitive independent providers with heterogeneous reservation price (for work participation) to serve its time and price sensitive customers with heterogeneous valuation of the service. As such, both the supply and demand are "endogenously'' dependent on the price the platform charges its customers and the wage the platform pays its independent providers. We present an analytical model with endogenous supply (number of participating agents) and endogenous demand (customer request rate) to study this on-demand service platform. To coordinate endogenous demand with endogenous supply, we include the steady-state waiting time performance based on a …
Metagraph-Based Learning On Heterogeneous Graphs, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Jiaqi Shi, Kevin Chang, Xiao-Li Li
Metagraph-Based Learning On Heterogeneous Graphs, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Jiaqi Shi, Kevin Chang, Xiao-Li Li
Research Collection School Of Computing and Information Systems
Data in the form of graphs are prevalent, ranging from biological and social networks to citation graphs and the Web. Inparticular, most real-world graphs are heterogeneous, containing objects of multiple types, which present new opportunities for manyproblems on graphs. Consider a typical proximity search problem on graphs, which boils down to measuring the proximity between twogiven nodes. Most earlier studies on homogeneous or bipartite graphs only measure a generic form of proximity, without accounting fordifferent “semantic classes”—for instance, on a social network two users can be close for different reasons, such as being classmates orfamily members, which represent two distinct …
Geometric Top-K Processing: Updates Since Mdm'16 [Advanced Seminar], Kyriakos Mouratidis
Geometric Top-K Processing: Updates Since Mdm'16 [Advanced Seminar], Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
The top-k query has been studied extensively, and is considered the norm for multi-criteria decision making in large databases. In recent years, research has considered several complementary operators to the traditional top-k query, drawing inspiration (both in terms of problem formulation and solution design) from the geometric nature of the top-k processing model. In this seminar, we will present advances in that stream of work, focusing on updates since the preliminary seminar on the same topic in MDM'16.
Single Image Reflection Removal Beyond Linearity, Qiang Wen, Yinjie Tan, Jing Qin, Wenxi Liu, Guoqiang Han, Shengfeng He
Single Image Reflection Removal Beyond Linearity, Qiang Wen, Yinjie Tan, Jing Qin, Wenxi Liu, Guoqiang Han, Shengfeng He
Research Collection School Of Computing and Information Systems
Due to the lack of paired data, the training of image reflection removal relies heavily on synthesizing reflection images. However, existing methods model reflection as a linear combination model, which cannot fully simulate the real-world scenarios. In this paper, we inject non-linearity into reflection removal from two aspects. First, instead of synthesizing reflection with a fixed combination factor or kernel, we propose to synthesize reflection images by predicting a non-linear alpha blending mask. This enables a free combination of different blurry kernels, leading to a controllable and diverse reflection synthesis. Second, we design a cascaded network for reflection removal with …
Worker Demographics And Earnings On Amazon Mechanical Turk: An Exploratory Analysis, Kotaro Hara, Kristy Milland, Benjamin V. Hanrahan, Chris Callison-Burch, Abigail Adams, Saiph Savage, Jeffrey P. Bigham
Worker Demographics And Earnings On Amazon Mechanical Turk: An Exploratory Analysis, Kotaro Hara, Kristy Milland, Benjamin V. Hanrahan, Chris Callison-Burch, Abigail Adams, Saiph Savage, Jeffrey P. Bigham
Research Collection School Of Computing and Information Systems
Prior research reported that workers on Amazon Mechanical Turk (AMT) are underpaid, earning about $2/h. But the prior research did not investigate the difference in wage due to worker characteristics (e.g., country of residence). We present the first data-driven analysis on wage gap on AMT. Using work log data and demographic data collected via online survey, we analyse the gap in wage due to different factors. We show that there is indeed wage gap; for example, workers in the U.S. earn $3.01/h while those in India earn $1.41/h on average.
Designated-Server Identity-Based Authenticated Encryption With Keyword Search For Encrypted Emails, Hongbo Li, Qiong Huang, Jian Shen, Guomin Yang, Willy Susilo
Designated-Server Identity-Based Authenticated Encryption With Keyword Search For Encrypted Emails, Hongbo Li, Qiong Huang, Jian Shen, Guomin Yang, Willy Susilo
Research Collection School Of Computing and Information Systems
In encrypted email system, how to search over encrypted cloud emails without decryption is an important and practical problem. Public key encryption with keyword search (PEKS) is an efficient solution to it. However, PEKS suffers from the complex key management problem in the public key infrastructure. Its variant in the identity-based setting addresses the drawback, however, almost all the schemes does not resist against offline keyword guessing attacks (KGA) by inside adversaries. In this work we introduce the notion of designated-server identity-based authenticated encryption with keyword search (dIBAEKS), in which the email sender authenticates the message while encrypting so that …
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao
Research Collection School Of Computing and Information Systems
The representation of categorical data with hierarchical value coupling relationships (i.e., various value-to-value cluster interactions) is very critical yet challenging for capturing complex data characteristics in learning tasks. This paper proposes a novel and flexible coupled unsupervised categorical data representation (CURE) framework, which not only captures the hierarchical couplings but is also flexible enough to be instantiated for contrastive learning tasks. CURE first learns the value clusters of different granularities based on multiple value coupling functions and then learns the value representation from the couplings between the obtained value clusters. With two complementary value coupling functions, CURE is instantiated into …
Emerging App Issue Identification From User Feedback: Experience On Wechat, Cuiyun Gao, Wujie Zheng, Yuetang Deng, David Lo, Jichuan Zeng, Michael R. Lyu, Irwin King
Emerging App Issue Identification From User Feedback: Experience On Wechat, Cuiyun Gao, Wujie Zheng, Yuetang Deng, David Lo, Jichuan Zeng, Michael R. Lyu, Irwin King
Research Collection School Of Computing and Information Systems
It is vital for popular mobile apps with large numbers of users to release updates with rich features while keeping stable user experience. Timely and accurately locating emerging app issues can greatly help developers to maintain and update apps. User feedback (i.e., user reviews) is a crucial channel between app developers and users, delivering a stream of information about bugs and features that concern users. Methods to identify emerging issues based on user feedback have been proposed in the literature, however, their applicability in industry has not been explored. We apply the recent method IDEA to WeChat, a popular messenger …
Towards Personalized Data-Driven Bundle Design With Qos Constraint, Mustafa Misir, Hoong Chuin Lau
Towards Personalized Data-Driven Bundle Design With Qos Constraint, Mustafa Misir, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we study the bundle design problem for offering personalized bundles of services using historical consumer redemption data. The problem studied here is for an operator managing multiple service providers, each responsible for an attraction, in a leisure park. Given the specific structure of interactions between service providers, consumers and the operator, a bundle of services is beneficial for the operator when the bundle is underutilized by service consumers. Such revenue structure is commonly seen in the cable television and leisure industries, creating strong incentives for the operator to design bundles containing lots of not-so-popular services. However, as …
Community Discovery In Heterogeneous Social Networks, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Community Discovery In Heterogeneous Social Networks, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Research Collection School Of Computing and Information Systems
Discovering social communities of web users through clustering analysis of heterogeneous link associations has drawn much attention. However, existing approaches typically require the number of clusters a priori, do not address the weighting problem for fusing heterogeneous types of links, and have a heavy computational cost. This chapter studies the commonly used social links of users and explores the feasibility of the proposed heterogeneous data co-clustering algorithm GHF-ART, as introduced in Sect. 3.6, for discovering user communities in social networks. Contrary to the existing algorithms proposed for this task, GHF-ART performs real-time matching of patterns and one-pass learning, which guarantees …
Incentivizing Collaboration In A Competition, Arunesh Sinha, Michael P. Wellman
Incentivizing Collaboration In A Competition, Arunesh Sinha, Michael P. Wellman
Research Collection School Of Computing and Information Systems
Research and design competitions aim to promote innovation or creative production, which are often best achieved through collaboration. The nature of a competition, however, typically necessitates sorting by individual performance. This presents tradeoffs for the competition designer, between incentivizing global performance and distinguishing individual capability. We model this situation in terms of an abstract collaboration game, where individual effort also benefits neighboring agents. We propose a scoring mechanism called LSWM that rewards agents based on localized social welfare. We show that LSWM promotes global performance, in that social optima are equilibria of the mechanism. Moreover, we establish conditions under which …
Re-Org: An Online Repositioning Guidance Agent, Muralidhar Konda, Pradeep Varakantham, Aayush Saxena, Meghna Lowalekar
Re-Org: An Online Repositioning Guidance Agent, Muralidhar Konda, Pradeep Varakantham, Aayush Saxena, Meghna Lowalekar
Research Collection School Of Computing and Information Systems
No abstract provided.
Interaction-Aware Arrangement For Event-Based Social Networks, Feifei Kou, Zimu Zhou, Hao Cheg, Junping Du, Yexuan Shi, Pan Xu
Interaction-Aware Arrangement For Event-Based Social Networks, Feifei Kou, Zimu Zhou, Hao Cheg, Junping Du, Yexuan Shi, Pan Xu
Research Collection School Of Computing and Information Systems
No abstract provided.
Route Planning For A Fleet Of Electric Vehicles With Waiting Times At Charging Stations, Baoxiang Li, Shashi Shekhar Jha, Hoong Chuin Lau
Route Planning For A Fleet Of Electric Vehicles With Waiting Times At Charging Stations, Baoxiang Li, Shashi Shekhar Jha, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Electric Vehicles (EVs) are the next wave of technology in the transportation industry. EVs are increasingly becoming common for personal transport and pushing the boundaries to become the mainstream mode of transportation. Use of such EVs in logistic fleets for delivering customer goods is not far from becoming reality. However, managing such fleet of EVs bring new challenges in terms of battery capacities and charging infrastructure for efficient route planning. Researchers have addressed such issues considering different aspects of the EVs such as linear battery charging/discharging rate, fixed travel times, etc. In this paper, we address the issue of waiting …
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 …
Wiwear: Wearable Sensing Via Directional Wifi Energy Harvesting, Huy Vu Tran, Archan Misra, Jie Xiong, Rajesh Krishna Balan
Wiwear: Wearable Sensing Via Directional Wifi Energy Harvesting, Huy Vu Tran, Archan Misra, Jie Xiong, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Energy harvesting, from a diverse set of modes such as light or motion, has been viewed as the key to developing batteryless sensing devices. In this paper, we develop the nascent idea of harvesting RF energy from WiFi transmissions, applying it to power a prototype wearable device that captures and transmits accelerometer sensor data. Our solution, WiWear, has two key innovations: 1) beamforming WiFi transmissions to significantly boost the energy that a receiver can harvest ~23 meters away, and 2) smart zero-energy, triggering of inertial sensing, that allows intelligent duty-cycled operation of devices whose transient power consumption far exceeds what …
Ict: In-Field Calibration Transfer For Air Quality Sensor Deployments, Yun Cheng, Xiaoxi He, Zimu Zhou, Lothar Thiele
Ict: In-Field Calibration Transfer For Air Quality Sensor Deployments, Yun Cheng, Xiaoxi He, Zimu Zhou, Lothar Thiele
Research Collection School Of Computing and Information Systems
Recent years have witnessed a growing interest in urban air pollution monitoring, where hundreds of low-cost air quality sensors are deployed city-wide. To guarantee data accuracy and consistency, these sensors need periodic calibration after deployment. Since access to ground truth references is often limited in large-scale deployments, it is difficult to conduct city-wide post-deployment sensor calibration. In this work we propose In-field Calibration Transfer (ICT), a calibration scheme that transfers the calibration parameters of source sensors (with access to references) to target sensors (without access to references). On observing that (i) the distributions of ground truth in both source and …
An Artificial Bee Colony-Based Hybrid Approach For Waste Collection Problem With Midway Disposal Pattern, Qu Wei, Zhaoxia Guo, Hoong Chuin Lau, Zhenggang He
An Artificial Bee Colony-Based Hybrid Approach For Waste Collection Problem With Midway Disposal Pattern, Qu Wei, Zhaoxia Guo, Hoong Chuin Lau, Zhenggang He
Research Collection School Of Computing and Information Systems
This paper investigates a waste collection problem with the consideration of midway disposal pattern. An artificial bee colony (ABC)-based hybrid approach is developed to handle this problem, in which the hybrid ABC algorithm is proposed to generate the better optimum-seeking performance while a heuristic procedure is proposed to select the disposal trip dynamically and calculate the carbon emissions in waste collection process. The effectiveness of the proposed approach is validated by numerical experiments. Experimental results show that the proposed hybrid approach can solve the investigated problem effectively. The proposed hybrid ABC algorithm exhibits a better optimum-seeking performance than four popular …
Fc2: Cloud-Based Cluster Provisioning For Distributed Machine Learning, Nguyen Binh Duong Ta
Fc2: Cloud-Based Cluster Provisioning For Distributed Machine Learning, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
Training large, complex machine learning models such as deep neural networks with big data requires powerful computing clusters, which are costly to acquire, use and maintain. As a result, many machine learning researchers turn to cloud computing services for on-demand and elastic resource provisioning capabilities. Two issues have arisen from this trend: (1) if not configured properly, training models on cloud-based clusters could incur significant cost and time, and (2) many researchers in machine learning tend to focus more on model and algorithm development, so they may not have the time or skills to deal with system setup, resource selection …
Cryptocurrency Mining On Mobile As An Alternative Monetization Approach, Nguyen Phan Sinh Huynh, Kenny Choo, Rajesh Krishna Balan, Youngki Lee
Cryptocurrency Mining On Mobile As An Alternative Monetization Approach, Nguyen Phan Sinh Huynh, Kenny Choo, Rajesh Krishna Balan, Youngki Lee
Research Collection School Of Computing and Information Systems
Can cryptocurrency mining (crypto-mining) be a practical ad-free monetization approach for mobile app developers? We conducted a lab experiment and a user study with 228 real Android users to investigate different aspects of mobile crypto-mining. In particular, we show that mobile devices have computational resources to spare and that these can be utilized for crypto-mining with minimal impact on the mobile user experience. We also examined the profitability of mobile crypto-mining and its stability as compared to mobile advertising. In many cases, the profit of mining can exceed mobile advertising's. Most importantly, our study shows that the majority (72%) of …
Multiagent Decision Making For Maritime Traffic Management, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Multiagent Decision Making For Maritime Traffic Management, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We address the problem of maritime traffic management in busy waterways to increase the safety of navigation by reducing congestion. We model maritime traffic as a large multiagent systems with individual vessels as agents, and VTS authority as the regulatory agent. We develop a maritime traffic simulator based on historical traffic data that incorporates realistic domain constraints such as uncertain and asynchronous movement of vessels. We also develop a traffic coordination approach that provides speed recommendation to vessels in different zones. We exploit the nature of collective interactions among agents to develop a scalable policy gradient approach that can scale …
Deception In Finitely Repeated Security Games, Thanh H. Nguyen, Yongzhao Wang, Arunesh Sinha, Michael P. Wellman
Deception In Finitely Repeated Security Games, Thanh H. Nguyen, Yongzhao Wang, Arunesh Sinha, Michael P. Wellman
Research Collection School Of Computing and Information Systems
Allocating resources to defend targets from attack is often complicated by uncertainty about the attacker’s capabilities, objectives, or other underlying characteristics. In a repeated interaction setting, the defender can collect attack data over time to reduce this uncertainty and learn an effective defense. However, a clever attacker can manipulate the attack data to mislead the defender, influencing the learning process toward its own benefit. We investigate strategic deception on the part of an attacker with private type information, who interacts repeatedly with a defender. We present a detailed computation and analysis of both players’ optimal strategies given the attacker may …
Multiagent Decision Making For Maritime Traffic Management, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Multiagent Decision Making For Maritime Traffic Management, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We address the problem of maritime traffic management in busy waterways to increase the safety of navigation by reducing congestion. We model maritime traffic as a large multiagent systems with individual vessels as agents, and VTS authority as the regulatory agent. We develop a maritime traffic simulator based on historical traffic data that incorporates realistic domain constraints such as uncertain and asynchronous movement of vessels. We also develop a traffic coordination approach that provides speed recommendation to vessels in different zones. We exploit the nature of collective interactions among agents to develop a scalable policy gradient approach that can scale …
Topical Co-Attention Networks For Hashtag Recommendation On Microblogs, Yang Li, Ting Liu, Jingwen Hu, Jing Jiang
Topical Co-Attention Networks For Hashtag Recommendation On Microblogs, Yang Li, Ting Liu, Jingwen Hu, Jing Jiang
Research Collection School Of Computing and Information Systems
Hashtags provide a simple and natural way of organizing content in microblog services. Along with the fast growing of microblog services, the task of recommending hashtags for microblogs has been given increasing attention in recent years. However, much of the research depends on hand-crafted features. Motivated by the successful use of neural models for many natural language processing tasks, in this paper, we adopt an attention based neural network to learn the representation of a microblog post. Unlike previous works, which only focus on content attention of microblogs, we propose a novel Topical CoAttention Network (TCAN) that jointly models content …
A Coordination Framework For Multi-Agent Persuasion And Adviser Systems, Budhitama Subagdja, Ah-Hwee Tan, Yilin Kang
A Coordination Framework For Multi-Agent Persuasion And Adviser Systems, Budhitama Subagdja, Ah-Hwee Tan, Yilin Kang
Research Collection School Of Computing and Information Systems
Assistive agents have been used to give advices to the users regarding activities in daily lives. Although adviser bots are getting smarter and gaining more popularity these days they are usually developed and deployed independent from each other. When several agents operate together in the same context, their advices may no longer be effective since they may instead overwhelm or confuse the user if not properly arranged. Only little attentions have been paid to coordinating different agents to give different advices to a user within the same environment. However, aligning the advices on-the-fly with the appropriate presentation timing at the …
Routing And Scheduling For A Last-Mile Transportation System, Hai Wang
Routing And Scheduling For A Last-Mile Transportation System, Hai Wang
Research Collection School Of Computing and Information Systems
The last-mile problem concerns the provision of travel services from the nearest public transportation node to a passenger’s home or other destination. We study the operation of an emerging last-mile transportation system (LMTS) with batch demands that result from the arrival of groups of passengers who desire last-mile service at urban metro stations or bus stops. Routes and schedules are determined for a multivehicle fleet of delivery vehicles, with the objective of minimizing passenger waiting time and riding time. An exact mixed-integer programming (MIP) model for LMTS operations is presented first, which is difficult to solve optimally within acceptable computational …
A State Aggregation Approach For Stochastic Multiperiod Last-Mile Ride-Sharing Problems, Lucas Agussurja, Shih-Fen Cheng, Hoong Chuin Lau
A State Aggregation Approach For Stochastic Multiperiod Last-Mile Ride-Sharing Problems, Lucas Agussurja, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The arrangement of last-mile services is playing an increasingly important role in making public transport more accessible. We study the use of ridesharing in satisfying last-mile demands with the assumption that demands are uncertain and come in batches. The most important contribution of our paper is a two-level Markov decision process framework that is capable of generating a vehicle-dispatching policy for the aforementioned service. We introduce state summarization, representative states, and sample-based cost estimation as major approximation techniques in making our approach scalable. We show that our approach converges and solution quality improves as sample size increases. We also apply …