Fixed charge solid transportation problem in uncertain environment and its algorithm

•Three models are proposed for uncertain fixed charge solid transportation problem.•The crisp equivalences of the models are discussed.•An algorithm is designed based on uncertainty theory and tabu search algorithm. In this paper, the fixed charge solid transportation problem under uncertainty is in...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering Vol. 102; pp. 186 - 197
Main Authors: Zhang, Bo, Peng, Jin, Li, Shengguo, Chen, Lin
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2016
Subjects:
Algorithms
Chance-constrained programming
Crisps
Equivalence
Hybrid systems
Mathematical models
Measure-chance programming
Programming
Tabu search algorithm
Transportation problem
Uncertainty
Uncertainty theory
Chance-constrained programming
Transportation problem
Measure-chance programming
Uncertainty theory
Tabu search algorithm
ISSN:0360-8352
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Three models are proposed for uncertain fixed charge solid transportation problem.•The crisp equivalences of the models are discussed.•An algorithm is designed based on uncertainty theory and tabu search algorithm. In this paper, the fixed charge solid transportation problem under uncertainty is investigated. As a result, three mathematical models are constructed for the problem, i.e., expected value model, chance-constrained programming model and measure-chance programming model, where the supplies, demands, conveyance capacities, direct costs and fixed charges are regarded as uncertain variables. After that, the crisp equivalences of the models are discussed. What is more, a hybrid intelligent algorithm is designed based on the uncertainty theory and tabu search algorithm to solve the models. Compared with the existing work, the innovations of the proposed work are briefly illustrated. Finally, some numerical examples are given to show the applications of the models and the algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0360-8352
DOI:10.1016/j.cie.2016.10.030