Composite Heuristics for a Class of Vehicle Routing Problems 1

Samhälle & debatt

Composite Heuristics for a Class of Vehicle Routing Problems

Dr K Ganesh • T T Narendran

Pocket

1419:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

220 sidor
2012

Vehicle Routing Problem (VRP) is an area which has been widely dealt with for the last four decades. Methodologies have been developed for many variants of the VRP. This work considers concurrent and sequential delivery and pick-up in VRPs, encountered in practice but rarely considered in theory. In addition, constraints on maximum route length and on time-windows have also been considered. Mathematical models incorporating such features have been developed. While the NP-hardness of these problems mandates the use of meta-heuristics, recognition of inherent characteristics of the problem led to the development of construction heuristics based on cluster analysis to obtain good feeder solutions that speed up the intensive search at the end. Genetic Algorithms (GA), an enhanced version of Simulated Annealing (ESA) and a hybrid of the two are the meta-heuristics proposed for optimization. The heuristics performed exceedingly well in the evaluations, recording better or equally good results in comparison to the existing methodologies.

Författare: Dr K Ganesh, T T Narendran
Format: Pocket/Paperback
ISBN: 9783847348788
Språk: Engelska
Antal sidor: 220
Utgivningsdatum: 2012-02-01
Förlag: LAP Lambert Academic Publishing