Pardalos / Oliveira | Handbook of Artificial Intelligence and Data Sciences for Routing Problems | Buch | 978-3-031-78261-9 | sack.de

Buch, Englisch, 257 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 586 g

Reihe: Springer Optimization and Its Applications

Pardalos / Oliveira

Handbook of Artificial Intelligence and Data Sciences for Routing Problems


Erscheinungsjahr 2025
ISBN: 978-3-031-78261-9
Verlag: Springer Nature Switzerland

Buch, Englisch, 257 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 586 g

Reihe: Springer Optimization and Its Applications

ISBN: 978-3-031-78261-9
Verlag: Springer Nature Switzerland


This handbook delves into the rapidly evolving field of artificial intelligence and optimization, focusing on the intersection of machine learning, combinatorial optimization, and real-world applications in transportation and network design.

Covering an array of topics from classical optimization problems such as the Traveling Salesman Problem and the Knapsack Problem, to modern techniques including advanced heuristic methods, Generative Adversarial Networks, and Variational Autoencoders, this book provides a roadmap for solving complex problems. The included case studies showcase practical implementations of algorithms in predicting route sequences, traffic management, and eco-friendly transportation.

This comprehensive guide is essential for researchers, practitioners, and students interested in AI and optimization. Whether you are a researcher seeking standard approaches or a professional looking for practical solutions to industry challenges, this book offers valuable insights into modern AI algorithms.

Pardalos / Oliveira Handbook of Artificial Intelligence and Data Sciences for Routing Problems jetzt bestellen!

Zielgruppe


Graduate

Weitere Infos & Material


Chapter 1. Route Sequence Prediction through Inverse Reinforcement Learning and Bayesian Optimization.- Chapter 2. A Comparative Evaluation of Monolithic and Microservices Architectures for Load Profiling Services in Smart Grids.- Chapter 3. Heuristics for the problem of consolidating orders into vehicle shipments with compatible categories and freight based on the direct distances to the farthest customers.- Chapter 4. Mathematical Models and Algorithms for Large-Scale Transportation Problems.- Chapter 5. Optimization Methods for Multicast Routing Problems.- Chapter 6. An Introduction to AI and Routing Problems in Mobile Telephony.- Chapter 7. AI Techniques for Combinatorial Optimization.- Chapter 8. Telecommunication Networks and Frequency Assignment Problems.- Chapter 9. The Metaheuristic Strategy for AI Search and Optimization.- Chapter 10. GRASP for Assignment Problem in Telecomunications.- Chapter 11. Waste Collection: Sectoring, Routing and Scheduling for Challenging Services.


Dr. Carlos Oliveira is a researcher and consultant in the area of combinatorial optimization and data science. He holds a PhD in Operations Research from University of Florida. Dr. Oliveira has more than 15 years of experience in academia as well as in companies such as Bloomberg, Amazon, and AT&T, where he developed optimization and scientific applications. He is the author of 4 books in combinatorial optimization and financial programming.

Miltiades P. Pardalos holds a BS in Industrial Engineering and is a Phd candidate at Texas A&M. His research is in the area of optimization and applications. He has previous experience working for Amazon.com.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.