نتایج جستجو برای: location routing problem with time window
تعداد نتایج: 10057628 فیلتر نتایج به سال:
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
The solution of routing problems with soft time windows has valuable practical applications. Soft time window solutions are needed when: (a) the number of routes needed for hard time windows exceeds the number of available vehicles, (b) a study of cost-service tradeoffs is required, or (c) the dispatcher has qualitative information regarding the relative importance of hard time-window constrain...
The latency location routing problem (LLRP), a combination of the facility and cumulative capacitated vehicle problem, is recently proposed variant problems. It corresponds to customer-centric in which aim minimize sum arrival times at customers. This paper proposes three novel metaheuristic algorithms solve LLRP. They use simulated annealing framework, after each temperature reduction intensif...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید