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

Operations Research, Systems Engineering and Industrial Engineering Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 61 - 90 of 450

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

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

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

Understanding Multi-Homing And Switching By Platform Drivers, Xiaotong Guo, Andreas Haupt, Hai Wang, Rida Qadri, Jinhua Zhao Sep 2023

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 …

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

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

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

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

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

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

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

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

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

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

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

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

A Review On Learning To Solve Combinatorial Optimisation Problems In Manufacturing, Cong Zhang, Yaoxin Wu, Yining Ma, Wen Song, Zhang Le, Zhiguang Cao, Jie Zhang Mar 2023

A Review On Learning To Solve Combinatorial Optimisation Problems In Manufacturing, Cong Zhang, Yaoxin Wu, Yining Ma, Wen Song, Zhang Le, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

An efficient manufacturing system is key to maintaining a healthy economy today. With the rapid development of science and technology and the progress of human society, the modern manufacturing system is becoming increasingly complex, posing new challenges to both academia and industry. Ever since the beginning of industrialisation, leaps in manufacturing technology have always accompanied technological breakthroughs from other fields, for example, mechanics, physics, and computational science. Recently, machine learning (ML) technology, one of the crucial subjects of artificial intelligence, has made remarkable progress in many areas. This study thoroughly reviews how ML, specifically deep (reinforcement) learning, motivates new ideas …

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

A Diversity-Enhanced Memetic Algorithm For Solving Electric Vehicle Routing Problems With Time Windows And Mixed Backhauls, Jianhua Xiao, Jingguo Du, Zhiguang Cao, Xingyi Zhang, Yunyun Niu Jan 2023

A Diversity-Enhanced Memetic Algorithm For Solving Electric Vehicle Routing Problems With Time Windows And Mixed Backhauls, Jianhua Xiao, Jingguo Du, Zhiguang Cao, Xingyi Zhang, Yunyun Niu

Research Collection School Of Computing and Information Systems

The electric vehicle routing problem (EVRP) has been studied increasingly because of environmental concerns. However, existing studies on the EVRP mainly focus on time windows and sole linehaul customers, which might not be practical as backhaul customers are also ubiquitous in reality. In this study, we investigate an EVRP with time windows and mixed backhauls (EVRPTWMB), where both linehaul and backhaul customers exist and can be served in any order. To address this challenging problem, we propose a diversity-enhanced memetic algorithm (DEMA) that integrates three types of novel operators, including genetic operators based on adaptive selection mechanism, a selection operator …

Go to article

Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau Jan 2023

Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This work is motivated by a real-world problem of coordinating B2B pickup-delivery operations to shopping malls involving multiple non-collaborative logistics service providers (LSPs) in a congested city where space is scarce. This problem can be categorized as a vehicle routing problem with pickup and delivery, time windows and location congestion with multiple LSPs (or ML-VRPLC in short), and we propose a scalable, decentralized, coordinated planning approach via iterative best response. We formulate the problem as a strategic game where each LSP is a self-interested agent but is willing to participate in a coordinated planning as long as there are sufficient …

Go to article

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

Pruning The Communication Bandwidth Between Reinforcement Learning Agents Through Causal Inference: An Innovative Approach To Designing A Smart Grid Power System, Xianjie Zhang, Yu Liu, Wenjun Li, Chen Gong Oct 2022

Pruning The Communication Bandwidth Between Reinforcement Learning Agents Through Causal Inference: An Innovative Approach To Designing A Smart Grid Power System, Xianjie Zhang, Yu Liu, Wenjun Li, Chen Gong

Research Collection School Of Computing and Information Systems

Electricity demands are increasing significantly and the traditional power grid system is facing huge challenges. As the desired next-generation power grid system, smart grid can provide secure and reliable power generation, and consumption, and can also realize the system’s coordinated and intelligent power distribution. Coordinating grid power distribution usually requires mutual communication between power distributors to accomplish coordination. However, the power network is complex, the network nodes are far apart, and the communication bandwidth is often expensive. Therefore, how to reduce the communication bandwidth in the cooperative power distribution process task is crucially important. One way to tackle this problem …

Go to article

Pruning The Communication Bandwidth Between Reinforcement Learning Agents Through Causal Inference: An Innovative Approach To Designing A Smart Grid Power System, Xianjie Zhang, Yu Liu, Wenjun Li, Chen Gong Oct 2022

Pruning The Communication Bandwidth Between Reinforcement Learning Agents Through Causal Inference: An Innovative Approach To Designing A Smart Grid Power System, Xianjie Zhang, Yu Liu, Wenjun Li, Chen Gong

Research Collection School Of Computing and Information Systems

Electricity demands are increasing significantly and the traditional power grid system isfacing huge challenges. As the desired next-generation power grid system, smart grid can providesecure and reliable power generation, and consumption, and can also realize the system’s coordinatedand intelligent power distribution. Coordinating grid power distribution usually requiresmutual communication between power distributors to accomplish coordination. However, the powernetwork is complex, the network nodes are far apart, and the communication bandwidth is oftenexpensive. Therefore, how to reduce the communication bandwidth in the cooperative power distributionprocess task is crucially important. One way to tackle this problem is to build mechanismsto selectively send out …

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

Choice-Based Crowdshipping: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra Sep 2022

Choice-Based Crowdshipping: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies the integration of the crowd workforce into a generic last-mile delivery setting in which a set of known delivery requests should be fulfilled at a minimum cost. In this setting, the crowd drivers are able to choose to perform a parcel delivery among the available and displayed requests. We specifically investigate the question: what tasks should be displayed to an individual driver, so as to minimize the overall delivery expenses? In contrast to past approaches, where drivers are either (a) given the choice of a single task chosen so as to optimize the platform’s profit, or (b) …

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

Integrating Forward And Reverse Logistics In Vehicle Routing Problem With Cross-Docking, Vincent F. Yu, Pham T. Anh, Aldy Gunawan Aug 2022

Integrating Forward And Reverse Logistics In Vehicle Routing Problem With Cross-Docking, Vincent F. Yu, Pham T. Anh, Aldy Gunawan

Research Collection School Of Computing and Information Systems

A closed-loop supply chain is one of the vital parts for maintaining the success of enterprises, where forward and reverse logistics are integrated to eliminate wastes (e.g., transportation costs). However, previous studies related to the Vehicle Routing Problem have almost overlooked this integration. This research therefore introduces a variant of the Vehicle Routing Problem with cross-docking (VRPCD) by simultaneously considering three additional factors: (1) various types of vehicles in terms of their capacities and unit travel costs; (2) multiple cross-docks; and (3) the integration of forward and reverse logistics. In particular, the flows of the network consist of distributing goods …

Go to article

First Prev Next Last