This paper develops a multi-objective eco-routing algorithm (eco- and travel time-optimum routing) for battery electric vehicles (BEVs) internal combustion engine (ICEVs) investigates the network-wide impacts of proposed Nash optimum (user equilibrium) traffic assignment on large-scale network. Unlike ICEVs, BEVs are more energy efficient low-speed arterial trips compared with highway trips. Di...

The overall healthcare system has been prioritized within development top lists worldwide. Since many national populations are aging, combined with the availability of sophisticated medical treatments, expenditures rapidly growing. Blood banks a major component any system, which store and provide blood products needed for organ transplants, emergency routine surgeries. Timely delivery is vital,...

The improper delivery route planning of multi depot and assignment model leads the logistic operation in high travel distance distribution cost. This paper aim to explain integration vehicle routing problem (MDVRP) Geographical Information System (GIS) obtain optimum with minimum by using multi-objective mixed integer programming approach visualize its open-source public GIS integration. In thi...

Following the occurrence of unexpected events and natural disasters, a highly important relief operation is the transferring of relief commodities from the distribution centers (CDs) to shelters. In this paper, a three-level network consisting of depot of vehicles, distribution centers and shelters has been considered for routing and scheduling of relief vehicles through introducing a multi-obj...

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot...

This paper presents the investigation of an evolutionary multi-objective simulated annealing algorithm with variable neighborhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighborhood search to find more non-dominate...