Goods Transportation Problem Solving via Routing Algorithm

02/13/2021
by   Mikhail Shchukin, et al.
0

This paper outlines the ideas behind developing a graph-based heuristic-driven routing algorithm designed for a particular instance of a goods transportation problem with a single good type. The proposed algorithm solves the optimization problem of satisfying the demand of goods on a given undirected transportation graph with minimizing the estimated cost for each traversed segment of the delivery path. The operation of the routing algorithm is discussed and overall evaluation of the proposed problem solving technique is given.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

An iterative school decomposition algorithm for solving the multi-school bus routing and scheduling problem

Servicing the school transportation demand safely with a minimum number ...
research
06/02/2021

Automating Speedrun Routing: Overview and Vision

Speedrunning in general means to play a video game fast, i.e. using all ...
research
11/07/2020

Open Area Path Finding to Improve Wheelchair Navigation

Navigation is one of the most widely used applications of the Location B...
research
01/05/2020

An adaptive data-driven approach to solve real-world vehicle routing problems in logistics

Transportation occupies one-third of the amount in the logistics costs, ...
research
08/10/2020

A Two-Stage Metaheuristic Algorithm for the Dynamic Vehicle Routing Problem in Industry 4.0 approach

Industry 4.0 is a concept that assists companies in developing a modern ...
research
09/12/2023

On Solving Fixed Charge Transportation Problems Having Interval Valued Parameters

In this article, we propose a new method for solving the interval fixed ...
research
11/11/2017

Depth First Always On Routing Trace Algorithm

In this paper, we discussed current limitation in the electronic-design-...

Please sign up or login with your details

Forgot password? Click here to reset