Visual attractiveness in vehicle routing via bi-objective optimization. (January 2022)

• Record Type: Journal Article
• Authors: Rocha, Diego; Aloise, Daniel; Aloise, Dario J.; Contardo, Claudio
• Is Part Of: Computers & operations research. Volume 137(2022)
• Publication Date: 2022-01
• Subjects: Vehicle routing problem -- Visual attractiveness -- Clustering; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2021.105507
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: We formulate the problem of finding vehicle routing solutions that are cost-effective and visually attractive. We propose a compact mathematical model for this multiobjective problem. We introduce a genetic algorithm, namely a NSGA-II heuristic to approximate the Pareto frontier. Our framework is effective at characterizing vehicle routing solutions of low cost and visually attractive. Abstract: We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this paper we argue that clustering, a popular data mining task, provides a good proxy for visual attractiveness. Our claim is supported by the proposal of a bi-objective capacitated vehicle routing problem in which, in addition to seek for traveling cost minimization, optimizes clustering criteria defined over the customers partitioned in the different routes. The model is solved by a multi-objective evolutionary algorithm to approximate its Pareto frontier. We show, by means of computational experiments, that our model is able to characterize vehicle routing solutions with low routing costs which are, at the same time, attractive according to the visual metrics proposed in the literature.