نتایج جستجو برای: routing problem time window bi

تعداد نتایج: 2657033  

2010
E. Nikbakhsh

The location-routing problem is one of the most important location problems for designing integrated logistics systems. In the last three decades, various types of objective function and constraints have been considered for this problem. However, time window constraints have received little attention, despite their numerous real-life applications. In this article, a new 4-index mathematical mod...

Journal: :Mathematics 2022

To solve the location-routing problem of maritime emergency materials distribution (MEMD-LRP) multi-agent joint decision, a bi-level programming model MEMD-LRP is constructed. The established on premise considering rescue time window and priority, aiming at strong regional characteristics accidents, timeliness rescue, great difficulty high cost so on. From point view management department, uppe...

Journal: :Transportation Research Part B: Methodological 2013

2013
Peter Kurdel Jolana Sebestyénová

The cash deployment strategy for a network of ATMs should take into account the analysis of inventory policies, logistics costs as well as the routing of replenishment vehicles. The optimal strategy has to focus on the reduction of cash-related expenses while safeguarding that ATMs do not run out of cash. Shorter routes with high time window constraints violations are not always the best soluti...

Journal: :International Journal of Computing 2014

2013
Abdel-Rahman Hedar Mohammed Abdallah Bakr

In the vehicle routing problem with time window (VRPTW), the objective is to minimize the number of vehicles and then minimize the total time travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced ...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید