Описание: This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.
The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.
Автор: S. P. Anbuudayasankar; K. Ganesh; Sanjay Mohapatra Название: Models for Practical Routing Problems in Logistics ISBN: 3319355279 ISBN-13(EAN): 9783319355276 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book deals with complex variants of Travelling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) within the manufacturing and service industries.
Автор: S. P. Anbuudayasankar; K. Ganesh; Sanjay Mohapatra Название: Models for Practical Routing Problems in Logistics ISBN: 3319050346 ISBN-13(EAN): 9783319050348 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book deals with complex variants of Travelling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) within the manufacturing and service industries.
Автор: Francisco Baptista Pereira; Jorge Tavares Название: Bio-inspired Algorithms for the Vehicle Routing Problem ISBN: 3642098878 ISBN-13(EAN): 9783642098871 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. This book presents a collection of state-of-the-art contributions describing recent developments concerning the application of bio-inspired algorithms to the VRP.
Автор: Francesco Ferrucci Название: Pro-active Dynamic Vehicle Routing ISBN: 3642436900 ISBN-13(EAN): 9783642436901 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Stochastic knowledge is generated from past request information by a new forecasting approach and is used in the pro-active approach to guide vehicles to request-likely areas before real requests arrive there.
Автор: Bruce L. Golden; S. Raghavan; Edward A. Wasil Название: The Vehicle Routing Problem: Latest Advances and New Challenges ISBN: 1441946039 ISBN-13(EAN): 9781441946034 Издательство: Springer Рейтинг: Цена: 26552.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In a unified and carefully developed presentation, this book systematically examines recent developments in VRP. Reflecting the most recent scholarship, this book is written by one of the top research scholars in Vehicle Routing and is one of the most important books in VRP to be published in recent times.
Автор: Moshe Dror Название: Arc Routing ISBN: 1461370264 ISBN-13(EAN): 9781461370260 Издательство: Springer Рейтинг: Цена: 62888.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Arc Routing: Theory, Solutions and Applications is about arc traversal and the wide variety of arc routing problems, which has had its foundations in the modern graph theory work of Leonhard Euler.
Автор: Alexander J. Zaslavski Название: Algorithms for Solving Common Fixed Point Problems ISBN: 3030084558 ISBN-13(EAN): 9783030084554 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Поставка под заказ.
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space.
Автор: Ulmer Marlin Wolf Название: Approximate Dynamic Programming for Dynamic Vehicle Routing ISBN: 3319856812 ISBN-13(EAN): 9783319856810 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs).
Автор: Marlin Wolf Ulmer Название: Approximate Dynamic Programming for Dynamic Vehicle Routing ISBN: 3319555103 ISBN-13(EAN): 9783319555102 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs).
Автор: Srihari Nelakuditi; Zhi-Li Zhang Название: Localized Quality of Service Routing for the Internet ISBN: 1461350492 ISBN-13(EAN): 9781461350491 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The exponential growth of Internet brings to focus the need to control such large scale networks so that they appear as coherent, almost intelligent, organ- isms. The routing protocols deployed such as OSPF use the shortest path only routing paradigm, where routing is optimized for a single metric such as hop count or administrative weight.
Автор: Alexander J. Zaslavski Название: Algorithms for solving common fixed point problems / ISBN: 3319774360 ISBN-13(EAN): 9783319774367 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Поставка под заказ.
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space. A variety of algorithms are considered in this book for solving both types of problems, the study of which has fueled a rapidly growing area of research. This monograph is timely and highlights the numerous applications to engineering, computed tomography, and radiation therapy planning. Totaling eight chapters, this book begins with an introduction to foundational material and moves on to examine iterative methods in metric spaces. The dynamic string-averaging methods for common fixed point problems in normed space are analyzed in Chapter 3. Dynamic string methods, for common fixed point problems in a metric space are introduced and discussed in Chapter 4. Chapter 5 is devoted to the convergence of an abstract version of the algorithm which has been called component-averaged row projections (CARP). Chapter 6 studies a proximal algorithm for finding a common zero of a family of maximal monotone operators. Chapter 7 extends the results of Chapter 6 for a dynamic string-averaging version of the proximal algorithm. In Chapters 8 subgradient projections algorithms for convex feasibility problems are examined for infinite dimensional Hilbert spaces.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
