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 |
| Summary: | 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-objective parametric one, the weighted sum scalarization technique is commonly used. This problem is a mixed-integer programming, which the decision variables are directly dependent together. Generally, the previous works have consid ered the linear biobjective problem with the traditional network flow con straints, while in this paper, corresponding to each flow variable, a binary variable is defined. These zero-one variables are utilized to describe a fixed shipping time for positive flows. The proposed method is successful in finding all supported efficient solutions of a real numerical example. |
|---|---|
| ISSN: | 2423-6977 2423-6969 |