Multi-objective periodic cash transportation problem with path dissimilarity and arrival time variation

Abstract

This paper introduces a multi-objective periodic routing problem in the context of cash transportation, which attempts to increase security by generating unpredictable alternative paths and spreading arrival times at each demand node. The current study covers the shortcomings of previous models on dissimilar routing and cash transportation problems from several aspects. The studied problem has tri objectives, including completion times, risk of robbery, and customers' satisfaction level considering the effects of traffic congestion as a daily phenomenon. On top of these, we extend the studied routing problem in multigraph setting, which can keep a set of efficient paths with multiple attributes (e.g., risk, time). Such representation enables us to evoke dissimilar route plans not only by reordering the sequence of nodes but also by employing alternative links even in a fix sequence of nodes. To handle the computational challenges arising from these properties, we propose a new evolutionary algorithm based on NSGA-II. The proposed method is embedded with a fuzzy logic technique to guide the applied operators and benefits from caching memory to accelerate and diversify the searching process. The results of implementing the proposed algorithm on test instances confirm the effectiveness of our method in compression to standard NSGA-II. In addition, our performed sensitivity analyses show that the multigraph setting can substantially improve the quality of solutions with respect to all studied objectives.

A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty

“…Furthermore, four works in the literature applied time spread constraints (as a modification of TW) in cash transport operations which diversify the arrival at each customer over multiple periods. In this regard, we refer interested readers to Michallet et al (2014), Hoogeboom and Dullaert (2019), Tikani et al (2020a), andSoriano et al (2020) for more details.…”

“…Such models include features to vary the designated routes and control the risk by preventing the reuse of already traversed links. Herein, we can refer to Yan et al (2012), Bozkaya et al (2017), Tikani et al (2020a), Ghannadpour and Zandiyeh (2020) for such studies. Table 1 summarizes the studies of CIT routing problems and compares the current study to the most related works in the literature.…”

Multigraph Modeling for Urban Distribution of Emergency Commodities with Semisoft Time Windows under Uncertainty

“…ey proposed a nonlinear mathematical model which minimized the total weighted completion time where the reliability of routes was controlled to be more than a predetermined threshold value. Two other works which focused on routing application in multigraphs are Tikani and Setak [24] and Tikani and Setak [25].…”

“…Constraints ( 22)-( 23) compute the service completion time at each demand node in each scenario. Constraint (24) imposes that the maximum service completion time should be less than TW β i . Moreover, constraint (25) computes the allowable late arrival time at each node.…”

Finding shortest and dissimilar paths

“…Again, an ILP model and a heuristic are the approaches used to deal with the problem. Tikani et al (2021) extend such applications given them a time-dependent perspective, while still taking the risk of robberies and the effects of traffic congestion into account. They propose an evolutionary algorithm for finding solutions for the problem, which includes a caching mechanism and fuzzy logic approach to dynamically adjust the rates of operators during the searching process.…”