Solving Transport Problems


Book Description

Solving Transport Problems establishes fundamental points and good practice in resolving matters regarding green transportation. This is to prompt further research in conveyance issues by providing readers with new knowledge and grounds for integrated models and solution methods. Focusing on green transportation, this book covers various sub-topics and thus consists of diverse content. Traditionally, academia and transport practitioners have mainly concentrated on efficient fleet management to achieve economic benefits and better-quality service. More recently, due to growing public environmental concerns and the industry understanding of the issue, the academic community has started to address environmental issues. The studies of green transportation compiled in this book have identified certain areas of interest, such as references, viewpoints, algorithms and ideas. Solving Transport Problems is for researchers, environmental decision-makers and other concerned parties, to start discussion on developing optimized technology and alternative fuel-based integrated models for environmentally cleaner transport systems.




Data-Driven Solutions to Transportation Problems


Book Description

Data-Driven Solutions to Transportation Problems explores the fundamental principle of analyzing different types of transportation-related data using methodologies such as the data fusion model, the big data mining approach, computer vision-enabled traffic sensing data analysis, and machine learning. The book examines the state-of-the-art in data-enabled methodologies, technologies and applications in transportation. Readers will learn how to solve problems relating to energy efficiency under connected vehicle environments, urban travel behavior, trajectory data-based travel pattern identification, public transportation analysis, traffic signal control efficiency, optimizing traffic networks network, and much more. Synthesizes the newest developments in data-driven transportation science Includes case studies and examples in each chapter that illustrate the application of methodologies and technologies employed Useful for both theoretical and technically-oriented researchers




Quantitative Techniques


Book Description

Quantitative Techniques: Theory and Problems adopts a fresh and novel approach to the study of quantitative techniques, and provides a comprehensive coverage of the subject. Essentially designed for extensive practice and self-study, this book will serve as a tutor at home. Chapters contain theory in brief, numerous solved examples and exercises with exhibits and tables.







More-for-Less Solutions in Fuzzy Transportation Problems


Book Description

This book describes a set of methods for finding more-for-less solutions of various kind of fuzzy transportation problems. Inspired by more-for-less approaches to the basic transportation problem initiated by Abraham Charnes and his collaborators during 1960s and 1970s, this book describes new methods developed by the authors to solve different types of problems, including symmetric balanced fuzzy transportation problems, symmetric intuitionistic fuzzy transportation problems with mixed constraints, and symmetric intuitionistic fuzzy linear fractional transportation problems with mixed constraints. It offers extensive details on their applications to some representative problems, and discusses some future research directions







Integrating Routing Decisions in Public Transportation Problems


Book Description

This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful finding regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems. The book models line planning, timetabling and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing step is proposed to solve the problems.







New Splitting Iterative Methods for Solving Multidimensional Neutron Transport Equations


Book Description

This thesis focuses on iterative methods for the treatment of the steady state neutron transport equation in slab geometry, bounded convex domain of Rn (n = 2,3) and in 1-D spherical geometry. We introduce a generic Alternate Direction Implicit (ADI)-like iterative method based on positive definite and m-accretive splitting (PAS) for linear operator equations with operators admitting such splitting. This method converges unconditionally and its SOR acceleration yields convergence results similar to those obtained in presence of finite dimensional systems with matrices possessing the Young property A. The proposed methods are illustrated by a numerical example in which an integro-differential problem of transport theory is considered. In the particular case where the positive definite part of the linear equation operator is self-adjoint, an upper bound for the contraction factor of the iterative method, which depends solely on the spectrum of the self-adjoint part is derived. As such, this method has been successfully applied to the neutron transport equation in slab and 2-D cartesian geometry and in 1-D spherical geometry. The self-adjoint and m-accretive splitting leads to a fixed point problem where the operator is a 2 by 2 matrix of operators. An infinite dimensional adaptation of minimal residual and preconditioned minimal residual algorithms using Gauss-Seidel, symmetric Gauss-Seidel and polynomial preconditioning are then applied to solve the matrix operator equation. Theoretical analysis shows that the methods converge unconditionally and upper bounds of the rate of residual decreasing which depend solely on the spectrum of the self-adjoint part of the operator are derived. The convergence of theses solvers is illustrated numerically on a sample neutron transport problem in 2-D geometry. Various test cases, including pure scattering and optically thick domains are considered.