نتایج جستجو برای: capacitated vehicle routing problem

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

2011
Lijun Wei Zhenzhen Zhang Defu Zhang Stephen C. H. Leung

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combinatio...

Journal: :International Journal of Industrial Engineering Computations 2021

Journal: :Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 2021

In capacitated vehicle routing problem (CVRP), a fleet of vehicles with certain capacity starts at central depot and returns to this starting point after serving some customers by using the optimal set routes minimum cost. However, in real-life, environments may include obstacles such as holes, machines, or trees different sizes. research, CVRP extension is proposed that classical one for vario...

Journal: :International Journal of Advanced Computer Science and Applications 2017

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

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