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 - 4 of 4
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Officers: Operational Framework For Intelligent Crime-And-Emergency Response Scheduling, Jonathan David Chase, Siong Thye Goh, Tran Phong, Hoong Chuin Lau
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 …
Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen
Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
This paper studies the Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) as the extension of the Single-Vehicle CIRP (SV-CIRP). The objective is to minimize both distribution and inventory costs at the customers and to maximize the collected rewards simultaneously. The problem is treated as a single objective optimization problem. A subset of customers is selected for each vehicle including the quantity to be delivered to each customer. For each vehicle, a cyclic distribution plan is developed. We construct a mathematical programming model and propose a simulated annealing (SA) metaheuristic for solving both SV-CIRP and MV-CIRP. For SV-CIRP, experimental results on benchmark …
Well-Tuned Algorithms For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen, Kun Lu
Well-Tuned Algorithms For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen, Kun Lu
Research Collection School Of Computing and Information Systems
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start. The objective of the TOPTW is to maximize the total collected score by visiting a set of nodes with a limited number of paths. We propose two algorithms, Iterated Local Search and a hybridization of Simulated Annealing and Iterated Local Search (SAILS), to solve the TOPTW. As indicated in multiple research works on algorithms for the OP and its variants, determining appropriate parameter values in a statistical …
Sails: Hybrid Algorithm For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu
Sails: Hybrid Algorithm For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu
Research Collection School Of Computing and Information Systems
The Team Orienteering Problem with Time Windows (TOPTW) is the extended version of the Orienteering Problem where each node is limited by a given time window. The objective is to maximize the total collected score from a certain number of paths. In this paper, a hybridization of Simulated Annealing and Iterated Local Search, namely SAILS, is proposed to solve the TOPTW. The efficacy of the proposed algorithm is tested using benchmark instances. The results show that the proposed algorithm is competitive with the state-of-the-art algorithms in the literature. SAILS is able to improve the best known solutions for 19 benchmark …