Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics
Research Collection School Of Computing and Information Systems
- Keyword
-
- Artificial intelligence (1)
- Collaborative Urban Logistics (1)
- Double Auction (1)
- Iterated Local Search (1)
- Large-scale problem (1)
-
- On-line matching (1)
- Optimization (1)
- Order Sharing (1)
- Patrol scheduling problem Preferences Mass rapid transit rail network Mathematical programming (1)
- Recommender System (1)
- Sales (1)
- Taxicabs (1)
- Team Orienteering Problem with Time Windows (1)
- Tourist Trip Design Problem (1)
- Urban Consolidation Center (1)
Articles 1 - 6 of 6
Full-Text Articles in Business
A Fast Algorithm For Personalized Travel Planning Recommendation, Aldy Gunawan, Hoong Chuin Lau, Kun Lu
A Fast Algorithm For Personalized Travel Planning Recommendation, Aldy Gunawan, Hoong Chuin Lau, Kun Lu
Research Collection School Of Computing and Information Systems
With the pervasive use of recommender systems and web/mobile applications such as TripAdvisor and Booking.com, an emerging interest is to generate personalized tourist routes based on a tourist’s preferences and time budget constraints, often in real-time. The problem is generally known as the Tourist Trip Design Problem (TTDP) which is a route-planning problem on multiple Points of Interest (POIs). TTDP can be considered as an extension of the classical problem of Team Orienteering Problem with Time Windows (TOPTW). The objective of the TOPTW is to determine a fixed number of routes that maximize the total collected score. The TOPTW also …
Patrol Scheduling In An Urban Rail Network, Hoong Chuin Lau, Zhi Yuan, Aldy Gunawan
Patrol Scheduling In An Urban Rail Network, Hoong Chuin Lau, Zhi Yuan, 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 of the network at varying time periods subject to rostering as well as security-related constraints. We present several mathematical programming models for different variants of this problem. To generate randomized schedules on a regular basis, we propose injecting randomness by varying the start time and break time for each team as well as varying the visit frequency and visit time for each station according to …
A Proactive Sampling Approach To Project Scheduling Under Uncertainty, Pradeep Varakantham, Na Fu, Hoong Chuin Lau
A Proactive Sampling Approach To Project Scheduling Under Uncertainty, Pradeep Varakantham, Na Fu, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Uncertainty in activity durations is a key characteristic of many real world scheduling problems in manufacturing, logistics and project management. RCPSP/max with durational uncertainty is a general model that can be used to represent durational uncertainty in a wide variety of scheduling problems where there exist resource constraints. However, computing schedules or execution strategies for RCPSP/max with durational uncertainty is NP-hard and hence we focus on providing approximation methods in this paper. We pro- vide a principled approximation approach based on Sample Average Approximation (SAA) to compute proactive schedules for RCPSP/max with durational uncertainty. We further contribute an extension to …
Achieving Stable And Fair Profit Allocation With Minimum Subsidy In Collaborative Logistics, Lucas Agussurja, Hoong Chuin Lau, Shih-Fen Cheng
Achieving Stable And Fair Profit Allocation With Minimum Subsidy In Collaborative Logistics, Lucas Agussurja, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
With the advent of e-commerce, logistics providers are faced with the challenge of handling fluctuating and sparsely distributed demand, which raises their operational costs significantly. As a result, horizontal cooperation are gaining momentum around the world. One of the major impediments, however, is the lack of stable and fair profit sharing mechanism. In this paper, we address this problem using the framework of computational cooperative games. We first present cooperative vehicle routing game as a model for collaborative logistics operations. Using the axioms of Shapley value as the conditions for fairness, we show that a stable, fair and budget balanced …
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Spatio-temporal matching of services to customers online is a problem that arises on a large scale in many domains associated with shared transportation (ex: taxis, ride sharing, super shuttles, etc.) and delivery services (ex: food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that matching of services to customers in one round has a direct impact on the matching of services to customers in the next round. For instance, in the case of taxis, in the second round taxis can only pick up customers closer to the drop off point of the customer from the first …
Enabling Carrier Collaboration Via Order Sharing Double Auction: A Singapore Urban Logistics Perspective, Handoko Stephanus Daniel, Hoong Chuin Lau
Enabling Carrier Collaboration Via Order Sharing Double Auction: A Singapore Urban Logistics Perspective, Handoko Stephanus Daniel, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
A recent exploratory study on the collaborative urban logistics in Singapore suggests that cost reduction and privacy preservation are two main drivers that would motivate the participation of carriers in consolidating their last mile deliveries. With Singapore's mild restrictions on the vehicle types or the time windows for the last-mile delivery, we believe that with proper technology in place, an Urban Consolidation Center like the Tenjin Joint Distribution System in Fukuoka Japan may be implemented to achieve cost reduction with some degree of privacy preservation. Participating carriers keep their respective private orders and have the option to get their remaining …