Sentence examples for depot problem from inspiring English sources

The PFIH method was first introduced by[Solomon (1987]) to create an initial route configuration for each single depot problem in a time unit of the planning horizon (for more details, see[Solomon (1987])).

A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid genetic algorithm.

A two-phase approach was used in which, in the first phase, the multi-depot locomotive assignment was converted to a set of single depot problems, and after that, each single depot problem was solved heuristically by a hybrid genetic algorithm.

In this paper, the cluster-first, route-second approach is used to convert the multi-depot locomotive assignment to P single depot problems (for more details, see[Ghoseiri and Ghannadpour (2010])).

In this paper, we formulate the emergency resource allocation problem with constraints of multiple resources and possible secondary disasters, and model the multiple resources and multiple emergency response depots problem considering multiple secondary disasters by an integer mathematical programming.

An approach for dealing with oil depot scheduling problem by MILP models is presented.

Ray et al. (2014) stated a multi-depot logistics delivery problem including the depot selection and shared commodity delivery.

The generalized multiple depot traveling salesmen problem (GMDTSP) is a variant of the multiple depot traveling salesmen problem (MDTSP), where each salesman starts at a distinct depot, the targets are partitioned into clusters and at least one target in each cluster is visited by some salesman.

This article presents a survey of genetic algorithms that are designed for solving multi depot vehicle routing problem.

Also, Wu et al. (2002) considered multi depot location routing problem which the location of the depots must be chosen from potential locations and should be specified the routes to serve the customers from depots.

In this paper, we discuss the fixed-destination, multi-depot travelling salesman problem, where several salesmen will start from different depots, and they are required to return to the depot they originated from.