Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Series

Singapore Management University

PDF

Discipline
Keyword
Publication Year
Publication

Articles 1 - 30 of 385

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

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 May 2024

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 …

Go to article

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 Apr 2024

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, …

Go to article

T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng Mar 2024

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 …

Go to article

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 Feb 2024

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 …

Go to article

Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao Jan 2024

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 …

Go to article

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 Jan 2024

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 …

Go to article

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 Jan 2024

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 …

Go to article

Neural Airport Ground Handling, Yaoxin Wu, Jianan Zhou, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang Dec 2023

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, …

Go to article

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 Dec 2023

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 …

Go to article

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 Dec 2023

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) …

Go to article

Robust Maximum Capture Facility Location Under Random Utility Maximization Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai Nov 2023

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 …

Go to article

Joint Location And Cost Planning In Maximum Capture Facility Location Under Random Utilities, Ngan H. Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai Nov 2023

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 …

Go to article

Constrained Multiagent Reinforcement Learning For Large Agent Population, Jiajing Ling, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar Sep 2023

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 …

Go to article

Grasp Solution Approach For The E-Waste Collection Problem, Aldy Gunawan, Dang Viet Anh Nguyen, Pham Kien Minh Nguyen, Pieter Vansteenwegen Sep 2023

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 …

Go to article

Lean Manufacturing Approach To Increase Packaging Efficiency, Lina Gozali, Irsandy Kurniawan, Aldo Salim, Iveline Anne Marie, Benny Tjahjono, Yun Chia Liang, Aldy Gunawan, Nnovia Hardjo Sie, Yuliani Suseno Aug 2023

Lean Manufacturing Approach To Increase Packaging Efficiency, Lina Gozali, Irsandy Kurniawan, Aldo Salim, Iveline Anne Marie, Benny Tjahjono, Yun Chia Liang, Aldy Gunawan, Nnovia Hardjo Sie, Yuliani Suseno

Research Collection School Of Computing and Information Systems

The company upon which this paper is based engages in flexible packaging production, especially pharmaceutical products with guaranteed quality, trusted by consumers. Its production process includes printing, laminating, and assembling processes. Production activities are done manually and automatically using machines, so various types of waste are often found in these processes, making the level of plant efficiency nonoptimal. This study aims to identify wastes occurring in the production process, especially the production of pollycelonium with three colour variants as the highest demand product, by applying lean manufacturing concepts. The Current Value Stream Mapping (CVSM) used to map the production process …

Go to article

Generalization Through Diversity: Improving Unsupervised Environment Design, Wenjun Li, Pradeep Varakantham, Dexun Li Aug 2023

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 …

Go to article

Learning To Send Reinforcements: Coordinating Multi-Agent Dynamic Police Patrol Dispatching And Rescheduling Via Reinforcement Learning, Waldy Joe, Hoong Chuin Lau Aug 2023

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 …

Go to article

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 Aug 2023

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 …

Go to article

The Heterogeneous Vehicle Routing Problem With Multiple Time Windows For The E-Waste Collection Problem, Aldy Gunawan, Minh P.K Nguyen, Vincent F. Yu, Dang Viet Anh Nguyen Aug 2023

The Heterogeneous Vehicle Routing Problem With Multiple Time Windows For The E-Waste Collection Problem, Aldy Gunawan, Minh P.K Nguyen, Vincent F. Yu, Dang Viet Anh Nguyen

Research Collection School Of Computing and Information Systems

Waste from electrical and electronic equipment (WEEE) or e-waste describes end-of-life electronic products that are discarded. Due to their toxic and negative impacts to humans' health, many publications have been proposed to handle, however, studies related to e-waste collection and transportation to waste disposal sites are not widely studied so far. This study proposes a mixed integer linear programming (MILP) model to solve the e-waste collecting problem by formulating it as the heterogeneous vehicle routing problem with multiple time windows (HVRPMTW). The model is validated with newly developed benchmark instances that are solved by commercial software, CPLEX. The model is …

Go to article

Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le Jul 2023

Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le

Research Collection School Of Computing and Information Systems

This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue could be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation–maximization (EM) method that allows dealing with the missing-data issue by alternatively performing two steps of sampling the missing segments in the observations and solving maximum likelihood estimation problems. Moreover, observing that the EM method could be expensive, we propose a …

