In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

Electric vehicle routing problems (E-VRPs) deal with a fleet of electric vehicles (EVs) to serve set customers while minimizing an operational criterion, for example, cost or time. The feasibility the routes is constrained by autonomy EVs, which may be recharged along route. Much E-VRP research neglects capacity charging stations (CSs) and thus implicitly assumes that unlimited number EVs can s...

In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...

We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...

The supply chain of agricultural products has received a great deal of attention lately due to issues related to public health. Something that has become apparent is that in the near future the design and operation of agricultural supply chains will be subject to more stringent regulations and closer monitoring, in particular those for products destined for human consumption (agri-foods). This ...