Solving biobjective network flow problem associated with minimum cost-time loading
We apply a primal-dual simplex algorithm for solving the biobjective min imum cost-time network flow problem such that the total shipping cost and the total shipping fixed time are considered as the first and second objective functions, respectively. To convert the proposed model into a single-objec...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ferdowsi University of Mashhad
2020-09-01
|
| Series: | Iranian Journal of Numerical Analysis and Optimization |
| Subjects: | |
| Online Access: | https://ijnao.um.ac.ir/article_25356_83be479ab5da83b86e0e5ad2676a3cab.pdf |