… short routes with up to 15 or 20 visits. For such small problems, even simple neighborhood
search methods for the TSP tend to produce optimal … with smallest average route cardinality, …

… corresponds to an elementary shortest path problem. Finally, … 1) minimizes the overall cost
of the selected routes. Constraints … , we chose to limit the cardinality of C to a maximum size (…

… optimization problem of designing routes for vehicles to visit … and Ramser, that searches for
optimal routes for a fleet of robots … In [9], a heuristic approach to solve the conflict-free routing …

… the solution approach. We formalize the problem as a special … visited by a vehicle, tij is the
shortest distance from node i to … k and compute a maximum cardinality matching starting from …

… investigated, which aims to minimize total cost and customer … approach, that integrates
glowworm swarm optimization … be merged with the remaining shortest route. The motivation is that…

… among vehicles as long as each vehicle spends a minimum … The objective is to minimize
the duration of the longest route (… longest route that splits a customer with another shorter route…

… Methods for finding L1-shortest paths generalize to the case … We consider now some other
network optimization problems, … ) for subsets of sites of any cardinality (not just 2 sites, as in …

… has support defined by cardinality constrained sets. The … We adopt a robust optimization
approach where demand varies … is a robust elementary shortest path problem with resource …

… preprocessing for vehicle routing problems on road networks… multi-objective combinatorial
optimization problems. Given a … studied the cardinality of the set of Pareto-optimal solutions for …

… as a two-stage stochastic optimization problem, where time … From an algorithmic viewpoint,
our approach can be easily … objective value of the corresponding optimal route sets (equal to …