Deterministic optimizational problems of transportation logistics

Authors:
E. M. Bronshtein;T. A. Zaiko
Affiliations:
Ufa State Aviation Technical University, Ufa, Russia;Ufa State Aviation Technical University, Ufa, Russia
Venue:
Automation and Remote Control
Year:
2010

Citing 3
Cited 0

Branch-and-bound algorithms for the capacitated VRP

The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We give a survey of a wide class of transportation logistics problems, in which we consider, from a unified standpoint, both discrete (e.g., routing) and continuous (e.g., classical transport) problems. We single out a collection of elementary premises that underlie such problems, give corresponding mathematical models and approaches to the solution. We also consider a new multinomenclature transportation logistics problem.