Modeling and solving a three-stage fixed charge transportation problem considering stochastic demand and price

Authors

  • H. Soleimani Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University (IAU), Qazvin, Iran
  • M. Seyyed Esfahani Amirkabir University, Tehran, Iran
  • N. Shirazi Caspian University, Qazvin, Iran
Abstract:

This paper considers a three-stage fixed charge transportation problem regarding stochastic demand and price. The objective of the problem is to maximize the profit for supplying demands. Three kinds of costs are presented here: variable costs that are related to amount of transportation cost between a source and a destination. Fixed charge exists whenever there is a transfer from a source to a destination, and finally, shortage cost that incurs when the manufacturer does not have enough products for supplying customer’s demand. The model is formulated as a mixed integer programming problem and is solved using a multicriteria scenario based solution approach to find the optimal solution. Mean, standard deviation, and coefficient of variation are compared as the acceptable criteria to decide about the best solution.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

full text

SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...

full text

Solving the Two-Stage Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm

This article considers the two-stage fixed-charge transportation problem which models an important transportation application in a supply chain, from manufacturers to customers through distribution centers. For solving this optimization problem we describe a hybrid algorithm that combines a steady-state genetic algorithm with a local search procedure. The computational results for an often used...

full text

A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach

We introduce the Stochastic multistage fixed charge transportation problem in which a producer has to ship an uncertain load to a customer within a deadline. At each time period, a fixed transportation price can be paid to buy a transportation capacity. If the transportation capacity is used, the supplier also pays an uncertain unit transportation price. A unit inventory cost is charged for the...

full text

AN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM

Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...

full text

Electromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem

In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 1

pages  27- 40

publication date 2015-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023