10 - Routing problem

Abstract

Intermodal transportation is made up of optimal transportation routes and modes between the origins and destinations of cargo using one or multiple transportation modes. Even if it is not an optimal distance and time, optimal transportation is planned for a timely and safe ride by minimizing costs or distances according to the given environment and conditions. The quality and reliability of this plan are determined by considering the accumulation of accurate data, the setting of scientific, practical transportation routes, and the variables of decision makers. The datasets are equipped with spatial information and are efficiently used through the geographic information system (GIS) and optimization applications. At this time, the stored roads, waterways, and rail networks must be well connected between nodes and links, and the properties required for decision-making must be stored with integrity. If roads, railroads, and waterways are well connected, each network should reflect the connection, considering the actual operation with transshipment bases and other logistics facilities. Based on this, it is possible to develop algorithms such as shortest path algorithms, maximal flow problems, and vehicle routing problems to generate timely and appropriate information during the actual operation. In this chapter, we will briefly review data generation and generally well-known network models.