T fleet size and mix vehicle routing problem with time windows (FSMVRPTW) is the problem of determining, at the same time, the composition and the routing of a fleet of heterogeneous vehicles aimed to serve a given set of customers. The routing problem requires us to design a set of minimum-cost routes originating and terminating at a central depot and serving customers with known demands, with...

Electric vehicles (EVs) have great potential as a modern mobility concept. Electricity already relies on a broad infracstructure and is available anywhere in developed countries. Furthermore, EVs are emmission-free which makes them the preferable form of individual transportation in urban areas where air pollution is often alarmingly high. However, operating EVs has several drawbacks compared t...

This paper introduces a green inventory routing problem with a heterogeneous fleet which extends the conventional inventory routing problem by considering environmental impacts and heterogeneous vehicles. A comprehensive objective is proposed, which minimizes the sum of inventory cost and routing cost, where the latter includes driver wage, vehicle fixed cost, fuel and emission costs, in which ...

As an emerging variant of the vehicle loading problem, the heterogeneous multi-type fleet vehicle loading problem in finished vehicle logistics (HVLP-FVL) is modeled and solved. The HVLPFVL maximizes the total profit of a vehicle fleet where different models of finished vehicles result in different profits and routing costs are considered based on distance travelled. Addressing the vehicle stru...

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

The Heterogeneous Fleet Vehicle Routing Problem (HFVRP) is an important variant of the classical Capacitated (CVRP) that aims to find routes minimize total traveling cost a heterogeneous fleet vehicles. This problem great interest given its importance in many industrial and commercial applications. In this paper, we present Adaptive Iterated Local Search (AILS) heuristic for HFVRP. AILS local s...

We consider the problem of simultaneously selecting customers to be served by external carriers and routing a heterogeneous internal fleet. Very little attention was devoted to this problem. A recent paper proposed a heuristic solution procedure. Our paper shows that better results can be obtained by a simple method and corrects some erroneous results presented in the previous paper.