نتایج جستجو برای: capacitated vehicle routing problem combinatorial optimization cuckoo search le vy flights

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

Journal: :Journal of Industrial Engineering International 2017

Journal: :DEStech Transactions on Social Science, Education and Human Science 2017

Journal: :Electronics 2022

The vehicle-routing problem (VRP) has many variants, including the most accurate models of real-life transportation tasks, making it one important mathematical problems in field logistics. Our goal was to design an algorithm that can race against recent solutions for VRP and capacitated (CVRP), while also being applicable with simulations real transports. is a variant bacterial memetic (BMA), w...

Journal: :Computers & Operations Research 2021

This work proposes a partial optimization metaheuristic under special intensification conditions (POPMUSIC) for the classical capacitated vehicle routing problem. The proposed approach uses branch-cut-and-price algorithm as powerful heuristic to solve subproblems whose dimensions are typically between 25 and 200 customers. whole can be seen application of local search over very large neighborho...

2007
Yongzhong Wu Ping Ji Ting Wang

Despite some successful applications of genetic algorithms (GAs) for solving the capacitated vehicle routing problems, they usually rely on problem-specific components or hybridization with other heuristics for obtaining competitive solutions. These problemspecific and hybridized characteristics complicate the GA implementation for solving reallife problems. In this paper, a pure GA for the cap...

2002
Ozlem Ergun James B. Orlin Abran Steele-Feldman Özlem Ergun

Neighborhood search algorithms are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the “neighborhood” of the current solution. This paper discusses neighborhood search algorithms where the size of the neighborhood is “very large” with respect to the size of the input data. For large problem instances, it is impractical to search these n...

Journal: :Operations Research 1995
Julien Bramel David Simchi-Levi

We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the Capacitated Concentrator Location Problem. We apply this framework to two classical routing problems: the Capacitated Vehicle Routing Problem and Inventory-Routing Problem. In the former case, the heuristic is proven to be asymptotically optimal for any distributio...

Journal: :Journal of Heuristics 2022

Abstract The Capacitated Vehicle Routing Problem (CVRP) has been subject to intense research efforts for more than sixty years. Yet, significant algorithmic improvements are still being made. most competitive heuristic solution algorithms of today utilize, and often combine, strategies elements from evolutionary algorithms, local search, ruin-and-recreate based large neighborhood search. In thi...

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

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