Vehicle routing problems, among the most studied in combinatorial optimization, arise in many practical contexts (freight distribution and collection, transportation, refuse collection, and so on). Researchers have made significant recent progress in the development of solution algorithms, which are explored in this book. The text of this new edition is either completely new or significantly revised and provides extensive state-of-the-art coverage of vehicle routing; it emphasizes methodologies for specific classes of vehicle routing problems and contains a complete overview of current solutions to combinatorial optimization problems. It also includes several chapters on important and emerging applications, such as disaster relief and green vehicle routing. This book is intended for both researchers and graduate students in operations research and applied mathematics. Practitioners will find this book particularly useful. Readers need only basic knowledge of the main solution methods for combinatorial optimization problems.
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.