Vehicle routing problems methods and applications pdf

9.84  ·  7,961 ratings  ·  123 reviews
vehicle routing problems methods and applications pdf

Vehicle routing : problems, methods, and applications in SearchWorks catalog

This paper presents a solution methodology to tackle a new realistic vehicle routing problem that incorporates heterogeneous fleet, multiple commodities and multiple vehicle compartments. The objective is to find minimum cost routes for a fleet of heterogeneous vehicles without violating capacity, loading and time window constraints. The solution methodology hybridizes in a reactive fashion systematic diversification mechanisms of Greedy Randomized Adaptive Search Procedures with Variable Neighborhood Search for intensification local search. Computational results reported justify the applicability of the methodology. Unable to display preview.
File Name: vehicle routing problems methods and applications
Size: 42677 Kb
Published 11.01.2019

Solving Vehicle Routing Problems Using Excel

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered.

Please choose whether or not you want other users to be able to see on your profile that this library is a favorite of yours. Finding libraries that hold this item You may have already requested this item. Please select Ok if you would like to proceed with this request anyway. WorldCat is the world's largest library catalog, helping you find library materials online. Don't have an account? Your Web browser is not enabled for JavaScript.

Vehicle routing problems, among the most studied in combinatorial optimization, arise in many practical contexts freight distribution and collection, transportation, garbage collection, newspaper delivery, etc. Operations researchers have made significant developments in the algorithms for their solution, and Vehicle Routing: Problems, Methods, and Applications, Second Edition reflects these advances. The text of the new edition is either completely new or significantly revised and.
computer networks a systems approach 2nd edition pdf

Find a copy online

To browse Academia. Skip to main content., Skip to search Skip to main content.




  1. Connor H. says:

    Journal on Vehicle Routing Algorithms.

  2. Ann D. says:

    A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem | SpringerLink

Leave a Reply

Your email address will not be published. Required fields are marked *