The probabilistic travelling salesman problem with crowdsourcing

Santini, Alberto; Viana, Ana; Klimentova, Xenia; Pedroso, João Pedro

doi:http://dx.doi.org/10.1016/j.cor.2022.105722

The probabilistic travelling salesman problem with crowdsourcing

License

Citation

Santini A, Viana A, Klimentova X, Pedroso JP. The probabilistic travelling salesman problem with crowdsourcing. Comput Oper Res. 2022;142:105722. DOI: 10.1016/j.cor.2022.105722

Abstract

We study a variant of the Probabilistic Travelling Salesman Problem arising when retailers crowdsource last-mile deliveries to their own customers, who can refuse or accept in exchange for a reward. A planner must identify which deliveries to offer, knowing that all deliveries need fulfilment, either via crowdsourcing or using the retailer’s own vehicle. We formalise the problem and position it in both the literature about crowdsourcing and among routing problems in which not all customers need a visit. We show that to evaluate the objective function of this stochastic problem for even one solution, one needs to solve an exponential number of Travelling Salesman Problems. To address this complexity, we propose Machine Learning and Monte Carlo simulation methods to approximate the objective function, and both a branch-and-bound algorithm and heuristics to reduce the number of evaluations. We show that these approaches work well on small size instances and derive managerial insights on the economic and environmental benefits of crowdsourcing to customers.