نتایج جستجو برای: single vehicle and multi vehicle generalized traveling salesman problem
تعداد نتایج: 17155283 فیلتر نتایج به سال:
The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...
Vehicle routing problems attempt to define optimal delivery methods of goods to places. I examined the capacitated vehicle routing problem that determines the least cost route to deliver objects to customers using a single vehicle of fixed capacity. Vehicle routing problems attract considerable attention because of their implications for delivery businesses. My variant of the problem differs fr...
In the Single-Double Balanced Traveling Salesman Problem (SDB-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days). The salesman’s objective is to minimize the total distance travelled over the two tours; moreover, the number of customers visited in every tour must be ‘balanced’, i.e the difference between...
in this paper we address the vrpcd, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. the products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. the objective of the vrpcd is to minimize the total traveled distance while respe...
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
Last-mile routing refers to the final step in a supply chain, delivering packages from depot station homes of customers. At level single van driver, task is traveling salesman problem. But choice route may be constrained by warehouse sorting operations, van-loading processes, driver preferences, and other considerations rather than straightforward minimization tour length. We propose simple eff...
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is defined as a route on which the vehicle first visits customers in increasing order of custom...
In this paper, we present a path planner for low-altitude terrain coverage in known environments with unmanned rotary-wing micro aerial vehicles (MAVs). Airborne systems can assist humanitarian demining by surveying suspected hazardous areas (SHAs) cameras, ground-penetrating synthetic aperture radar (GPSAR), and metal detectors. Most available implementations MAVs do not consider obstacles thu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید