Increasing complexity in municipal solid waste streams worldwide is pressing Solid Waste Management Systems (SWMS), which need solutions to manage the properly. collection and transport first task, traditionally carried out by countries/municipalities responsible for management. In this approach, drivers are decision-making regarding routes, leading inefficient resource expenses. sense, strateg...

This abstract describes a branch, cut, and price (BCP) algorithm for the solution of a class of network design problems with routing and packing constraints that can all be seen as special cases of a general model we will call the Capacitated Node Routing Problem (CNRP). We present several alternative integer programming formulation of the CNRP that can be shown to generalize a number of other ...

The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows. The work is motivated by the question, if and how the problem structure influences the effectiveness of different configurations of the genetic algorithm. Computational results...

In today’s world, logistics problems are crucial for the supply chain management. The vehicle routing one of most studied combinatorial optimization in literature. real life applications, all parameters problem may not be known. this paper, we considered capacitated with stochastic demands. Uniform and normal distributions were analyzed on customer demands to observe nature problem. These metho...

This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports about genetic algorithms, evolution strategies and particle swarm optimization, when applied to the classical capacitated vehicle routing problem and many of its variants. The performance of evolutionary algorithms is also compared with the best alternative problem-solvin...

The most studied combinatorial optimization problem in transport and logistics is the vehicle routing problem (VRP). The goal of the vehicle routing problem is to nd a set of routes for a eet of vehicles which optimises the objective function (e.g. total distance, routing costs). Every demand needs to be ful lled and vehicle capacities need to be respected. Many solution methods exist for the '...

Vehicle Routing Problem with Time windows (VRPTW) is an example of scheduling in constrained environment. It is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. So far different analytic and heuristic approaches have been tried to solve such problems. In this...

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

This paper focuses on the capacitated vehicle routing problem (CVRP), which is a challenging optimization faced by logistics companies. The objective of CVRP to determine optimal fleet vehicles deliver goods set customers, subject various constraints such as capacity and distance. can lead significant cost savings for companies, why it has received lot attention from researchers practitioners. ...