Go to article

Learning Deep Time-Index Models For Time Series Forecasting, Jiale Gerald Woo, Chenghao Liu, Doyen Sahoo, Akshat Kumar, Steven Hoi Jul 2023

Learning Deep Time-Index Models For Time Series Forecasting, Jiale Gerald Woo, Chenghao Liu, Doyen Sahoo, Akshat Kumar, Steven Hoi

Research Collection School Of Computing and Information Systems

Deep learning has been actively applied to time series forecasting, leading to a deluge of new methods, belonging to the class of historicalvalue models. Yet, despite the attractive properties of time-index models, such as being able to model the continuous nature of underlying time series dynamics, little attention has been given to them. Indeed, while naive deep timeindex models are far more expressive than the manually predefined function representations of classical time-index models, they are inadequate for forecasting, being unable to generalize to unseen time steps due to the lack of inductive bias. In this paper, we propose DeepTime, a …

Go to article

Imitation Improvement Learning For Large-Scale Capacitated Vehicle Routing Problems, The Viet Bui, Tien Mai Jul 2023

Imitation Improvement Learning For Large-Scale Capacitated Vehicle Routing Problems, The Viet Bui, Tien Mai

Research Collection School Of Computing and Information Systems

Recent works using deep reinforcement learning (RL) to solve routing problems such as the capacitated vehicle routing problem (CVRP) have focused on improvement learning-based methods, which involve improving a given solution until it becomes near-optimal. Although adequate solutions can be achieved for small problem instances, their efficiency degrades for large-scale ones. In this work, we propose a newimprovement learning-based framework based on imitation learning where classical heuristics serve as experts to encourage the policy model to mimic and produce similar or better solutions. Moreover, to improve scalability, we propose Clockwise Clustering, a novel augmented framework for decomposing large-scale CVRP into …

Go to article

A Hierarchical Optimization Approach For Dynamic Pickup And Delivery Problem With Lifo Constraints, Jianhui Du, Zhiqin Zhang, Xu Wang, Hoong Chuin Lau Jul 2023

A Hierarchical Optimization Approach For Dynamic Pickup And Delivery Problem With Lifo Constraints, Jianhui Du, Zhiqin Zhang, Xu Wang, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider a dynamic pickup and delivery problem (DPDP) where loading and unloading operations must follow a last in first out (LIFO) sequence. A fleet of vehicles will pick up orders in pickup points and deliver them to destinations. The objective is to minimize the total over-time (that is the amount of time that exceeds the committed delivery time) and total travel distance. Given the dynamics of orders and vehicles, this paper proposes a hierarchical optimization approach based on multiple intuitive yet often-neglected strategies, namely what we term as the urgent strategy, hitchhike strategy and packing-bags strategy. These multiple strategies …

Go to article

Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang Jul 2023

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, …

Go to article

Inventory-Responsive Donor-Management Policy: A Tandem Queueing Network Model, Taozeng Zhu, Nicholas Teck Boon Yeo, Sarah Yini Gao, Gar Goei Loke Jul 2023

Inventory-Responsive Donor-Management Policy: A Tandem Queueing Network Model, Taozeng Zhu, Nicholas Teck Boon Yeo, Sarah Yini Gao, Gar Goei Loke

Research Collection Lee Kong Chian School Of Business

Problem definition: In the blood-donor-management problem, the blood bank incentivizes donors to donate, given blood inventory levels. We propose a model to optimize such incentivization schemes under the context of random demand, blood perishability, observation period between donations, and variability in donor arrivals and dropouts. Methodology/results: We propose an optimization model that simultaneously accounts for the dynamics in the blood inventory and the donor’s donation process, as a coupled queueing network. We adopt the Pipeline Queue paradigm, which leads us to a tractable convex reformulation. The coupled setting requires new methodologies to be developed upon the existing Pipeline Queue framework. …

Go to article

A Mixed-Integer Linear Programming Reduction Of Disjoint Bilinear Programs Via Symbolic Variable Elimination, Jihwan Jeong, Scott Sanner, Akshat Kumar Jun 2023

A Mixed-Integer Linear Programming Reduction Of Disjoint Bilinear Programs Via Symbolic Variable Elimination, Jihwan Jeong, Scott Sanner, Akshat Kumar

