Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Optimization (8)
- Vehicle routing problem (6)
- Reinforcement learning (5)
- Ride-sourcing (3)
- Routing (3)
-
- Vehicle routing (3)
- Analytical models (2)
- Autonomous agents (2)
- Decision making (2)
- Electric Vehicle Routing Problem (2)
- Electric vehicles (2)
- Energy consumption (2)
- Genetic algorithm (2)
- Intelligent transportation systems (2)
- Logistics (2)
- Mixed integer programming (2)
- Recursive logit (2)
- Shared mobility systems (2)
- Singapore (2)
- Transportation (2)
- Urban areas (2)
- Urban consolidation center (2)
- Waterway transportation (2)
- Winner determination problem (2)
- Adaptive large neighborhood search (1)
- Agent application (1)
- Aircraft allocation (1)
- Airport ground handling (1)
- Ant colony algorithms (1)
- Approximate algorithm. (1)
- Publication Year
Articles 61 - 73 of 73
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Social Media For Supply Chain Risk Management, Xiuju Fu, Rick S. M. Goh, J. C. Tong, Loganathan Ponnanbalam, Xiaofeng Yin, Zhaoxia Wang, H. Y. Xu, Sifei Lu
Social Media For Supply Chain Risk Management, Xiuju Fu, Rick S. M. Goh, J. C. Tong, Loganathan Ponnanbalam, Xiaofeng Yin, Zhaoxia Wang, H. Y. Xu, Sifei Lu
Research Collection School Of Computing and Information Systems
With the rapid increase of online social network users worldwide, social media feeds have become a rich and valuable information resource and attract great attention across diversified domains. In social media data, there are abundant contents of two-way and interactive communication about products, demand, customer services and supply. This makes social media a valuable channel for listening to the voices from the market and measuring supply chain risks and new market trends for companies. In this study, we surveyed the potential value of social media in supply chain risk management (SCRM) and examined how they can be applied to SCRM …
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Research Collection School Of Computing and Information Systems
Mass Rapid Transit using rail is a popular mode of transport employed by millions of people in many urban cities across the world. Typically, these networks are massive, used by many and thus, can be a soft target for criminals. In this paper, we consider the problem of scheduling randomised patrols for improving security of such rail networks. Similar to existing work in randomised patrols for protecting critical infrastructure, we also employ Stackelberg Games to represent the problem. In solving the Stackelberg games for massive rail networks, we make two key contributions. Firstly, we provide an approach called RaPtoR for …
A Mechanism For Organizing Last-Mile Service Using Non-Dedicated Fleet, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
A Mechanism For Organizing Last-Mile Service Using Non-Dedicated Fleet, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Unprecedented pace of urbanization and rising income levels have fueled the growth of car ownership in almost all newly formed megacities. Such growth has congested the limited road space and significantly affected the quality of life in these megacities. Convincing residents to give up their cars and use public transport is the most effective way in reducing congestion; however, even with sufficient public transport capacity, the lack of last-mile (from the transport hub to the destination) travel services is the major deterrent for the adoption of public transport. Due to the dynamic nature of such travel demands, fixed-size fleets will …
Toward Large-Scale Agent Guidance In An Urban Taxi Service, Agussurja Lucas, Hoong Chuin Lau
Toward Large-Scale Agent Guidance In An Urban Taxi Service, Agussurja Lucas, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Empty taxi cruising represents a wastage of resources in the context of urban taxi services. In this work, we seek to minimize such wastage. An analysis of a large trace of taxi operations reveals that the services’ inefficiency is caused by drivers’ greedy cruising behavior. We model the existing system as a continuous time Markov chain. To address the problem, we propose that each taxi be equipped with an intelligent agent that will guide the driver when cruising for passengers. Then, drawing from AI literature on multiagent planning, we explore two possible ways to compute such guidance. The first formulation …
The Patrol Scheduling Problem, Hoong Chuin Lau, Aldy Gunawan
The Patrol Scheduling Problem, Hoong Chuin Lau, Aldy Gunawan
Research Collection School Of Computing and Information Systems
This paper presents the problem of scheduling security teams to patrol a mass rapid transit rail network of a large urban city. The main objective of patrol scheduling is to deploy security teams to stations at varying time periods of the network subject to rostering as well as security-related constraints. We present a mathematical programming model for this problem. We then discuss the aspect of injecting randomness by varying the start times, the break times for each team as well as the number of visits required for each station according to their reported vulnerability. Finally, we present results for the …
A Pomdp Model For Guiding Taxi Cruising In A Congested Urban City, Lucas Agussurja, Hoong Chuin Lau
A Pomdp Model For Guiding Taxi Cruising In A Congested Urban City, Lucas Agussurja, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We consider a partially observable Markov decision process (POMDP) model for improving a taxi agent cruising decision in a congested urban city. Using real-world data provided by a large taxi company in Singapore as a guide, we derive the state transition function of the POMDP. Specifically, we model the cruising behavior of the drivers as continuous-time Markov chains. We then apply dynamic programming algorithm for finding the optimal policy of the driver agent. Using a simulation, we show that this policy is significantly better than a greedy policy in congested road network.
Automobile Exhaust Gas Detection Based On Fuzzy Temperature Compensation System, Zhiyong Wang, Hao Ding, Fufei Hao, Zhaoxia Wang, Zhen Sun, Shujin Li
Automobile Exhaust Gas Detection Based On Fuzzy Temperature Compensation System, Zhiyong Wang, Hao Ding, Fufei Hao, Zhaoxia Wang, Zhen Sun, Shujin Li
Research Collection School Of Computing and Information Systems
A temperature compensation scheme of detecting automobile exhaust gas based on fuzzy logic inference is presented in this paper. The principles of the infrared automobile exhaust gas analyzer and the influence of the environmental temperature on analyzer are discussed. A fuzzy inference system is designed to improve the measurement accuracy of the measurement equipment by reducing the measurement errors caused by environmental temperature. The case studies demonstrate the effectiveness of the proposed method. The fuzzy compensation scheme is promising as demonstrated by the simulation results in this paper.
A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu
A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu
Research Collection School Of Computing and Information Systems
Taxi service has undergone radical revamp in recent years. In particular, significant investments in communication system and GPS devices have improved quality of taxi services through better dispatches. In this paper, we propose to leverage on such infrastructure and build a service choice model that helps individual drivers in deciding whether to serve a specific taxi stand or not. We demonstrate the value of our model by applying it to a real-world scenario. We also highlight interesting new potential approaches that could significantly improve the quality of taxi services.
Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith
Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith
Research Collection School Of Computing and Information Systems
The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …
Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo
Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo
Research Collection School Of Computing and Information Systems
In a rapidly changing environment, the behavior and decision-making power of agents may have to be adaptive with respect to a fluctuating autonomy. In this paper, a centralized fuzzy approach is proposed to sense changes in environmental conditions and translate them to changes in agent autonomy. A distributed coalition formation scheme is then applied to allow agents in the new autonomy to renegotiate to establish schedule consistency. The proposed framework is applied to a real-time logistics control of a military hazardous material storage facility under peace-to-war transition.
Dispatching Vehicles In A Mega Container Terminal, Ebru K. Bish, Frank Y. Chen, Thin Yin Leong, Barry L. Nelson, Jonathan W. C. Ng, David Simchi-Levi
Dispatching Vehicles In A Mega Container Terminal, Ebru K. Bish, Frank Y. Chen, Thin Yin Leong, Barry L. Nelson, Jonathan W. C. Ng, David Simchi-Levi
Research Collection School Of Computing and Information Systems
We consider a container terminal discharging and uploading containers to and from ships. The discharged containers are stored at prespecified storage locations in the terminal yard. Containers are moved between the ship area and the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to dispatch vehicles to the containers so as to minimize the total time it takes to serve a ship, which is the total time it takes to discharge all containers from the ship and upload new containers onto the ship. We develop easily implementable heuristic algorithms …
Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu
Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu
Research Collection School Of Computing and Information Systems
In this paper, we study a logistics problem arising in military transport planning. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We address the following two problems: (1) how many vehicles are at least needed to meet a given service level of requests; and (2) suppose we allow each request to shift its start time by a constant duration, call all the requests be met? A Niche genetic algorithm, together …
Analysis Of A New Vehicle Scheduling And Location Problem, Ebru K. Bish, Thin Yin Leong, Chun-Lun Li, Jonathan W. C. Ng, David Simchi-Levi
Analysis Of A New Vehicle Scheduling And Location Problem, Ebru K. Bish, Thin Yin Leong, Chun-Lun Li, Jonathan W. C. Ng, David Simchi-Levi
Research Collection School Of Computing and Information Systems
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP-hard and develop a …