A A Multi-Objective Mathematical Model for Vehicle Routing Problem Considering the Time Window and Economic and Environmental Objectives Using the Metaheuristic Algorithm Based on Pareto Archive

Abstract

Purpose:  The purpose of this study is the well-known Heterogeneous Fleet Vehicle Routing Problem (HVRP) is one of the developed problems of vehicle routing, which involves optimizing a set of routes for a fleet of vehicles with different costs and capacities.

Methods: HVRP is usually modeled as a single objective that aims to minimize overall transportation costs (total fixed costs and costs commensurate with total distance).

Results: These vehicles are located in the central depot and serve customers’ demands.

Implications: In this case, the number of vehicles available (of any type) may be limited.