Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem

DOI10.1080/02331934.2014.898148zbMath1301.65046OpenAlexW2150368518MaRDI QIDQ2926472

Devika Kannan, Kannan Govindan, Hamed Soleimani

Publication date: 24 October 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.898148

zbMATH Keywords

numerical examplegenetic algorithmmixed integer linear programmingartificial immune systemNP-hard problemfixed-charge transportation problemant colony optimization methodsdistribution planning problemsheep flock algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ The multi-objective multi-item just-in-time transportation problem

Cites Work

• Unnamed Item
• Designing a distribution network in a supply chain system: formulation and efficient solution procedure
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A genetic algorithm approach for solving a closed loop supply chain model: a case of battery recycling
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• A tabu search heuristic procedure for the fixed charge transportation problem
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem

This page was built for publication: Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem