Improving techniques for transportation problems
From MaRDI portal
This paper deals with new modifications of an algorithm based on triple indexing methods by Jakobsen enhancing its efficiency for long (m\(\leq n)\) transportation problems. The new method consists in reusing a regular loop until it is exhausted, each reuse leading to another improving loop, without updating any of the dual variables. Experimental results exhibit savings of up to 75\% iterations and total time, while storage requirements are the same as in the regular method.
Cites work
Cited in
(14)- Optimal and better transport plans
- Modified Han algorithm for maritime containers transportation problem
- A table-working method for single-loop transportation problems
- scientific article; zbMATH DE number 3858851 (Why is no real title available?)
- scientific article; zbMATH DE number 4199970 (Why is no real title available?)
- scientific article; zbMATH DE number 4029256 (Why is no real title available?)
- scientific article; zbMATH DE number 4085413 (Why is no real title available?)
- A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
- scientific article; zbMATH DE number 4127002 (Why is no real title available?)
- scientific article; zbMATH DE number 605179 (Why is no real title available?)
- scientific article; zbMATH DE number 1179852 (Why is no real title available?)
- Multiloop transportation simplex algorithm
- scientific article; zbMATH DE number 7536081 (Why is no real title available?)
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
This page was built for publication: Improving techniques for transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083031)