Research Collection School Of Computing and Information Systems

A disjointly constrained bilinear program (DBLP) has various practical and industrial applications, e.g., in game theory, facility location, supply chain management, and multi-agent planning problems. Although earlier work has noted the equivalence of DBLP and mixed-integer linear programming (MILP) from an abstract theoretical perspective, a practical and exact closed-form reduction of a DBLP to a MILP has remained elusive. Such explicit reduction would allow us to leverage modern MILP solvers and techniques along with their solution optimality and anytime approximation guarantees. To this end, we provide the first constructive closed-form MILP reduction of a DBLP by extending the technique of …

Go to article

Optimization Of Station-Skip In A Cyclic Express Subway Service, Jingfeng Yang, Hai Wang, Jiangang Jin Jun 2023

Optimization Of Station-Skip In A Cyclic Express Subway Service, Jingfeng Yang, Hai Wang, Jiangang Jin

Research Collection School Of Computing and Information Systems

With rapid population growth and increasing demand for urban mobility, metropolitan areas such as Singapore, Tokyo, and Shanghai are increasingly dependent on public transport systems. Various strategies are proposed to improve the service quality and capacity of bus and subway systems. Express trains—i.e., trains that skip certain stations—are commonly used because they can travel at higher speeds, potentially reduce travel time, and serve more passengers. In this paper, we study cyclic express subway service (CESS), in which express trains provide routine transport service with cyclic (periodic) station-skip patterns that can be used in daily service. We propose an exact Mixed …

Go to article

An Exponential Cone Programming Approach For Managing Electric Vehicle Charging, Li Chen, Long He, Yangfang (Helen) Zhou May 2023

An Exponential Cone Programming Approach For Managing Electric Vehicle Charging, Li Chen, Long He, Yangfang (Helen) Zhou

Research Collection Lee Kong Chian School Of Business

To support the rapid growth in global electric vehicle adoption, public charging of electric vehicles is crucial. We study the problem of an electric vehicle charging service provider, which faces (1) stochastic arrival of customers with distinctive arrival and departure times, and energy requirements as well as (2) a total electricity cost including demand charges, costs related to the highest per-period electricity used in a finite horizon. We formulate its problem of scheduling vehicle charging to minimize the expected total cost as a stochastic program (SP). As this SP is large-scale, we solve it using exponential cone program (ECP) approximations. …

Go to article

Editorial: Innovative Shared Transportation, Marco Nie, Hai Wang, Wai Yuen Szeto May 2023

Editorial: Innovative Shared Transportation, Marco Nie, Hai Wang, Wai Yuen Szeto

Research Collection School Of Computing and Information Systems

Recent technological developments—mobile computing, autonomous driving, alternative fuel vehicles, and blockchain, to name a few—have enabled numerous innovations in mobility, transportation, and logistics services. They offer unprecedented opportunities to transform conventional transportation systems, for both personal travel and freight logistics, with novel solutions. Of these solutions, those built on the emerging concept of shared economy, such as Uber, Didi, and Cargostream, have received much attention recently. The rapidly expanding scope of shared transportation services now includes ride-sourcing, ridesharing, car sharing, hitch service, flexible paratransit, shared freight delivery, shared logistics, bike sharing, shared last-mile service, parking space sharing, and so on.

Go to article

Introduction To The Special Issue On Innovation In Transportation-Enabled Urban Services, Part 1, Niels Agatz, Soo-Haeng Cho, Hai Wang, Saif Benjaafar Mar 2023

Introduction To The Special Issue On Innovation In Transportation-Enabled Urban Services, Part 1, Niels Agatz, Soo-Haeng Cho, Hai Wang, Saif Benjaafar

Research Collection School Of Computing and Information Systems

Rapid developments in city infrastructure and technol-ogies are creating numerous opportunities and inspiring innovative and emerging urban services. Among these innovations, complex systems of urban transportation and logistics have embraced advances and have been reshaped significantly. They enable innovative new urban services, which are now booming and changing everyday life for urban residents.This special issue of Service Science explores perspectives on innovation in transportation-enabled urban services. We hope that the special issue will enhance the understanding of the planning, operation, and management of such services. Contributions are expected to demonstrate rigorous model development, economic/ econometric analysis, and decision-making tools based …

Go to article

Next Last