Metraipolis › archive › dc_150d8bc18b91
Bi-objective Two Phase Transportation Problem — arXiv:2609.03671
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03671
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:26:48.221Z
- SHA-256 of the archived text
596dfd5b8eaeaa026f26a8c5b28342b2da846d0a127418ba37b6c1ed8143c988- Stable URL of this page
https://metraipolis.com/documento/dc_150d8bc18b91
How to cite
Bi-objective Two Phase Transportation Problem — arXiv:2609.03671 — arXiv (en), https://arxiv.org/abs/2609.03671 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_150d8bc18b91 (Metraipolis archive dc_150d8bc18b91, sha256 596dfd5b8eaeaa026f26a8c5b28342b2da846d0a127418ba37b6c1ed8143c988)
BibTeX
@misc{dc150d8bc18b91,
title = {Bi-objective Two Phase Transportation Problem — arXiv:2609.03671},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03671},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_150d8bc18b91; sha256 596dfd5b8eaeaa026f26a8c5b28342b2da846d0a127418ba37b6c1ed8143c988},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03671. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper discusses a bi-objective two-phase transportation problem (BTPTP) in which transportation takes place in two phases. The whole set of source-destination links is partitioned into two disjoint sets namely, Phase-I and Phase-II. The transportation among the source-destination links of Phase-II set is done only after the transportation among the source-destination links of Phase-I set is complete. The transportation among the source-destination links in each phase is done in parallel. The problem discussed in this paper concentrates on minimizing two objectives viz., sum of transportation times and sum of transportation costs of both the phases, simultaneously. Due to conflicting nature of the objectives, a polynomial time iterative algorithm named as BTPTP-Algorithm is developed that finds all of its non-dominated solutions. At each iteration, the BTPTP-Algorithm solves some specific restricted cost minimizing transportation problems and finds corresponding optimal feasible solutions. The restrictions imposed on the source-destination links of Phase-I and Phase-II sets, in each of these problems, depend upon their corresponding Phase-I and Phase-II transportation times obtained at the previous step. The algorithm is developed in such a way that it expels all the dominated solutions and records all the non-dominated solutions of the problem, systematically. A proof of the BTPTP-Algorithm's capability of recording all the non-dominated points is provided. Further, a numerical illustration is given in support of the theory and computational behavior of the BTPTP-Algorithm for various BTPTP instances of different sizes, is provided in terms of CPU time. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.03671 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T02:07:43.340Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).