نتایج جستجو برای: depot multi
تعداد نتایج: 468814 فیلتر نتایج به سال:
Supply chain excellence has a real huge impact on business strategy. Building supply chains (SCs) as flexible system represents one of the most exciting opportunities to create value. This requires integrated decision making amongst autonomous chain partners with effective decision knowledge sharing among them. The key to success lies in knowing which decision has more impact on the supply chai...
Abstract In this paper, we study the multi-depot k -traveling repairman problem. This problem extends traditional traveling to case. Its objective, similar single depot variant, is minimization of sum arrival times customers. We propose two distinct formulations model problem, obtained on layered graphs. order find feasible solutions for largest instances, a hybrid genetic algorithm where initi...
The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, distribution centers strive for competitive efficiency operations minimize transportation costs. This study proposed mixed-integer programming (MIP) model multi-depot split-delivery vehicle routing problems (MDSDVRPs) with ...
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.03.077 ⇑ Corresponding author. Tel.: +90 212 3832868. E-mail addresses: [email protected] (G.N. Y (N.Ç. Demirel). In this paper, a new type of geometric shape based genetic clustering algorithm is proposed. A genetic algorithm based on this clustering technique is developed for the solution process of the multi-depot...
We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The MDMTSP is an NPhard problem because it includes the TSP as a particular case when there is only one dep...
This paper deals with the key issue of management to improve the allocation capability, facilitating the optimization of the objective in minimizing the cost, with the accuracy in dynamic allocation of nearest customers to depot. A method has been proposed to solve the Multi Depot Vehicle Routing Problem (MDVRP) based on Ant Algorithm which is a modified version of the traditional Ant colony Op...
We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multi-depot VRP, the periodic VRP, and the multi-depot periodic VRP with capacitated vehicles and constrained route duration. The meta-heuristic combines the exploration breadth of population-based evolutionary search, the aggressive improvement capabilities of neighborhood-based meta-heuristics,...
The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
The min-max Split Delivery Multi-Depot Vehicle Routing Problem with Minimum Service Time Requirement (min-max SDMDVRP-MSTR) is a variant of the Multi-Depot Vehicle Routing Problem. Each customer requires a specified amount of service time. The service time can be split among vehicles as long as each vehicle spends a minimum amount of service time at a customer. The objective is to minimize the ...
Nowadays transportation problems are drawing more attention with respect to increasing demand for receiving products and services due to population increase and expansion of cities. One of the most important issues of transportation problems which are drawing the attention of the most researchers is vehicle routing problem. In this research, a new linear integer programming for multi-depot vehi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید