Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems

DOI10.1007/S10479-008-0483-2MaRDI QIDQ2267294zbMATH OpenOpenAlexFDO

Authors Jesús Sáez-Aguado

Publication date 1 March 2010

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-008-0483-2

zbMATH Keywords

heuristicsinteger programmingtransportation problemfixed costsLagrangean relaxationcore problem

Mathematics Subject Classification ID

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

Recommendations

• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A tabu search heuristic procedure for the fixed charge transportation problem
• A heuristic algorithm for the fixed charge problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1330764 (Why is no real title available?)
• scientific article; zbMATH DE number 1175958 (Why is no real title available?)
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A Heuristic Method for the Set Covering Problem
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• A set covering reformulation of the pure fixed charge transportation problem
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
• 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
• Algorithms for solving the single-sink fixed-charge transportation problem
• An effective heuristic for large-scale capacitated facility location problems
• Analysis of a flow problem with fixed charges
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• COLE: a new heuristic approach for fixed charge problem computational results
• Computational study of large-scale \(p\)-median problems
• Fixed-cost transportation problems
• Integer-programming software systems
• Lagrangean relaxation. (With comments and rejoinder).
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• Solving to optimality the uncapacitated fixed-charge network flow problem
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The fixed charge problem
• The fixed charge problem
• The teacher assignment problem: A special case of the fixed charge transportation problem

Cited in

(17)

• Solving the facility location and fixed charge solid transportation problem
• A set covering reformulation of the pure fixed charge transportation problem
• COLE: a new heuristic approach for fixed charge problem computational results
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
• Consistency cuts for Dantzig-Wolfe reformulations
• Fractional polynomial bounds for the fixed charge problem
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• A tabu search heuristic procedure for the fixed charge transportation problem
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
• On lower bounds for the fixed charge problem
• Some heuristic methods for solving p-median problems with a coverage constraint
• Minimum‐cost flow problems having arc‐activation costs
• A sequential reduction algorithm for the large-scale fixed-charge network flow problems
• Solving fixed charge transportation problem with truck load constraint using metaheuristics
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems

This page was built for publication: Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems

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