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

Computer Sciences

Singapore Management University

PDF

2022

Articles 1 - 18 of 18

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

Efficient Navigation For Constrained Shortest Path With Adaptive Expansion Control, Wenwen Xia, Yuchen Li, Wentian Guo, Shenghong Li Nov 2022

Efficient Navigation For Constrained Shortest Path With Adaptive Expansion Control, Wenwen Xia, Yuchen Li, Wentian Guo, Shenghong Li

Research Collection School Of Computing and Information Systems

In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large graphs, even with the state-of-the-art parallel solution on GPUs. The reason lies in the lack of effective navigational information and pruning strategies in the search procedure. In this paper, we propose SPEC, a Shortest Path Enhanced approach for solving the exact CSP problem. Our design rationales of SPEC rely on the observation that …

Go to article

A Carbon-Aware Planning Framework For Production Scheduling In Mining, Nurual Asyikeen Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi Sep 2022

A Carbon-Aware Planning Framework For Production Scheduling In Mining, Nurual Asyikeen Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi

Research Collection School Of Computing and Information Systems

Managing the flow of excavated materials from a mine pit and the subsequent processing steps is the logistical challenge in mining. Mine planning needs to consider various geometric and resource constraints while maximizing the net present value (NPV) of profits over a long horizon. This mine planning problem has been modelled and solved as a precedence constrained production scheduling problem (PCPSP) using heuristics, due to its NP-hardness. However, the recent push for sustainable and carbon-aware mining practices calls for new planning approaches. In this paper, we propose an efficient temporally decomposed greedy Lagrangian relaxation (TDGLR) approach to maximize profits while …

Go to article

Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu Sep 2022

Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu

Research Collection School Of Computing and Information Systems

Cross-dockingis a useful concept used by many companies to control the product flow. It enables the transshipment process of products from suppliers to customers. This research thus extends the benefit of cross-docking with reverse logistics, since return process management has become an important field in various businesses. The vehicle routing problem in a distribution network is considered to be an integrated model, namely the vehicle routing problem with reverse cross-docking (VRP-RCD). This study develops a mathematical model to minimize the costs of moving products in a four-level supply chain network that involves suppliers, cross-dock, customers, and outlets. A matheuristic based …

Go to article

Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao Aug 2022

Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Estimating the time of arrival is a crucial task in intelligent transportation systems. Although considerable efforts have been made to solve this problem, most of them decompose a trajectory into several segments and then compute the travel time by integrating the attributes from all segments. The segment view, though being able to depict the local traffic conditions straightforwardly, is insufficient to embody the intrinsic structure of trajectories on the road network. To overcome the limitation, this study proposes multi-view trajectory representation that comprehensively interprets a trajectory from the segment-, link-, and intersection-views. To fulfill the purpose, we design a hierarchical …

Go to article

Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv Aug 2022

Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv

Research Collection School Of Computing and Information Systems

Learning based order dispatching has witnessed tremendous success in ride hailing. However, the success halts within individual ride hailing platforms because sharing raw order dispatching data across platforms may leak user privacy and business secrets. Such data isolation not only impairs user experience but also decreases the potential revenues of the platforms. In this paper, we advocate federated order dispatching for cross-platform ride hailing, where multiple platforms collaboratively make dispatching decisions without sharing their local data. Realizing this concept calls for new federated learning strategies that tackle the unique challenges on effectiveness, privacy and efficiency in the context of order …

Go to article

Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai Aug 2022

Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai

Research Collection School Of Computing and Information Systems

We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each customer chooses among all available facilities according to a random utility maximization model. We employ the generalized extreme value (GEV) family of discrete choice models and show that the objective function in this context is monotonic and submodular. This finding implies that a simple greedy heuristic can always guarantee a (1−1/e) approximation solution. We further develop a new algorithm combining a greedy heuristic, …

Go to article

Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai Aug 2022

Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai

Research Collection School Of Computing and Information Systems

This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave …

