The phrase "a single depot" is correct and usable in written English.
It can be used when referring to one specific storage or distribution location, often in the context of logistics or transportation.
Example: "The company decided to consolidate its operations into a single depot to improve efficiency and reduce costs."
Alternatives: "one depot" or "a lone depot".
This paper presents a novel solution approach for planning cyclic distribution from a single depot to multiple customers with constant, deterministic demand rates.
This article investigates the reverse logistics vehicle routing problem with a single depot, simultaneous distribution and collection of the goods by a homogeneous fleet of vehicles under the restrictions of maximum capacities and maximum distance.
The single-vehicle cyclic inventory routing problem (SV-CIRP) is concerned with a repeated distribution of a product from a single depot to a selected subset of retailers having stable demands.
The classical VRPB is the problem of designing minimum cost routes from a single depot to two type customers that are known as Backhaul (pickup) and Linehaul (delivery) customers where deliveries after pickups are not allowed.
After randomization, oral GCs were prescribed to 22 patients, and 14 patients were given a single depot of intramuscular GC.
In a regular VRP, a fleet of vehicles is based at a single depot to serve demands for a set of geographically dispersed customers.
Beginning of LRP development can be traced back to 70 and 80s when Laporte and Nobert (1981) presented a single-depot model which was subsequently used by other researchers.
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.
Extensive numerical experiments are presented on different sets of benchmark instances for the homogeneous and the heterogeneous single depot dial-a-ride problem.
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])).
