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

Operations Research, Systems Engineering and Industrial Engineering Commons

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

Articles 1 - 8 of 8

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

Design Of A Two-Echelon Freight Distribution System In Last-Mile Logistics Considering Covering Locations And Occasional Drivers, Vincent F. Yu, Panca Jodiawan, Ming-Lu Hou, Aldy Gunawan Oct 2021

Design Of A Two-Echelon Freight Distribution System In Last-Mile Logistics Considering Covering Locations And Occasional Drivers, Vincent F. Yu, Panca Jodiawan, Ming-Lu Hou, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This research addresses a new variant of the vehicle routing problem, called the two-echelon vehicle routing problem with time windows, covering options, and occasional drivers (2E-VRPTW-CO-OD). In this problem, two types of fleets are available to serve customers, city freighters and occasional drivers (ODs), while two delivery options are available to customers, home delivery and alternative delivery. For customers choosing the alternative delivery, their demands are delivered to one of the available covering locations for them to pick up. The objective of 2E-VRPTW-CO-OD is to minimize the total cost consisting of routing costs, connection costs, and compensations paid to ODs …


Routing Policy Choice Prediction In A Stochastic Network: Recursive Model And Solution Algorithm, Tien Mai, Xinlian Yu, Song Gao, Emma Frejinger Sep 2021

Routing Policy Choice Prediction In A Stochastic Network: Recursive Model And Solution Algorithm, Tien Mai, Xinlian Yu, Song Gao, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ adaptation to revealed traffic conditions when making route choices. The STD-RL model circumvents choice set generation, a procedure with known issues related to estimation and prediction. In a given state, travelers make their link choice maximizing the sum of the utility of the outgoing link and the expected maximum utility until …


We Are On The Way: Analysis Of On-Demand Ride-Hailing Systems, Guiyun Feng, Guangwen Kong, Zizhuo Wang Sep 2021

We Are On The Way: Analysis Of On-Demand Ride-Hailing Systems, Guiyun Feng, Guangwen Kong, Zizhuo Wang

Research Collection Lee Kong Chian School Of Business

Problem definition: Recently, there has been a rapid rise of on-demand ride-hailing platforms, such as Uber and Didi, which allow passengers with smartphones to submit trip requests and match them to drivers based on their locations and drivers’ availability. This increased demand has raised questions about how such a new matching mechanism will affect the efficiency of the transportation system—in particular, whether it will help reduce passengers’ average waiting time compared with traditional street-hailing systems. Academic/practical relevance: The on-demand ride-hailing problem has gained much academic interest recently. The results we find in the ride-hailing system have a significant …


Step-Wise Deep Learning Models For Solving Routing Problems, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang Jul 2021

Step-Wise Deep Learning Models For Solving Routing Problems, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

Routing problems are very important in intelligent transportation systems. Recently, a number of deep learning-based methods are proposed to automatically learn construction heuristics for solving routing problems. However, these methods do not completely follow Bellman's Principle of Optimality since the visited nodes during construction are still included in the following subtasks, resulting in suboptimal policies. In this article, we propose a novel step-wise scheme which explicitly removes the visited nodes in each node selection step. We apply this scheme to two representative deep models for routing problems, pointer network and transformer attention model (TAM), and significantly improve the performance of …


First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro Jun 2021

First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro

Research Collection School Of Computing and Information Systems

Subway system is the main mode of transportation for city dwellers and is a quite signif-icant backbone to a city's operations. One of the challenges of subway network operation is the scheduling of the first trains each morning and its impact on transfers. To deal with this challenge, some cities (e.g. Beijing) use bus 'bridging' services, temporarily substitut -ing segments of the subway network. The present paper optimally identifies when to start each train and bus bridging service in an intermodal transit network. Starting from a mixed integer nonlinear programming model for the first train timetabling problem, we linearize and …


Urban Consolidation Center Or Peer-To-Peer Platform? The Solution To Urban Last-Mile Delivery, Qiyuan Deng, Xin Fang, Yun Fong Lim Apr 2021

Urban Consolidation Center Or Peer-To-Peer Platform? The Solution To Urban Last-Mile Delivery, Qiyuan Deng, Xin Fang, Yun Fong Lim

Research Collection Lee Kong Chian School Of Business

The growing population in cities and booming e-commerce activities create huge demand for urban last-mile delivery, exerting intense pressure on the cities' well-being. To keep congestion and pollution under control, a consolidator can operate an urban consolidation center (UCC) to bundle shipments from multiple carriers before the last-mile delivery. Alternatively, the consolidator can operate a peer-to-peer platform for the carriers to share delivery capacity. We provide guidance for the consolidator to choose between these two business models by comparative analysis. We capture the interactions between the consolidator and carriers using a game-theoretical framework. Under each business model, the consolidator first …


Singapore Airlines: Profit Recovery And Aircraft Allocation Models During The Covid-19 Pandemic, Michelle L. F. Cheong, Ulysses M. Z. Chong, Anne N. T. A. Nguyen, Su Yiin Ang, Gabriella P. Djojosaputro, Gordy Adiprasetyo, Kendra L. B. Gadong Mar 2021

Singapore Airlines: Profit Recovery And Aircraft Allocation Models During The Covid-19 Pandemic, Michelle L. F. Cheong, Ulysses M. Z. Chong, Anne N. T. A. Nguyen, Su Yiin Ang, Gabriella P. Djojosaputro, Gordy Adiprasetyo, Kendra L. B. Gadong

Research Collection School Of Computing and Information Systems

COVID-19 has severely impacted the global aviation industry, causing many airlines to downsize or exit the industry. For airlines which attempt to sustain their operations, they will need to respond to the increase in passenger and cargo demand, as countries recover slowly from the crisis due to the availability of vaccines. We built a series of spreadsheet models to first project the COVID-19 recovery rates by countries from 2021 to 2025, then forecast the passenger and cargo demand, using historical data as base figures. Using the financial and operation data, the revenue, expense, and profit can be projected, then an …


Zone Path Construction (Zac) Based Approaches For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet Jan 2021

Zone Path Construction (Zac) Based Approaches 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 and 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 together in the “right” available vehicles in real-time, so that the objective (e.g., requests served, revenue or delay) is optimized. This challenge has been addressed in existing work by: (i) generating as many relevant feasible combinations of requests (with respect to the available delay for customers) as …