Go to article

Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao Jul 2022

Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Solving the multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is challenging due to its non-deterministic property and conflicting objectives. Most multi -objective evolutionary algorithm dealing with this problem update current population without any guidance from previous searching experience. In this paper, a multi -objective evolutionary algorithm based on artificial neural networks is proposed to tackle the MO-VRPSD. Particularly, during the evolutionary process, a radial basis function net-work (RBFN) is exploited to learn the potential knowledge of individuals, generate hypoth-esis and instantiate hypothesis. The RBFN evaluates individuals with different scores and generates new individuals with higher quality while taking into …

Go to article

Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen Jul 2022

Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen

Research Collection School Of Computing and Information Systems

This paper addresses the time dependent orienteering problem with time windows and service time dependent profits (TDOPTW-STP). In the TDOPTW-STP, each vertex is assigned a minimum and a maximum service time and the profit collected at each vertex increases linearly with the service time. The goal is to maximize the total collected profit by determining a subset of vertices to be visited and assigning appropriate service time to each vertex, considering a given time budget and time windows. Moreover, travel times are dependent of the departure times. To solve this problem, a mixed integer linear model is formulated and a …

Go to article

Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng Jul 2022

Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng

Research Collection School Of Computing and Information Systems

How to coordinate the communication among intersections effectively in real complex traffic scenarios with multi-intersection is challenging. Existing approaches only enable the communication in a heuristic manner without considering the content/importance of information to be shared. In this paper, we propose a universal communication form UniComm between intersections. UniComm embeds massive observations collected at one agent into crucial predictions of their impact on its neighbors, which improves the communication efficiency and is universal across existing methods. We also propose a concise network UniLight to make full use of communications enabled by UniComm. Experimental results on real datasets demonstrate that UniComm …

Go to article

Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca Jun 2022

Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca

Research Collection School Of Computing and Information Systems

Reaching consensus-a macroscopic state where the system constituents display the same microscopic state-is a necessity in multiple complex socio-technical and techno-economic systems: their correct functioning ultimately depends on it. In many distributed systems-of which blockchain-based applications are a paradigmatic example-the process of consensus formation is crucial not only for the emergence of a leading majority but for the very functioning of the system. We build a minimalistic network model of consensus formation on blockchain systems for quantifying how central nodes-with respect to their average distance to others-can leverage on their position to obtain competitive advantage in the consensus process. We …

Go to article

Officers: Operational Framework For Intelligent Crime-And-Emergency Response Scheduling, Jonathan David Chase, Siong Thye Goh, Tran Phong, Hoong Chuin Lau Jun 2022

Officers: Operational Framework For Intelligent Crime-And-Emergency Response Scheduling, Jonathan David Chase, Siong Thye Goh, Tran Phong, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In the quest to achieve better response times in dense urban environments, law enforcement agencies are seeking AI-driven planning systems to inform their patrol strategies. In this paper, we present a framework, OFFICERS, for deployment planning that learns from historical data to generate deployment schedules on a daily basis. We accurately predict incidents using ST-ResNet, a deep learning technique that captures wide-ranging spatio-temporal dependencies, and solve a large-scale optimization problem to schedule deployment, significantly improving its scalability through a simulated annealing solver. Methodologically, our approach outperforms our previous works where prediction was done using Generative Adversarial Networks, and optimization was …

Go to article

Hierarchical Value Decomposition For Effective On-Demand Ride Pooling, Hao Jiang, Pradeep Varakantham May 2022

Hierarchical Value Decomposition For Effective On-Demand Ride Pooling, Hao Jiang, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

On-demand ride-pooling (e.g., UberPool, GrabShare) services focus on serving multiple different customer requests using each vehicle, i.e., an empty or partially filled vehicle can be assigned requests from different passengers with different origins and destinations. On the other hand, in Taxi on Demand (ToD) services (e.g., UberX), one vehicle is assigned to only one request at a time. On-demand ride pooling is not only beneficial to customers (lower cost), drivers (higher revenue per trip) and aggregation companies (higher revenue), but is also of crucial importance to the environment as it reduces the number of vehicles required on the roads. Since …

Go to article

