Distribution of goods is of importance in logistics and supply chain management. The target of a distribution network is to specify the beneficial way for delivering goods and commodities from supply to demand points. In distribution domain, this activity can usually be viewed as a capacitated vehicle routing problem (CVRP). As the CVRP solutions remain computationally intractable, we develop i...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.

The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP. We investigate three classes of valid inequalities for the CVRP, multistars, pathbin inequalities and hypotours and give computational results we obtained with a Branch and Cut...

Electric vehicle routing problems can be particularly complex when recharging must performed mid-route. In some applications such as the e-commerce parcel delivery truck routing, however, mid-route may not necessary because of constraints on capacities and maximum allowed time for delivery. this study, we develop a mixed-integer optimization model that exactly solves time-constrained capacitate...