  The compactness of routes in distribution plans is a criterion that has not
been sufficiently explored in the literature related to logistics distribution
but has shown to have a significant impact on the practical implementation of
routing plans, for example in solid waste collection problems. In this regard,
this article presents a bi-objective model to optimize the vehicle routing
problem with time constraints, considering the minimization of travel times and
the compactness of routes. Experimental tests were conducted on small-scale
instances using two exact solution methods for multi-objective problems:
weighted sum and augmented {\epsilon}-constraint methods. The results obtained
allowed us to explore the trade-off relationship between both objectives while
evaluating the computational efficiency of both multi-objective solution
methods.