Competition And Third-Party Platform-Integration In Ride-Sourcing Markets, Yaqian Zhou, Hai Yang, Jintao Ke, Hai Wang, Xinwei Li May 2022

Competition And Third-Party Platform-Integration In Ride-Sourcing Markets, Yaqian Zhou, Hai Yang, Jintao Ke, Hai Wang, Xinwei Li

Research Collection School Of Computing and Information Systems

Recently, some third-party integrators attempt to integrate the ride services offered by multiple independent ride-sourcing platforms. Accordingly, passengers can request ride through the integrators and receive ride service from any one of the ride-sourcing platforms. This novel business model, termed as third-party platform-integration in this work, has potentials to alleviate market fragmentation cost resulting from demand splitting among multiple platforms. Although most existing studies focus on operation strategies for one single monopolist platform, much less is known about the competition and platform-integration and their implications on operation strategy and system efficiency. In this work, we propose mathematical models to describe …

Go to article

The Impact Of Ride-Hail Surge Factors On Taxi Bookings, Sumit Agarwal, Ben Charoenwong, Shih-Fen Cheng, Jussi Keppo Mar 2022

The Impact Of Ride-Hail Surge Factors On Taxi Bookings, Sumit Agarwal, Ben Charoenwong, Shih-Fen Cheng, Jussi Keppo

Research Collection School Of Computing and Information Systems

We study the role of ride-hailing surge factors on the allocative efficiency of taxis by combining a reduced-form estimation with structural analyses using machine-learning-based demand predictions. Where other research study the effect of entry on incumbent taxis, we use higher frequency granular data to study how location-time-specific surge factors affect taxi bookings to bound the effect of customer decisions while accounting for various confounding variables. We find that even in a unique market like Singapore, where incumbent taxi companies have app-based booking systems similar to those from ride-hailing companies like Uber, the estimated upper bound on the cross-platform substitution between …

Go to article

Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu Mar 2022

Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu

Research Collection School Of Computing and Information Systems

This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach …

Go to article

Coordinated Delivery To Shopping Malls With Limited Docking Capacity, Ruidian Song, Hoong Chuin Lau, Xue Luo, Lei Zhao Mar 2022

Coordinated Delivery To Shopping Malls With Limited Docking Capacity, Ruidian Song, Hoong Chuin Lau, Xue Luo, Lei Zhao

Research Collection School Of Computing and Information Systems

Shopping malls are densely located in major cities such as Singapore and Hong Kong. Tenants in these shopping malls generate a large number of freight orders to their contracted logistics service providers, who independently plan their own delivery schedules. These uncoordinated deliveries and limited docking capacity jointly cause congestion at the shopping malls. A delivery coordination platform centrally plans the vehicle routes for the logistics service providers and simultaneously schedules the dock time slots at the shopping malls for the delivery orders. Vehicle routing and dock scheduling decisions need to be made jointly against the backdrop of travel time and …

Go to article

Towards An Instant Structure-Property Prediction Quality Control Tool For Additive Manufactured Steel Using A Crystal Plasticity Trained Deep Learning Surrogate, Yuhui Tu, Zhongzhou Liu, Luiz Carneiro, Caitriona M. Ryan, Andrew C. Parnell, Sean B. Leen Jan 2022

Towards An Instant Structure-Property Prediction Quality Control Tool For Additive Manufactured Steel Using A Crystal Plasticity Trained Deep Learning Surrogate, Yuhui Tu, Zhongzhou Liu, Luiz Carneiro, Caitriona M. Ryan, Andrew C. Parnell, Sean B. Leen

Research Collection School Of Computing and Information Systems

The ability to conduct in-situ real-time process-structure-property checks has the potential to overcome process and material uncertainties, which are key obstacles to improved uptake of metal powder bed fusion in industry. Efforts are underway for live process monitoring such as thermal and image-based data gathering for every layer printed. Current crystal plasticity finite element (CPFE) modelling is capable of predicting the associated strength based on a microstructural image and material data but is computationally expensive. This work utilizes a large database of input–output samples from CPFE modelling to develop a trained deep neural network (DNN) model which instantly estimates the …

Go to article