Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems

DOI10.1002/NAV.3800230402zbMath0372.90118OpenAlexW1989840685MaRDI QIDQ4149254

No author found.

Publication date: 1976

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800230402

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (20)

Constructing the set of efficient objective values in linear multiple objective transportation problems ⋮ A study of the bottleneck single source transportation problem ⋮ The multiple bottleneck transportation problem ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ On the bottleneck linear programming problem ⋮ Network reoptimization procedures for multiobjective network problems ⋮ Efficiency and time-cost-tradeoffs in transportation problems ⋮ Linear lexicographic optimization ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ An augmenting path method for solving linear bottleneck assignment problems ⋮ An augmenting path method for solving linear bottleneck transportation problems ⋮ Outer Branching: How to Optimize under Partial Orders? ⋮ Unnamed Item ⋮ An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method ⋮ On trade-off solution pairs in a special type of transportation problem ⋮ Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem ⋮ Unnamed Item ⋮ Total shipping cost/completion-date trade-off in transportation problem with additional restriction

Cites Work

• Alternate Formulations for Static Multi-Attribute Assignment Models
• Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
• Time‐minimizing transportation problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems