number of small and largescale problems in little and large scale are solved and the associated results are reported. The results obtained show that the proposed approach favourably compares with previous algorithms from the literature.
The objective is to the determine when to service each customer, as well as the route to be performed by each truck, in order to minimize
We also propose new heuristic algorithm for the asymmetric capacitated vehicle routing problems with the independent route lengthApplied Mathematics and Computation,Volume 176, Issue 2,15 Pages 445454R. The proposed model is solved by hybrid simulated annealing SA based on the nearest neighborhood. Herer, Roberto LevyAbstractThe Metered Inventory Routing Problem MIRP involves central warehouse, fleet of trucks with finite capacity, and set of customers, for each of whom there is an estimated consumption rate, and known storage capacity.
The problem is solved on rolling horizon basis, taking into consideration holding, transportation, fixed ordering, and stockout costs. In the proposed model, the fleet is mainly heterogeneous. Herer, Roberto LevyAbstractThe Metered Inventory Routing Problem, an integrative heuristic algorithmInternational Journal of Production Economics,Volume 51, Issues 12,15 Pages 6981Yale GholipourAbstractThis paper presents linear integer model of capacitated vehicle routing problems VRP with the independent route length to minimize the heterogeneous fleet and maximize the capacity utilization. In this paper we describe the extension to ACVRP of the two wellknown ClarkeWright and FisherJaikumar heuristic algorithms.
Herer, Roberto LevyAbstractThe Metered Inventory Routing Problem, an integrative heuristic algorithmInternational Journal of Production Economics,Volume 51, Issues 12,15 Pages 6981Yale We also propose new heuristic algorithm for ACVRP that, starting with an initial infeasible solution, determines the final set of vehicle routes through an insertion procedure as well as intearoute and interroute arc exchanges. Purchase PDF 1558 KA hybrid simulated annealing SA based on the nearest neighborhood.
The initial infeasible solution is obtained by using the additive bounding procedures for ACVRP described by Fischetti, Toth and Vigo in In this paper we describe the extension to ACVRP of the two wellknown ClarkeWright and FisherJaikumar heuristic algorithms. The objective is to the determine when to service each customer, as well as the route to be performed by each truck, in order to minimize the total discounted costs. in distribution and scheduling.