Cyclic routing problems are a well-researched category of combinatorial problems in
Operations Research (OR). They involve finding an optimal cycle (route), starting from an …

This paper presents a study on the application of Autonomous Delivery Vehicles (ADVs) in
last-mile delivery for urban logistics. Specifically, we focus on a routing problem using multi …

Abstract Covering Tour Problem (CTP) is a combinatorial optimization problem in which the
objective is to identify a minimum-cost tour that satisfies the coverage of a certain subset of …

Abstract The Multi-vehicle Covering Tour Problem and the Bi-Objective Multi-vehicle
Covering Tour Problem have been studied for more than thirty years. Both problems have …

In a routing framework, it may not be viable to visit every single customer separately due to
resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; ie …

Safe and secure vehicle routing problems refer to the transportation of dangerous (eg,
flammable liquids) or valuable goods (eg, cash), the surveillance of streets (eg, police …

The well-known multi-vehicle covering tour problem (m-CTP) involves finding a minimum-
length set of vehicle routes passing through a subset of vertices, subject to constraints on the …

This paper introduces the multi-vehicle cumulative covering tour problem whose motivation
arises from humanitarian logistics. The objective is to determine a set of tours that must be …

This paper introduces a new flow‐based mathematical formulation for the multivehicle
covering tour problem. This problem determines a set of vehicle routes for the available fleet; …

In most Swiss municipalities, a curbside system consisting of heavy trucks stop** at almost
each household is used for non-recoverable waste collection. Due to the many stops of the …