Log In
Or create an account ->
Imperial Library
Home
About
News
Upload
Forum
Help
Login/SignUp
Index
Title
Copyright
Notations and Abbreviations
Introduction
1 General Presentation of Vehicle Routing Problems
1.1. Logistics management and combinatorial optimization
1.2. Vehicle routing problems
1.3. Conclusion
2 Simple Heuristics and Local Search Procedures
2.1. Simple heuristics
2.2. Local search
2.3. Conclusion
3 Metaheuristics Generating a Sequence of Solutions
3.1. Simulated annealing (SA)
3.2. Greedy randomized adaptive search procedure: GRASP
3.3. Tabu search
3.4. Variable neighborhood search
3.5. Iterated local search
3.6. Guided local search
3.7. Large neighborhood search
3.8. Transitional forms
3.9. Selected examples
3.10. Conclusion
4 Metaheuristics Based on a Set of Solutions
4.1. Genetic algorithm and its variants
4.2. Scatter search
4.3. Path relinking
4.4. Ant colony optimization
4.5. Particle swarm optimization
4.6. Other approaches and their use in vehicle routing problems
4.7. Selected examples
4.8. Conclusion
5 Metaheuristics Hybridizing Various Components
5.1. Hybridizing metaheuristics
5.2. Matheuristics
5.3. Conclusion
Conclusion
Bibliography
Index
End User License Agreement
← Prev
Back
Next →
← Prev
Back
Next →