Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (399)
- Physical Sciences and Mathematics (399)
- Artificial Intelligence and Robotics (255)
- Business (91)
- Social and Behavioral Sciences (85)
-
- Public Affairs, Public Policy and Public Administration (83)
- Transportation (81)
- Numerical Analysis and Scientific Computing (54)
- Theory and Algorithms (54)
- Operations and Supply Chain Management (16)
- Databases and Information Systems (15)
- Medicine and Health Sciences (15)
- Software Engineering (10)
- Health and Medical Administration (6)
- Asian Studies (5)
- International and Area Studies (5)
- Finance and Financial Management (4)
- E-Commerce (3)
- Management Information Systems (3)
- Computer Engineering (2)
- Environmental Sciences (2)
- OS and Networks (2)
- Sales and Merchandising (2)
- Technology and Innovation (2)
- Agricultural and Resource Economics (1)
- Communication (1)
- Computer and Systems Architecture (1)
- Health Information Technology (1)
- Keyword
-
- Optimization (20)
- Vehicle routing problem (14)
- Scheduling (13)
- Reinforcement learning (10)
- Logistics (8)
-
- Tabu search (8)
- Uncertainty (8)
- Vehicle routing (8)
- Deep reinforcement learning (7)
- MITB student (7)
- Adaptive large neighborhood search (6)
- Multi-agent systems (6)
- Orienteering Problem (6)
- Algorithms (5)
- Artificial intelligence (5)
- Combinatorial optimization (5)
- Orienteering problem (5)
- Singapore (5)
- Time windows (5)
- Constrained optimization (4)
- Cross-docking (4)
- Decision making (4)
- Iterated Local Search (4)
- Mobile crowdsourcing (4)
- Multi agent systems (4)
- Reinforcement Learning (4)
- Routing (4)
- Simulated Annealing (4)
- Transportation (4)
- Analytical models (3)
- Publication Year
Articles 31 - 60 of 417
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Quantum Relaxation For Solving Multiple Knapsack Problems, Monit Sharma, Jin Yan, Hoong Chuin Lau, Rudy Raymond
Quantum Relaxation For Solving Multiple Knapsack Problems, Monit Sharma, Jin Yan, Hoong Chuin Lau, Rudy Raymond
Research Collection School Of Computing and Information Systems
Combinatorial problems are a common challenge in business, requiring finding optimal solutions under specified constraints. While significant progress has been made with variational approaches such as QAOA, most problems addressed are unconstrained (such as Max-Cut). In this study, we investigate a hybrid quantum-classical method for constrained optimization problems, particularly those with knapsack constraints that occur frequently in financial and supply chain applications. Our proposed method relies firstly on relaxations to local quantum Hamiltonians, defined through commutative maps. Drawing inspiration from quantum random access code (QRAC) concepts, particularly Quantum Random Access Optimizer (QRAO), we explore QRAO's potential in solving large constrained …
Optimization Of Customer Service And Driver Dispatch Areas For On-Demand Food Delivery, Jingfeng Yang, Hoong Chuin Lau, Hai Wang
Optimization Of Customer Service And Driver Dispatch Areas For On-Demand Food Delivery, Jingfeng Yang, Hoong Chuin Lau, Hai Wang
Research Collection School Of Computing and Information Systems
With the rapid development and popularization of mobile and wireless communication technologies, on-demand food delivery (OFD) platforms have been able to connect restaurants, customers, and drivers in real time, drastically changing dining and food delivery services. Motivated by the critical need for supply and demand management in the on-demand food delivery market, we focus on the optimization of customer service area and driver dispatch area for on-demand food delivery services. Specifically, for each restaurant, the platform needs to decide the (1) customer service area (CSA), i.e., the surrounding area within which customers can see the restaurant’s information and order food …
Path-Choice-Constrained Bus Bridging Design Under Urban Rail Transit Disruptions, Yiyang Zhu, Jian Gang Jin, Hai Wang
Path-Choice-Constrained Bus Bridging Design Under Urban Rail Transit Disruptions, Yiyang Zhu, Jian Gang Jin, Hai Wang
Research Collection School Of Computing and Information Systems
Although urban rail transit systems play a crucial role in urban mobility, they frequently suffer from unexpected disruptions due to power loss, severe weather, equipment failure, and other factors that cause significant disruptions in passenger travel and, in turn, socioeconomic losses. To alleviate the inconvenience of affected passengers, bus bridging services are often provided when rail service has been suspended. Prior research has yielded various methodologies for effective bus bridging services; however, they are mainly based on the strong assumption that passengers must follow predetermined bus bridging routes. Less attention is paid to passengers’ path choice behaviors, which could affect …
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Research Collection School Of Computing and Information Systems
This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …
Enabling Sustainable Freight Forwarding Network Via Collaborative Games, Pang Jin Tan, Shih-Fen Cheng, Richard Chen
Enabling Sustainable Freight Forwarding Network Via Collaborative Games, Pang Jin Tan, Shih-Fen Cheng, Richard Chen
Research Collection School Of Computing and Information Systems
Freight forwarding plays a crucial role in facilitating global trade and logistics. However, as the freight forwarding market is extremely fragmented, freight forwarders often face the issue of not being able to fill the available shipping capacity. This recurrent issue motivates the creation of various freight forwarding networks that aim at exchanging capacities and demands so that the resource utilization of individual freight forwarders can be maximized. In this paper, we focus on how to design such a collaborative network based on collaborative game theory, with the Shapley value representing a fair scheme for profit sharing. Noting that the exact …
Fuel-Saving Route Planning With Data-Driven And Learning-Based Approaches: A Systematic Solution For Harbor Tugs, Shengming Wang, Xiaocai Zhang, Jing Li, Xiaoyang Wei, Hoong Chuin Lau, Bing Tian Dai, Binbin Huang Huang, Zhe Xiao, Xiuju Fu, Zheng Qin
Fuel-Saving Route Planning With Data-Driven And Learning-Based Approaches: A Systematic Solution For Harbor Tugs, Shengming Wang, Xiaocai Zhang, Jing Li, Xiaoyang Wei, Hoong Chuin Lau, Bing Tian Dai, Binbin Huang Huang, Zhe Xiao, Xiuju Fu, Zheng Qin
Research Collection School Of Computing and Information Systems
In recent years, there are trends toward cleaner port environments through enforcement by imposed legislation. Transit optimisation of fuel-based port service boats like harbour tugs has emerged as a critical task to reduce fuel consumption and carbon emission. In this paper, an innovative learning-based method, comprising a Reinforcement Learning (RL) model together with a fuel consumption prediction model, was proposed to formulate fuel-saving transit routes. Firstly, an ensemble model is established by combining a Long Short-Term Memory (LSTM) model with a Multilayer Perceptron (MLP) model, predicting fuel use based on tugboat movement and environment factors. Subsequently, an innovative RL based …
Reinforcement Learning For Strategic Airport Slot Scheduling: Analysis Of State Observations And Reward Designs, Anh Nguyen-Duy, Duc-Thinh Pham, Jian-Yi Lye, Nguyen Binh Duong Ta
Reinforcement Learning For Strategic Airport Slot Scheduling: Analysis Of State Observations And Reward Designs, Anh Nguyen-Duy, Duc-Thinh Pham, Jian-Yi Lye, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
Due to the NP-hard nature, the strategic airport slot scheduling problem is calling for exploring sub-optimal approaches, such as heuristics and learning-based approaches. Moreover, the continuous increase in air traffic demand requires approaches that can work well in new scenarios. While heuristics rely on a fixed set of rules, which limits the ability to explore new solutions, Reinforcement Learning offers a versatile framework to automate the search and generalize to unseen scenarios. Finding a suitable state observation and reward structure design is essential in using Reinforcement Learning. In this paper, we investigate the impact of providing the Reinforcement Learning agent …
Fine-Grained Passenger Load Prediction Inside Metro Network Via Smart Card Data, Xiancai Tian, Chen Zhang, Baihua Zheng
Fine-Grained Passenger Load Prediction Inside Metro Network Via Smart Card Data, Xiancai Tian, Chen Zhang, Baihua Zheng
Research Collection School Of Computing and Information Systems
Metro system serves as the backbone for urban public transportation. Accurate passenger load prediction for the metro system plays a crucial role in metro service quality improvement, such as helping operators schedule train timetables and passengers plan their trips. However, existing works can only predict low-grained passenger flows of origin-destination (O-D) paths or inflows/outflows of each station but cannot predict passenger load distribution over the whole metro network. To this end, this paper proposes an end-to-end inference framework, PIPE, for passenger load prediction of every metro segment between two adjacent stations, by only utilizing smart card data. In particular, PIPE …
A Feasibility-Preserved Quantum Approximate Solver For The Capacitated Vehicle Routing Problem, Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, Hoong Chuin Lau
A Feasibility-Preserved Quantum Approximate Solver For The Capacitated Vehicle Routing Problem, Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a set of customers, subject to the limited carrying capacity of each vehicle. As the number of possible solutions increases exponentially with the number of customers, finding high-quality solutions remains a significant challenge. Recently, the Quantum Approximate Optimization Algorithm (QAOA), a quantum–classical hybrid algorithm, has exhibited enhanced performance in certain combinatorial optimization problems, such as …
Network-Based Representations And Dynamic Discrete Choice Models For Multiple Discrete Choice Analysis, Huy Hung Tran, Tien Mai
Network-Based Representations And Dynamic Discrete Choice Models For Multiple Discrete Choice Analysis, Huy Hung Tran, Tien Mai
Research Collection School Of Computing and Information Systems
In many choice modeling applications, consumer demand is frequently characterized as multiple discrete, which means that consumer choose multiple items simultaneously. The analysis and prediction of consumer behavior in multiple discrete choice situations pose several challenges. In this paper, to address this, we propose a random utility maximization (RUM) based model that considers each subset of choice alternatives as a composite alternative, where individuals choose a subset according to the RUM framework. While this approach offers a natural and intuitive modeling approach for multiple-choice analysis, the large number of subsets of choices in the formulation makes its estimation and application …
Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng
Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Complex planning and scheduling problems have long been solved using various optimization or heuristic approaches. In recent years, imitation learning that aims to learn from expert demonstrations has been proposed as a viable alternative to solving these problems. Generally speaking, imitation learning is designed to learn either the reward (or preference) model or directly the behavioral policy by observing the behavior of an expert. Existing work in imitation learning and inverse reinforcement learning has focused on imitation primarily in unconstrained settings (e.g., no limit on fuel consumed by the vehicle). However, in many real-world domains, the behavior of an expert …
Analyzing Swimming Performance Using Drone Captured Aerial Videos, Ngoc Doan Thu Tran, Kenny Tsu Wei Choo, Shaohui Foong, Hitesh Bhardwaj, Shane Kyi Hla Win, Wei Jun Ang, Kenneth T. Goh, Rajesh Krishna Balan
Analyzing Swimming Performance Using Drone Captured Aerial Videos, Ngoc Doan Thu Tran, Kenny Tsu Wei Choo, Shaohui Foong, Hitesh Bhardwaj, Shane Kyi Hla Win, Wei Jun Ang, Kenneth T. Goh, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Monitoring swimmer performance is crucial for improving training and enhancing athletic techniques. Traditional methods for tracking swimmers, such as above-water and underwater cameras, face limitations due to the need for multiple cameras and obstructions from water splashes. This paper presents a novel approach for tracking swimmers using a moving UAV. The proposed system employs a UAV equipped with a high-resolution camera to capture aerial footage of the swimmers. The footage is then processed using computer vision algorithms to extract the swimmers' positions and movements. This approach offers several advantages, including single camera use and comprehensive coverage. The system's accuracy is …
An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko
An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko
Research Collection School Of Computing and Information Systems
The home-refill delivery system is a business model that addresses the concerns of plastic waste and its impact on the environment. It allows customers to pick up their household goods at their doorsteps and refill them into their own containers. However, the difficulty in accessing customers’ locations and product consolidations are undeniable challenges. To overcome these issues, we introduce a new variant of the Profitable Tour Problem, named the multi-vehicle profitable tour problem with flexible compartments and mandatory customers (MVPTPFC-MC). The objective is to maximize the difference between the total collected profit and the traveling cost. We model the proposed …
Editorial: Emerging On-Demand Passenger And Logistics Systems: Modelling, Optimization, And Data Analytics, Jintao Ke, Hai Wang, Neda Masoud, Maximilian Schiffer, Goncalo H. A. Correia
Editorial: Emerging On-Demand Passenger And Logistics Systems: Modelling, Optimization, And Data Analytics, Jintao Ke, Hai Wang, Neda Masoud, Maximilian Schiffer, Goncalo H. A. Correia
Research Collection School Of Computing and Information Systems
The proliferation of smart personal devices and mobile internet access has fueled numerous advancements in on-demand transportation services. These services are facilitated by online digital platforms and range from providing rides to delivering products. Their influence is transforming transportation systems and leaving a mark on changing individual mobility, activity patterns, and consumption behaviors. For instance, on-demand transportation companies such as Uber, Lyft, Grab, and DiDi have become increasingly vital for meeting urban transportation needs by connecting available drivers with passengers in real time. The recent surge in door-to-door food delivery (e.g., Uber Eats, DoorDash, Meituan); grocery delivery (e.g., Amazon Fresh, …
Understanding The Impact Of Trade Policy Effect Uncertainty On Firm-Level Innovation Investment: A Deep Learning Approach, Daniel Chang, Nan Hu, Peng Liang, Morgan Swink
Understanding The Impact Of Trade Policy Effect Uncertainty On Firm-Level Innovation Investment: A Deep Learning Approach, Daniel Chang, Nan Hu, Peng Liang, Morgan Swink
Research Collection School Of Computing and Information Systems
Integrating the real options perspective and resource dependence theory, this study examines how firms adjust their innovation investments to trade policy effect uncertainty (TPEU), a less studied type of firm specific, perceived environmental uncertainty in which managers have difficulty predicting how potential policy changes will affect business operations. To develop a text-based, context-dependent, time-varying measure of firm-level perceived TPEU, we apply Bidirectional Encoder Representations from Transformers (BERT), a state-of-the-art deep learning approach. We apply BERT to analyze the texts of mandatory Management Discussion and Analysis (MD&A) sections of annual reports for a sample of 22,669 firm-year observations from 3,181 unique …
Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang
Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang
Research Collection School Of Computing and Information Systems
Problem Definition: The job of any marketplace is to facilitate the matching of supply with demand in real-time. Success is often measured using various metrics. The challenge is to design matching algorithms to balance the trade-offs among multiple objectives in a stochastic environment, to arrive at a “compromise” solution, which minimizes say the ℓp-norm-based distance function (for some 1 ≤p ≤∞) between the attained performance metrics and the target performances.Methodology/Results: We observe that the sample-average-approximation formulation of this multi-objective stochastic optimization problem can be solved by an online algorithm that uses only gradient information from “historical” (i.e., past) sample information, …
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
Research Collection School Of Computing and Information Systems
Taxi drivers often take much time to navigate the streets to look for passengers, which leads to high vacancy rates and wasted resources. Empty taxi cruising remains a big concern for taxi companies. Analyzing the pick-up point selection behavior can solve this problem effectively, providing suggestions for taxi management and dispatch. Many studies have been devoted to analyzing and recommending hotspot regions of pick-up points, which can make it easier for drivers to pick-up passengers. However, the selection of pick-up points is complex and affected by multiple factors, such as convenience and traffic management. Most existing approaches cannot produce satisfactory …
Dl-Drl: A Double-Level Deep Reinforcement Learning Approach For Large-Scale Task Scheduling Of Multi-Uav, Xiao Mao, Guohua Wu, Mingfeng Fan, Zhiguang Cao, Witold Pedrycz
Dl-Drl: A Double-Level Deep Reinforcement Learning Approach For Large-Scale Task Scheduling Of Multi-Uav, Xiao Mao, Guohua Wu, Mingfeng Fan, Zhiguang Cao, Witold Pedrycz
Research Collection School Of Computing and Information Systems
Exploiting unmanned aerial vehicles (UAVs) to execute tasks is gaining growing popularity recently. To address the underlying task scheduling problem, conventional exact and heuristic algorithms encounter challenges such as rapidly increasing computation time and heavy reliance on domain knowledge, particularly when dealing with large-scale problems. The deep reinforcement learning (DRL) based methods that learn useful patterns from massive data demonstrate notable advantages. However, their decision space will become prohibitively huge as the problem scales up, thus deteriorating the computation efficiency. To alleviate this issue, we propose a double-level deep reinforcement learning (DL-DRL) approach based on a divide and conquer framework …
Glop: Learning Global Partition And Local Construction For Solving Large-Scale Routing Problems In Real-Time, Haoran Ye, Jiarui Wang, Helan Liang, Zhiguang Cao, Yong Li, Fanzhang Li
Glop: Learning Global Partition And Local Construction For Solving Large-Scale Routing Problems In Real-Time, Haoran Ye, Jiarui Wang, Helan Liang, Zhiguang Cao, Yong Li, Fanzhang Li
Research Collection School Of Computing and Information Systems
The recent end-to-end neural solvers have shown promise for small-scale routing problems but suffered from limited real-time scaling-up performance. This paper proposes GLOP (Global and Local Optimization Policies), a unified hierarchical framework that efficiently scales toward large-scale routing problems. GLOP partitions large routing problems into Travelling Salesman Problems (TSPs) and TSPs into Shortest Hamiltonian Path Problems. For the first time, we hybridize non-autoregressive neural heuristics for coarse-grained problem partitions and autoregressive neural heuristics for fine-grained route constructions, leveraging the scalability of the former and the meticulousness of the latter. Experimental results show that GLOP achieves competitive and state-of-the-art real-time performance …
Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao
Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao
Research Collection School Of Computing and Information Systems
The cooperative delivery of trucks and drones promises considerable advantages in delivery efficiency and environmental friendliness over pure fossil fuel fleets. As the prosperity of rural B2C e-commerce grows, this study intends to explore the prospect of this cooperation mode for rural last-mile delivery by developing a green vehicle routing problem with drones that considers the presence of steep roads (GVRPD-SR). Realistic energy consumption calculations for trucks and drones that both consider the impacts of general factors and steep roads are incorporated into the GVRPD-SR model, and the objective is to minimize the total energy consumption. To solve the proposed …
Neural Airport Ground Handling, Yaoxin Wu, Jianan Zhou, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang
Neural Airport Ground Handling, Yaoxin Wu, Jianan Zhou, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
Airport ground handling (AGH) offers necessary operations to flights during their turnarounds and is of great importance to the efficiency of airport management and the economics of aviation. Such a problem involves the interplay among the operations that leads to NP-hard problems with complex constraints. Hence, existing methods for AGH are usually designed with massive domain knowledge but still fail to yield high-quality solutions efficiently. In this paper, we aim to enhance the solution quality and computation efficiency for solving AGH. Particularly, we first model AGH as a multiple-fleet vehicle routing problem (VRP) with miscellaneous constraints including precedence, time windows, …
A Poisson-Based Distribution Learning Framework For Short-Term Prediction Of Food Delivery Demand Ranges, Jian Liang, Jintao Ke, Hai Wang, Hongbo Ye, Jinjun Tang
A Poisson-Based Distribution Learning Framework For Short-Term Prediction Of Food Delivery Demand Ranges, Jian Liang, Jintao Ke, Hai Wang, Hongbo Ye, Jinjun Tang
Research Collection School Of Computing and Information Systems
The COVID-19 pandemic has caused a dramatic change in the demand composition of restaurants and, at the same time, catalyzed on-demand food delivery (OFD) services—such as DoorDash, Grubhub, and Uber Eats—to a large extent. With massive amounts of data on customers, drivers, and merchants, OFD platforms can achieve higher efficiency with better strategic and operational decisions; these include dynamic pricing, order bundling and dispatching, and driver relocation. Some of these decisions, and especially proactive decisions in real time, rely on accurate and reliable short-term predictions of demand ranges or distributions. In this paper, we develop a Poisson-based distribution prediction (PDP) …
Robust Maximum Capture Facility Location Under Random Utility Maximization Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Robust Maximum Capture Facility Location Under Random Utility Maximization Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study a robust version of the maximum capture facility location problem in a competitive market, assuming that each customer chooses among all available facilities according to a random utility maximization (RUM) model. We employ the generalized extreme value (GEV) family of models and assume that the parameters of the RUM model are not given exactly but lie in convex uncertainty sets. The problem is to locate new facilities to maximize the worst-case captured user demand. We show that, interestingly, our robust model preserves the monotonicity and submodularity from its deterministic counterpart, implying that a simple greedy heuristic can guarantee …
Joint Location And Cost Planning In Maximum Capture Facility Location Under Random Utilities, Ngan H. Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Joint Location And Cost Planning In Maximum Capture Facility Location Under Random Utilities, Ngan H. Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study a joint facility location and cost planning problem in a competitive market under random utility maximization (RUM) models. The objective is to locate new facilities and make decisions on the costs (or budgets) to spend on the new facilities, aiming to maximize an expected captured customer demand, assuming that customers choose a facility among all available facilities according to a RUM model. We examine two RUM frameworks in the discrete choice literature, namely, the additive and multiplicative RUM. While the former has been widely used in facility location problems, we are the first to explore the latter in …
Grasp Solution Approach For The E-Waste Collection Problem, Aldy Gunawan, Dang Viet Anh Nguyen, Pham Kien Minh Nguyen, Pieter Vansteenwegen
Grasp Solution Approach For The E-Waste Collection Problem, Aldy Gunawan, Dang Viet Anh Nguyen, Pham Kien Minh Nguyen, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
The digital economy has brought significant advancements in electronic devices, increasing convenience and comfort in people’s lives. However, this progress has also led to a shorter life cycle for these devices due to rapid advancements in hardware and software technology. As a result, e-waste collection and recycling have become vital for protecting the environment and people’s health. From the operations research perspective, the e-waste collection problem can be modeled as the Heterogeneous Vehicle Routing Problem with Multiple Time Windows (HVRP-MTW). This study proposes a metaheuristic based on the Greedy Randomized Adaptive Search Procedure complemented by Path Relinking (GRASP-PR) to solve …
Understanding Multi-Homing And Switching By Platform Drivers, Xiaotong Guo, Andreas Haupt, Hai Wang, Rida Qadri, Jinhua Zhao
Understanding Multi-Homing And Switching By Platform Drivers, Xiaotong Guo, Andreas Haupt, Hai Wang, Rida Qadri, Jinhua Zhao
Research Collection School Of Computing and Information Systems
Freelance drivers in the shared mobility market frequently switch or work for multiple platforms, affecting driver labor supply. Due to the importance of driver labor supply for the shared mobility market, understanding drivers’ switching and multi-homing behavior is vital to managing service quality on – and effective regulation of – mobility platforms. However, a lack of individual-level data on driver behavior has thus far impeded a deeper understanding. This paper taxonomizes and estimates perceived switching and multi-homing frictions on mobility platforms. Based on a structural model of driver labor supply, we estimate switching and multi-homing costs in a platform duopoly …
Constrained Multiagent Reinforcement Learning For Large Agent Population, Jiajing Ling, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar
Constrained Multiagent Reinforcement Learning For Large Agent Population, Jiajing Ling, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar
Research Collection School Of Computing and Information Systems
Learning control policies for a large number of agents in a decentralized setting is challenging due to partial observability, uncertainty in the environment, and scalability challenges. While several scalable multiagent RL (MARL) methods have been proposed, relatively few approaches exist for large scale constrained MARL settings. To address this, we first formulate the constrained MARL problem in a collective multiagent setting where interactions among agents are governed by the aggregate count and types of agents, and do not depend on agents’ specific identities. Second, we show that standard Lagrangian relaxation methods, which are popular for single agent RL, do not …
Learning To Send Reinforcements: Coordinating Multi-Agent Dynamic Police Patrol Dispatching And Rescheduling Via Reinforcement Learning, Waldy Joe, Hoong Chuin Lau
Learning To Send Reinforcements: Coordinating Multi-Agent Dynamic Police Patrol Dispatching And Rescheduling Via Reinforcement Learning, Waldy Joe, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We address the problem of coordinating multiple agents in a dynamic police patrol scheduling via a Reinforcement Learning (RL) approach. Our approach utilizes Multi-Agent Value Function Approximation (MAVFA) with a rescheduling heuristic to learn dispatching and rescheduling policies jointly. Often, police operations are divided into multiple sectors for more effective and efficient operations. In a dynamic setting, incidents occur throughout the day across different sectors, disrupting initially-planned patrol schedules. To maximize policing effectiveness, police agents from different sectors cooperate by sending reinforcements to support one another in their incident response and even routine patrol. This poses an interesting research challenge …
Generalization Through Diversity: Improving Unsupervised Environment Design, Wenjun Li, Pradeep Varakantham, Dexun Li
Generalization Through Diversity: Improving Unsupervised Environment Design, Wenjun Li, Pradeep Varakantham, Dexun Li
Research Collection School Of Computing and Information Systems
Agent decision making using Reinforcement Learning (RL) heavily relies on either a model or simulator of the environment (e.g., moving in an 8x8 maze with three rooms, playing Chess on an 8x8 board). Due to this dependence, small changes in the environment (e.g., positions of obstacles in the maze, size of the board) can severely affect the effectiveness of the policy learned by the agent. To that end, existing work has proposed training RL agents on an adaptive curriculum of environments (generated automatically) to improve performance on out-of-distribution (OOD) test scenarios. Specifically, existing research has employed the potential for the …
Grasp Based Metaheuristic To Solve The Mixed Fleet E-Waste Collection Route Planning Problem, Aldy Gunawan, Dang V.A. Nguyen, Pham K.M. Nguyen, Pieter. Vansteenwegen
Grasp Based Metaheuristic To Solve The Mixed Fleet E-Waste Collection Route Planning Problem, Aldy Gunawan, Dang V.A. Nguyen, Pham K.M. Nguyen, Pieter. Vansteenwegen
Research Collection School Of Computing and Information Systems
The digital economy has brought significant advancements in electronic devices, increasing convenience and comfort in people’s lives. However, this progress has also led to a shorter life cycle for these devices due to rapid advancements in hardware and software technology. As a result, e-waste collection and recycling have become vital for protecting the environment and people’s health. From the operations research perspective, the e-waste collection problem can be modeled as the Heterogeneous Vehicle Routing Problem with Multiple Time Windows (HVRP-MTW). This study proposes a metaheuristic based on the Greedy Randomized Adaptive Search Procedure complemented by Path Relinking (GRASP-PR) to solve …