The phrase "a customer was visiting" is correct and usable in written English.
It can be used to describe a situation where a customer is in the process of visiting a place, such as a store or a service location.
Example: "While I was organizing the shelves, I noticed that a customer was visiting the store to inquire about our new products."
Alternatives: "a customer was present" or "a customer was in attendance".
As an example: assume that a customer is visiting your website and they click on a video and read two white papers.
For example, if a customer is visiting your Spanish dictionary page, it should be clear from the site's design how to click back to the home page, or even to the financial-dictionary page.
Another section shows what's "Now Playing" in the local store the customer is visiting.
VRPMPTW aims to find a set of routes of minimal total traveling cost and maximal customer satisfaction (with regard to the prioritized time windows), starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand.
In the MDVRP, there are several depots instead of just one depot and every customer is visited by a vehicle based at one of the several existing depots, while every vehicle route must start and end at the same depot.
If the customer is visited more than once, the different vehicles will deliver different sets of commodities.
Constraints (29) and (30) are the degree constraints of the main VRP problem and guarantee that each customer is visited exactly one time.
Delivery routes which start and finish at the depot are required for vehicles so that all customer demands are satisfied and each customer is visited by just one vehicle.
A solution to the CVRP consists of a collection of (K) routes with minimum travel cost for (K) identical vehicles each with capacity (C), such that each route for each vehicle must begin and end at the depot, each customer is visited exactly by one route, and the sum of the demand of the customers visited by a route does not exceed the vehicle capacity (C) (Ralphs et al. 2003; Kumar et al. 2014).
The goal of this problem is to design a set of tours for the vehicles, start and end their tours at the distribution center such that all customers are visited with minimum transportation cost (Çatay 2010).
