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 (20)
- Physical Sciences and Mathematics (20)
- Artificial Intelligence and Robotics (8)
- Public Affairs, Public Policy and Public Administration (8)
- Social and Behavioral Sciences (8)
-
- Transportation (8)
- Numerical Analysis and Scientific Computing (3)
- Business (2)
- Databases and Information Systems (2)
- Theory and Algorithms (2)
- Environmental Sciences (1)
- Health and Medical Administration (1)
- Law (1)
- Law Enforcement and Corrections (1)
- Medicine and Health Sciences (1)
- Sales and Merchandising (1)
- Technology and Innovation (1)
- Keyword
-
- Approximate dynamic programming approach (1)
- Batch demand (1)
- Bundling (1)
- Capacitated Team Orienteering Problem (1)
- Carbon emissions (1)
-
- Classification & regression tree (1)
- Constraint Programming (1)
- Customer segmentation (1)
- Cyclic Inventory Routing problem (1)
- Deployment (1)
- Driver behavior analysis (1)
- Dynamic recommendation (1)
- Electric Vehicle Routing Problem (1)
- Electric vehicles (1)
- Endogeneity (1)
- Endogenous Supply and Demand (1)
- Energy consumption (1)
- Genetic algorithm (1)
- Healthcare analytics (1)
- Hybrid artificial bee colony algorithm (1)
- Income elasticity (1)
- Integer programming (1)
- Iterated Local Search (1)
- Kinematic motion (1)
- Labor supply (1)
- Last mile (1)
- Last-mile problem (1)
- Law enforcement (1)
- Learning Preferences (1)
- MITB student (1)
Articles 1 - 21 of 21
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja
A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja
Research Collection School Of Computing and Information Systems
A green mixed fleet vehicle routing with realistic energy consumption and partial recharges problem (GMFVRP-REC-PR) is addressed in this paper. This problem involves a fixed number of electric vehicles and internal combustion vehicles to serve a set of customers. The realistic energy consumption which depends on several variables is utilized to calculate the electricity consumption of an electric vehicle and fuel consumption of an internal combustion vehicle. Partial recharging policy is included into the problem to represent the real life scenario. The objective of this problem is to minimize the total travelled distance and the total emission produced by internal …
Correlation-Sensitive Next-Basket Recommendation, Duc Trong Le, Hady Wirawan Lauw, Yuan Fang
Correlation-Sensitive Next-Basket Recommendation, Duc Trong Le, Hady Wirawan Lauw, Yuan Fang
Research Collection School Of Computing and Information Systems
Items adopted by a user over time are indicative ofthe underlying preferences. We are concerned withlearning such preferences from observed sequencesof adoptions for recommendation. As multipleitems are commonly adopted concurrently, e.g., abasket of grocery items or a sitting of media consumption, we deal with a sequence of baskets asinput, and seek to recommend the next basket. Intuitively, a basket tends to contain groups of relateditems that support particular needs. Instead of recommending items independently for the next basket, we hypothesize that incorporating informationon pairwise correlations among items would help toarrive at more coherent basket recommendations.Towards this objective, we develop a …
Decision Making For Improving Maritime Traffic Safety Using Constraint Programming, Saumya Bhatnagar, Akshat Kumar, Hoong Chuin Lau
Decision Making For Improving Maritime Traffic Safety Using Constraint Programming, Saumya Bhatnagar, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Maritime navigational safety is of utmost importance to prevent vessel collisions in heavily trafficked ports, and avoid environmental costs. In case of a likely near miss among vessels, port traffic controllers provide assistance for safely navigating the waters, often at very short lead times. A better strategy is to avoid such situations from even happening. To achieve this, we a) formalize the decision model for traffic hotspot mitigation including realistic maritime navigational features and constraints through consultations with domain experts; and b) develop a constraint programming based scheduling approach to mitigate hotspots. We model the problem as a variant of …
Data-Driven Surgical Duration Prediction Model For Surgery Scheduling: A Case-Study For A Practice-Feasible Model In A Public Hospital, Kar Way Tan, Francis Ngoc Hoang Long Nguyen, Boon Yew Ang, Jerald Gan, Sean Shao Wei Lam
Data-Driven Surgical Duration Prediction Model For Surgery Scheduling: A Case-Study For A Practice-Feasible Model In A Public Hospital, Kar Way Tan, Francis Ngoc Hoang Long Nguyen, Boon Yew Ang, Jerald Gan, Sean Shao Wei Lam
Research Collection School Of Computing and Information Systems
Hospitals have been trying to improve the utilization of operating rooms as it affects patient satisfaction, surgery throughput, revenues and costs. Surgical prediction model which uses post-surgery data often requires high-dimensional data and contains key predictors such as surgical team factors which may not be available during the surgical listing process. Our study considers a two-step data-mining model which provides a practical, feasible and parsimonious surgical duration prediction. Our model first leverages on domain knowledge to provide estimate of the first surgeon rank (a key predicting attribute) which is unavailable during the listing process, then uses this predicted attribute and …
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 …
Improving Law Enforcement Daily Deployment Through Machine Learning-Informed Optimization Under Uncertainty, Jonathan David Chase, Duc Thien Nguyen, Haiyang Sun, Hoong Chuin Lau
Improving Law Enforcement Daily Deployment Through Machine Learning-Informed Optimization Under Uncertainty, Jonathan David Chase, Duc Thien Nguyen, Haiyang Sun, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Urban law enforcement agencies are under great pressure to respond to emergency incidents effectively while operating within restricted budgets. Minutes saved on emergency response times can save lives and catch criminals, and a responsive police force can deter crime and bring peace of mind to citizens. To efficiently minimize the response times of a law enforcement agency operating in a dense urban environment with limited manpower, we consider in this paper the problem of optimizing the spatial and temporal deployment of law enforcement agents to predefined patrol regions in a real-world scenario informed by machine learning. To this end, we …
Model And Analysis Of Labor Supply For Ride-Sharing Platforms In The Presence Of Sample Self-Selection And Endogeneity, Hao Sun, Hai Wang, Zhixi Wan
Model And Analysis Of Labor Supply For Ride-Sharing Platforms In The Presence Of Sample Self-Selection And Endogeneity, Hao Sun, Hai Wang, Zhixi Wan
Research Collection School Of Computing and Information Systems
With the popularization of ride-sharing services, drivers working as freelancers on ride-sharing platforms can design their schedules flexibly. They make daily decisions regard- ing whether to participate in work, and if so, how many hours to work. Factors such as hourly income rate affect both the participation decision and working-hour decision, and evaluation of the impacts of hourly income rate on labor supply becomes important. In this paper, we propose an econometric framework with closed-form measures to estimate both the participation elasticity (i.e., extensive margin elasticity) and working-hour elasticity (i.e., intensive margin elasticity) of labor supply. We model the sample …
Zac: A Zone Path Construction Approach For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Zac: A Zone Path Construction Approach For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Real-time ridesharing systems such as UberPool, Lyft Line, GrabShare have become hugely popular as they reduce the costs for customers, improve per trip revenue for drivers and reduce traffic on the roads by grouping customers with similar itineraries. The key challenge in these systems is to group the right requests to travel in available vehicles in real-time, so that the objective (e.g., requests served, revenue or delay) is optimized. The most relevant existing work has focussed on generating as many relevant feasible (with respect to available delay for customers) combinations of requests (referred to as trips) as possible in real-time. …
Entropy Based Independent Learning In Anonymous Multi-Agent Settings, Tanvi Verma, Pradeep Varakantham, Hoong Chuin Lau
Entropy Based Independent Learning In Anonymous Multi-Agent Settings, Tanvi Verma, Pradeep Varakantham, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are responsible for supply (e.g., taxi drivers, delivery bikes or delivery van drivers) earn more by being at the ”right” place at the ”right” time. We are interested in developing approaches that learn to guide individuals to be in the ”right” place at the ”right” time (to maximize revenue) in the presence of other …
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.
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 …
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.
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 …
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 …
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 …
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 …
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 …
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 …
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 …
Analysis Of Bus Ride Comfort Using Smartphone Sensor Data, Hoong-Chor Chin, Xingting Pang, Zhaoxia Wang
Analysis Of Bus Ride Comfort Using Smartphone Sensor Data, Hoong-Chor Chin, Xingting Pang, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
Passenger comfort is an important indicator that is often used to measure the quality of public transport services. It may also be a crucial factor in the passenger’s choice of transport mode. The typical method of assessing passenger comfort is through a passenger interview survey which can be tedious. This study aims to investigate the relationship between bus ride comfort based on ride smoothness and the vehicle’s motion detected by the smartphone sensors. An experiment was carried out on a bus fixed route within the University campus where comfort levels were rated on a 3-point scale and recorded at 5-second …