On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers
In this paper, we are addressing the two-stage transportation problem with fixed charge for opening the distribution centers, which is an extension of the classical transportation problem. The problem models a distribution network in a two-stage supply chain which involves: manufacturers, distributi...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8805057/ |
id |
doaj-d0a8987a78d44a9fbea4a76f1f136b5d |
---|---|
record_format |
Article |
spelling |
doaj-d0a8987a78d44a9fbea4a76f1f136b5d2021-03-30T00:21:11ZengIEEEIEEE Access2169-35362019-01-01711368411369810.1109/ACCESS.2019.29360958805057On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution CentersOvidiu Cosma0Daniela Danciulescu1Petrica C. Pop2https://orcid.org/0000-0002-0626-9284Department of Mathematics and Computer Science, Technical University of Cluj-Napoca, North University Center of Baia Mare, Baia Mare, RomaniaDepartment Computer Science, University of Craiova, Craiova, RomaniaDepartment of Mathematics and Computer Science, Technical University of Cluj-Napoca, North University Center of Baia Mare, Baia Mare, RomaniaIn this paper, we are addressing the two-stage transportation problem with fixed charge for opening the distribution centers, which is an extension of the classical transportation problem. The problem models a distribution network in a two-stage supply chain which involves: manufacturers, distribution centers and customers, and its main characteristic is that a fixed charge for opening the distribution centers is associated, in addition to the variable transportation cost which is proportional to the amount of goods shipped. We describe a novel solution approach for the minimization of total distribution costs: a fast and efficient constructive heuristic algorithm that reduces the solution search space to a subspace with a reasonable size, without losing optimal or sub-optimal solutions by considering a perturbation mechanism that allows us to reconsider discarded feasible solutions that might lead to such solutions. Computational results are reported and discussed for the existing benchmark instances and on a set of instances that contains eight new randomly generated larger instances. The obtained results show that our solution approach is highly competitive as compared to the existing methods from the literature.https://ieeexplore.ieee.org/document/8805057/Transportation system design two-stage fixed-charge transportation problem constructive heuristic algorithms |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ovidiu Cosma Daniela Danciulescu Petrica C. Pop |
spellingShingle |
Ovidiu Cosma Daniela Danciulescu Petrica C. Pop On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers IEEE Access Transportation system design two-stage fixed-charge transportation problem constructive heuristic algorithms |
author_facet |
Ovidiu Cosma Daniela Danciulescu Petrica C. Pop |
author_sort |
Ovidiu Cosma |
title |
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers |
title_short |
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers |
title_full |
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers |
title_fullStr |
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers |
title_full_unstemmed |
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers |
title_sort |
on the two-stage transportation problem with fixed charge for opening the distribution centers |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
In this paper, we are addressing the two-stage transportation problem with fixed charge for opening the distribution centers, which is an extension of the classical transportation problem. The problem models a distribution network in a two-stage supply chain which involves: manufacturers, distribution centers and customers, and its main characteristic is that a fixed charge for opening the distribution centers is associated, in addition to the variable transportation cost which is proportional to the amount of goods shipped. We describe a novel solution approach for the minimization of total distribution costs: a fast and efficient constructive heuristic algorithm that reduces the solution search space to a subspace with a reasonable size, without losing optimal or sub-optimal solutions by considering a perturbation mechanism that allows us to reconsider discarded feasible solutions that might lead to such solutions. Computational results are reported and discussed for the existing benchmark instances and on a set of instances that contains eight new randomly generated larger instances. The obtained results show that our solution approach is highly competitive as compared to the existing methods from the literature. |
topic |
Transportation system design two-stage fixed-charge transportation problem constructive heuristic algorithms |
url |
https://ieeexplore.ieee.org/document/8805057/ |
work_keys_str_mv |
AT ovidiucosma onthetwostagetransportationproblemwithfixedchargeforopeningthedistributioncenters AT danieladanciulescu onthetwostagetransportationproblemwithfixedchargeforopeningthedistributioncenters AT petricacpop onthetwostagetransportationproblemwithfixedchargeforopeningthedistributioncenters |
_version_ |
1724188486155632640 |