An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
From MaRDI portal
Publication:4764857
DOI10.1080/02331939408843970zbMath0818.90042OpenAlexW2020310049MaRDI QIDQ4764857
No author found.
Publication date: 20 April 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939408843970
ideal pointfixed-charge transportation problemfixed-charge bi-criterion transportationoptimum time-cost trade-off pair
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow, Multi-index fixed charge bi-criterion transshipment problem, Inventory and transportation cost minimization in the delivery logistics of swine flu vaccine
Cites Work
- Unnamed Item
- Unnamed Item
- The family constrained network problem
- Interactive solutions for the linear multiobjective transportation problem
- A vertex ranking algorithm for the fixed-charge transportation problem
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems
- An approximative algorithm for the fixed-charges transportation problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Some remarks on the time transportation problem
- An approximate solution method for the fixed charge problem
- An approximative algorithm for the fixed charge problem
- Time‐minimizing transportation problems
- The fixed charge problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- The bottleneck transportation problem
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem