The rise in instant delivery services necessitates efficient route planning in last-mile delivery scenarios, where new orders arrive dynamically and need to be integrated into existing routes. In such contexts, complete re-optimization of routes are not permitted, and node insertion to existing route sequences is the only viable option. However, many existing heuristics for node insertion, such as the Cheapest Insertion (CI) method, are myopic and often result in suboptimal solutions retrospectively. This paper presents Neuro-Ins, an initial yet novel attempt at harnessing a learning-based framework to handle the insertion of new orders for the Pickup and Delivery Problem (PDP). In contrast to CI, which considers only one node at a time for insertion, Neuro-Ins leverages an Attention-Mechanism (AM) based encoder-decoder structure to collectively consider all nodes to be inserted, thereby enhancing the quality of the eventual solution. To further improve the model's representation of the current route, we introduce a position embedding to enrich the node feature embedding with positional information of the route. Experiments on synthetic and real-world datasets demonstrate that Neuro-Ins, trained by PPO, consistently outperforms CI without compromising computational speed, and it also surpasses the performance of state-of-the-art solution methods implemented in the industry. Our findings emphasize the importance of explicitly considering all nodes to be inserted along with the en-route nodes and their positions in the route, showcasing the efficacy of the proposed AM-based framework in optimizing the instant delivery routes.

This paper addresses the challenge of optimizing large-scale retail expansion in competitive urban environments through a data-driven and automated approach to the Competitive Facility Location (CFL) problem. Traditional CFL methods often face limitations in handling large-scale scenarios, relying on manual pre-selection of candidate sites and imposing restrictions on the number of new locations. Our approach uses Adaptive Large Neighborhood Search (ALNS) enhanced with data enrichment techniques, such as community detection on road networks and population weighting based on mobility data. We developed 2 ALNS variants: Community Geometric Centroid (CGC-ALNS) and Population Weighted Centroid (PWC-ALNS). These methods automate the site selection process, eliminating the need for manual pre-selection and enabling evaluation of a large number of store locations. We benchmarked our approaches against ArcGIS, a widely used commercial software for CFL problems. The results demonstrate notable improvements in performance: CGC-ALNS consistently outperforms ArcGIS with up to a 2% increase in consumer count captured, while PWCALNS achieves even greater gains, with an average increase of 4.6% to 13.1% across various store distribution scenarios. Our key contributions include an automated, data-driven site selection process with no restrictions on the number of new sites, and significant performance improvements over existing commercial solutions.

Conventional methodologies for new retail store catchment area and footfall estimation rely on ground surveys which are costly and time-consuming. This study augments existing research in footfall estimation through the innovative integration of mobility data and road network to create population-weighted centroids and delineate residential neighbourhoods via a community detection algorithm. Our findings are then used to enhance Huff Model which is commonly used in site selection and footfall estimation. Our approach demonstrated the vast potential residing within big data where we harness the power of mobility data and road network information, offering a cost-effective and scalable alternative. It obviates the reliance on often outdated census data and government urban planning records, positioning itself as a formidable driver of informed retail strategy. In doing so, our approach is poised to deliver substantial value to the retail industry.

In this article, we investigate effective ways of utilizing crowdworkers in providing various urban services. The task recommendation platform that we design can match tasks to crowdworkers based on workers’ historical trajectories and time budget limits, thus making recommendations personal and efficient. One major challenge we manage to address is the handling of crowdworker’s trajectory uncertainties. In this article, we explicitly allow multiple routine routes to be probabilistically associated with each worker. We formulate this problem as an integer linear program whose goal is to maximize the expected total utility achieved by all workers. We further exploit the separable structures of the formulation and apply the Lagrangian relaxation technique to scale up computation. Numerical experiments have been performed over the instances generated using the realistic public transit dataset in Singapore. The results show that we can find significantly better solutions than the deterministic formulation, and in most cases we can find solutions that are very close to the theoretical performance limit. To demonstrate the practicality of our approach, we deployed our recommendation engine to a campus-scale field trial, and we demonstrate that workers receiving our recommendations incur fewer detours and complete more tasks, and are more efficient against workers relying on their own planning (25% more for top workers who receive recommendations). This is achieved despite having highly uncertain worker trajectories. We also demonstrate how to further improve the robustness of the system by using a simple multi-coverage mechanism.

Orienteering Problems (OPs) are used to model many routing and trip planning problems. OPs are a variant of the well-known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of vertices and has an overall travel time less than a specified deadline. However, the applicability of OPs is limited due to the assumption of deterministic and static travel times. To that end, Campbell et al. extended OPs to Stochastic OPs (SOPs) to represent uncertain travel times (Campbell et al. 2011). In this article, we make the following key contributions: (1) We extend SOPs to Dynamic SOPs (DSOPs), which allow for time-dependent travel times; (2) we introduce a new objective criterion for SOPs and DSOPs to represent a percentile measure of risk; (3) we provide non-linear optimization formulations along with their linear equivalents for solving the risk-sensitive SOPs and DSOPs; (4) we provide a local search mechanism for solving the risk-sensitive SOPs and DSOPs; and (5) we provide results on existing benchmark problems and a real-world theme park trip planning problem.