An Application of a Traveling Salesman Problem with Independent Clusters for Cash-Collection Routing

Published in Annals of Operations Research. https://doi.org/10.1007/978-3-031-47859-8_26 Motivated by a routing problem faced by banks to enhance their encashment services in the  city of Perm, Russia, we solve versions of the traveling salesman problem with clustering. To minimize the risk of theft, suppliers seek to operate multiple vehicles and determine an efficient routing; and, a single vehicle serves … Read more

Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system

Published in Journal of Global Optimization. https://doi.org/10.1007/s10898-021-01041-y We develop a stochastic optimization model for scheduling a hybrid solar-battery storage system. Solar power in excess of the promise can be used to charge the battery, while power short of the promise is met by discharging the battery. We ensure reliable operations by using a joint chance … Read more