The multi-compartment electric vehicle routing problem (EVRP) with soft time window and multiple charging types (MCEVRP-STW&MCT) is studied, in which vehicles that are environmentally friendly but need to be recharged course of transport process, employed. A mathematical model for this optimization established the objective minimizing function composed cost, distribution penalty cost service co...

Most navigation systems use data from satellites to provide drivers with the shortest-distance, shortest-time or highway-preferred paths. However, when the routing decisions are made for advanced vehicles, there are other factors affecting cost, such as vehicle powertrain type, battery state of charge and the change of component efficiencies under traffic conditions, which are not considered by...

An electric vehicle routing problem (EVRP) with time windows is carried out using a hybrid algorithm. Through the modeling of problem, not only energy consumptions and charging durations EDVs, but also conventional flow formulations soft window constraints are taken into account. A solution method proposed to solve EVRP. The combines genetic algorithm simulated annealing complement each other. ...

Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...