نتایج جستجو برای: locomotive routing problem
تعداد نتایج: 920287 فیلتر نتایج به سال:
This paper studies the target visitation arc routing problem on an undirected graph. combines well-known rural postman and linear ordering problem. In this problem, there is a set of required edges partitioned into targets, which must be traversed are pairwise preferences for order in some targets serviced, generates revenue if preference satisfied. The aim to find tour that traverses all at le...
This paper introduces the fish feed production routing problem (FFPRP) faced by Norwegian salmon producers. The FFPRP is comprised of a scheduling and rich vehicle (VRP) thus denotes variant integrated problem. We present discrete time mixed integer programming (MIP) model FFPRP. Specifically, incorporates multi-product, multi-trip, multi-depot setting, where orders are produced at lines factor...
In this research it was considered the particular case of a railway problem, specifically, the construction of orders delivery schedule for one locomotive plying among three railway stations. In this paper it was suggested a polynomial algorithm and were shown the results of a computing experiment.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید