The k-dissimilar vehicle routing problem

Talarico, Luca; Sörensen, Kenneth; Springael, Johan

doi:10.1016/j.ejor.2015.01.019

Cited by 41 publications

(30 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite being a critical point with regard to safety, only a few papers address the dissimilarity of the tours, and the VRP version is, as usual, the starting point. Talarico et al defined and studied the

k

‐dissimilar VRP (

k

d‐VRP), where the similarity between two VRP solutions is defined based on the edges shared between them. The aim is to identify

k

dissimilar VRP solutions, that is, tours, starting and ending at a depot node, visiting all clients once, and within the vehicles’ capacity.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Conditions (2) and (3) imply the continuity of the vehicle tours at each node, considering three different types of nodes: starting, ending or intermediate; (4)- (7) fix the depot as the starting point of the first period = 1 ( (4) and (5)), and ending point of the last period = |L| ( (6) and (7)), each day; (8) and (9) guarantee that each task is serviced once a day and in only one period; (10) imposes a minimum number of services per period, used to define the size of the periods to impose the similarities; (11) and (14) are flow conservation constraints for the first period, while (12), (13), (15), and (16) represent these constraints for the remaining periods; these, together with the linking constraints (17) and (18) force the connectivity of the vehicle tours. Note that (11) are typical generalized flow conservation constraints at each node i, guaranteeing that if an arc (j, i) is served in the first period, then a unit of flow is absorbed at node i.…”

Section: Flow Based Modelmentioning

confidence: 99%

“…, |L|) and for all nodes that do not represent its starting node. Constraints (14) compute the flow leaving the depot as the number of tasks served during the first period, while (15) and (16) Although giving rise to an undesirable increase in the number of constraints, we note that (24) and (25) may be generalized to consider more than two consecutive days. Without this generalization, we may get solutions where day h + 2 is a replica of day h, and so on, which may represent a model handicap.…”

Section: Flow Based Modelmentioning

confidence: 99%

See 2 more Smart Citations

Dissimilar arc routing problems

2017

View full text Add to dashboard Cite

Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When the safes to be collected are located along the streets, it corresponds to an arc routing problem, which we call D normalA normalR normalP , and when the money is from ATMs, it corresponds to a vehicle routing problem, usually referred to as the peripatetic routing problem. The former problem arises in a Portuguese company in charge of street parking in Lisbon. The firm needs to define tours to collect safes from parking meters, minimizing the total collecting time. To avoid robberies these tours cannot be repeated or somehow anticipated. For this new problem, we present a mixed integer linear programming (MILP) model and develop a matheuristic. Preliminary experiments are provided with data that mimic the real confidential data. Results point to a good performance of the matheuristic, while the smaller instances can be solved to optimality with the MILP model and a commercial solver. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 233–245 2017

show abstract

k

‐dissimilar VRP (

k

d‐VRP), where the similarity between two VRP solutions is defined based on the edges shared between them. The aim is to identify

k

dissimilar VRP solutions, that is, tours, starting and ending at a depot node, visiting all clients once, and within the vehicles’ capacity.…”

Section: Literature Reviewmentioning

confidence: 99%

Section: Flow Based Modelmentioning

confidence: 99%

Section: Flow Based Modelmentioning

confidence: 99%

See 1 more Smart Citation

Dissimilar arc routing problems

2017

View full text Add to dashboard Cite

show abstract

“…Talarico et al. () considered the cash transportation problem as a practical application of the k‐dissimilar VRP. In order to increase unpredictability, an index of similarity, on the basis of the number of identical edges common between alternative solutions, was proposed.…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

A cash transportation vehicle routing problem with combinations of different cash denominations

Szeto

et al. 2019

Int Trans Operational Res

View full text Add to dashboard Cite

This paper investigates a new cash transportation problem, which is a variant of the capacitated vehicle routing problem. To better satisfy the demands of customers (e.g., banks, large retailers, shopping centers, automated teller machines, etc.), the combination of different cash denominations (i.e., $100, $50, $20, etc.) is considered. The robbery risk, which is measured by both the amount of cash being carried and the distance covered by the vehicle carrying the cash, is limited by a risk threshold. The problem is formulated as mixed‐integer linear programming to minimize the total cost, which consists of the total travel cost and the total penalties due to the unmet expected demand of customers. A combined hybrid tabu search metaheuristic is proposed to solve this problem. Tabu search is adopted for determining routing decisions while three methods, namely the exact method, the greedy method, and the mixed method, are proposed to be embedded within the tabu search to determine the denomination combination strategy. The numerical studies show that the proposed method makes a good tradeoff between the solution quality and the computation time. Experimental results also reveal the effects of the unit penalty and the risk threshold.

show abstract

“…Therefore, this approach could be used for generating more flexible routing strategies in order to reduce the risk of robbery. In Talarico et al (2015b), an index of similarity, based on the number of identical edges common between alternative solutions, is presented. Furthermore, both a mathematical formulation, which generalizes the well-known "peripatetic" routing problem, and an iterative metaheuristic are presented to generate a set of k dissimilar and not necessarily edge-disjoint solutions for the VRP.…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

A biobjective decision model to increase security and reduce travel costs in the cash‐in‐transit sector

Talarico

Sörensen

Springael

2015

Int Trans Operational Res

View full text Add to dashboard Cite

In this paper, we present a variant of the vehicle routing problem (VRP) to increase security in the cash-intransit sector. A specific index is used for quantifying the exposure of a vehicle to the risk of being robbed along its route. In addition, the problem is subject to a traditional capacity constraint, which limits the maximum amount of valuables that can be transported inside the vehicle. This constraint might be imposed, for example, by insurance companies. A biobjective formulation, aimed at reducing both risk and travel costs, is proposed. The objectives are conflicting since higher risk exposures would allow a reduction of the travel costs incurred by a transportation firm to visit all its customers for the collection of cash. A mathematical model of the problem is described and solved using a progressive multiobjective metaheuristic. Multiobjective optimization and multicriteria decision making are integrated into a single metaheuristic algorithm. To simplify the decision process, the decision maker's preferences are embedded into the multiobjective algorithm. Realistic instances are generated considering the geographical coordinates of several customers (e.g., stores, banks, shopping centers) located in Belgium. The proposed solution approach is tuned and tested both on these realistic instances and standard benchmark instances for the capacitated VRP.

show abstract

The k-dissimilar vehicle routing problem

Cited by 41 publications

References 36 publications

Dissimilar arc routing problems

Dissimilar arc routing problems

A cash transportation vehicle routing problem with combinations of different cash denominations

A biobjective decision model to increase security and reduce travel costs in the cash‐in‐transit sector

Contact Info

Product

Resources

About