EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3010. Two-stage Time Minimizing Bulk Transportation Problem

Invited abstract in session WD-26: Combinatorial optimization issues in transportation (Contributed), stream Combinatorial Optimization.

Wednesday, 14:30-16:00
Room: 012 (building: 208)

Authors (first author is the speaker)

1. Prabhjot Kaur
Department of Applied Sciences, University Institute of Engineering and Technology, Chandigarh.
2. Meenakshi Mittal
Mathematics , LRDAVcollege

Abstract

This paper discusses a two-stage bulk transportation problem and develops a polynomial bound iterative algorithm to
find its optimal solution. In this problem, the set of destinations is divided
into two disjoint sets consisting of ‘primary’ and ‘secondary’ destinations,
respectively. Due to limited availability of vehicles, the company prefers
to transport the goods to the primary destinations first (in Stage-I) and
once the demand of the primary destinations is met, the secondary destinations are catered later (in Stage-II) from the left-over availability at
various sources. Like a standard bulk transportation problem, the demand
of a destination must be fulfilled by one source only, however, one source
can cater more than one destinations. The transportation time corresponding to each source-destination link is considered to be known. The
objective of the problem is to find such a transportation schedule that
provides the minimum sum of transportation times of both the stages.
The proposed algorithm, at each iteration, solves a related cost minimizing transportation problem and one of its restricted variants, using a
branch and bound technique and converges systematically, to the optimal
objective value of the problem. The efficiency of the proposed algorithm
is validated through various numerical illustrations. Further, the performance of the algorithm, in terms of CPU time, for various randomly
generated instances, is also provided.

Keywords

Status: accepted

Back to the list of papers