In this research process, the aim is to determine shortest route for transporting waste with or minimum total distance. case, what must be considered transportation of waste, regarding distance between location source landfills. The problem routes can made in a mathematical method. method used Capacitated Vehicle Routing Problem (CVRP) solving using CVRP method, minimized optimized Particle Swa...

The soft-clustered vehicle-routing problem is a variant of the classical capacitated (CVRP) in which customers are partitioned into clusters and all same cluster must be served by vehicle. We introduce novel symmetric formulation clustering part modeled with an asymmetric sub-model. solve new model branch-and-cut algorithm exploiting some known valid inequalities for CVRP that can adapted. In a...

Pecin et al. (2016) introduced a “limited memory” technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational polyhedral study that determines the best possible sets of multipliers for cuts with up to 5 rows. Experiments with CVRP instances show that the...

Ising machines can find optimum or quasi-optimum solutions of combinatorial optimization problems efficiently and effectively. It is known that, when a good initial solution given to an machine, we finally obtain closer the optimal solution. However, several cannot directly accept due its computational nature. In this paper, propose method give quasiinitial into that them. The proposed gives po...

In this paper, a deterministic heuristic method is developed for obtaining an initial solution to extremely large-scale capacitated vehicle routing problem (CVRP) having thousands of customers. The has three main objectives. First, it should be able withstand the computational and memory problems normally associated with CVRP. Secondly, outputs reasonably accurate have minimum number vehicles. ...

Capacitated Vehicle Routing Problem (CVRP) is among transportation problems that are of the foremost concerns in logistics. Ensuring an effective product distribution over a large distribution network while reducing the required costs represents the scope of the present work. A synergic and interactive environment of parallel meta-heuristics is developed using a generalized island model to deal...

Monodentate phosphoramidite ligands have been developed based on enantiopure 6,6'-dimethylbiphenols with axial chirality. These chiral ligands are easy to prepare and flexible for modifications. The fine-tuning capability of these ligands plays a significant role in achieving high enantioselectivity in the asymmetric hydroformylation of allyl cyanide and the conjugate addition of diethylzinc to...