Fast heuristic algorithms to solve a single-stage fixed-charge transportation problem

DOI10.1504/IJOR.2009.026936MaRDI QIDQ1031071zbMATH OpenOpenAlexFDO

Authors K. Antony Arokia Durai Raj, Chandrasekharan Rajendran

Publication date 28 October 2009

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijor.2009.026936

zbMATH Keywords

benchmarkingfixed costs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• Heuristic algorithms for the fixed-charge transportation problem
• A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems
• A simple algorithm for the source-induced fixed-charge transportation problem
• A heuristic algorithm for the fixed charge problem
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics

Cited in

(13)

• Solving the facility location and fixed charge solid transportation problem
• COLE: a new heuristic approach for fixed charge problem computational results
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A new algorithm for optimal solution of fixed charge transportation problem
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
• Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
• A simple algorithm for the source-induced fixed-charge transportation problem
• Heuristic algorithms for the fixed-charge transportation problem
• A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems
• Maximum difference extreme difference method for finding the initial basic feasible solution of transportation problems
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
• Solving fixed charge transportation problem with truck load constraint using metaheuristics

This page was built for publication: Fast heuristic algorithms to solve a single-stage fixed-charge transportation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031071)