نتایج جستجو برای: depot vehiclerouting problem with inter

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

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

Journal: :Mathematics 2022

Municipal waste management has become a challenging issue with the rise in urban populations and changes people’s habits, particularly developing countries. Moreover, government policy plays an important role associated municipal management. Thus, this research proposes regional location routing problem (RLRP) model multi-depot (MRLRP) model, which are extensions of (LRP), to provide better col...

This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, ...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده علوم انسانی 1393

this study investigates the problem of translating religious allusions in persian literature, namely the ones borrowed from quranic verses and hadiths. the purpose of this study is to shed light on how different translators dealt with such a task and also to provide guidelines for translators in coping with religious allusions.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شاهد - دانشکده فنی و مهندسی 1387

abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...

عبدالرحیمی، , حجت , عیدی، , علیرضا ,

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...

2013
Vera Mersheeva Gerhard Friedrich

In this paper we provide methods for the Continuous Monitoring Problem with Inter-Depot routes (CMPID). It arises when a number of agents or vehicles have to persistently survey a set of locations. Each agent has limited energy storage (e.g., fuel tank or battery capacity) and can renew this resource at any available base station. Various realworld scenarios could be modeled with this formulati...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

Journal: :journal of optimization in industrial engineering 2010
ellips masehian

among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 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...

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

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