Algorithms And Procedures Of Determining The Optimal Route In The Graph

Sokas, Algirdas

doi:10.3846/transbaltica2013.045

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typically, the single-source shortest-path problem was discovered by Dijkstra (1959), while the all-pair shortestpath algorithm is due to Floyd (1962), who obtained the result based on a theorem by Warshall (1962) [11]. When searching a shortest path, especially in graph with sparse nodes, Dijkstra is a most classical and mature algorithm [12].…”

Section: B Path Finding Technologiesmentioning

confidence: 98%

An environment friendly method to generate dynamic transportation routing in a distributed context

Archimède

Memon

2015

2015 International Conference on Industrial Engineering and Systems Management (IESM)

View full text Add to dashboard Cite

Due to the globalization, today's manufacturing industry has to mobilize as many as resources in order to satisfy needs of every customer. At the same time, the production resources are more often geographically distributed. In this context, the necessary shifting of intermediate products as well as the final delivery requires transportation among different manufacturing sites, warehouses, consumers, etc. As the business of enterprises grows, transportation demands also grow with that, resulting problems of increasing transportation cost, environmental pollution and coordination between production and transportation operations. In order to address these problems, a possible solution is to better define the routing for transportation requests. This paper proposes an environment friendly method based on a reduced weighted graph with transportation resources competencies to generate dynamic routing between pickup and delivery locations according to shortest distance and time in order to facilitate consolidation and consequently cost and pollution reduction

show abstract

Section: B Path Finding Technologiesmentioning

confidence: 98%

An environment friendly method to generate dynamic transportation routing in a distributed context

Archimède

Memon

2015

2015 International Conference on Industrial Engineering and Systems Management (IESM)

View full text Add to dashboard Cite

show abstract

“…A classic data model for transportation problem is the directed graph, or directed net, which is constructed by combining the arcs, where each arc represent the non-stop travel trajectory of a transport resource. In order to find the route, typically, the single-source shortest-path problem was discovered by Dijkstra (1959), while the all-pair shortest-path algorithm is due to Floyd (1962), who obtained the result based on a theorem by Warshall (1962) (Sokas, A. (2011)).…”

Section: Path Select Algorithmsmentioning

confidence: 99%

Route Finding for Facilitating Transportation Planning to Maintain Smooth Product Flow in Supply Chain

Memon

Shaikh

Taj

et al. 2017

IBTJBS

View full text Add to dashboard Cite

Purpose- To gain more profit and market share, manufacturers wish to mobilize as many resources as they can to satisfy every manufacturing order. As manufacturing is nowadays distributed to several sites, where each site manufactures the intermediate product to assemble the final product. Methodology- Producers, therefore require to transport these products between these sites as well as distribute the final products to faraway customers. Therefore, production and transportation planning need to be coordinated. Manufacturing requires the planning of unmovable resources (machines) with fixed sequences of production routing steps, however transportation requires the planning of moveable resources (Vehicles). Findings- Each transport request is different from another with different origin and destination. Hence, it is needed to find the routing (route from origin to destination) of each transport request dynamically. Practical Implications- This paper is dedicated to present a route finding tool called Path Finder in order to provide the shortest route by distance or time or both for transportation planning.

show abstract

Algorithms And Procedures Of Determining The Optimal Route In The Graph

Cited by 2 publications

References 13 publications

An environment friendly method to generate dynamic transportation routing in a distributed context

An environment friendly method to generate dynamic transportation routing in a distributed context

Route Finding for Facilitating Transportation Planning to Maintain Smooth Product Flow in Supply Chain

Contact Info

Product

Resources

About