A tabu search heuristic procedure for the fixed charge transportation problem

DOI10.1016/S0377-2217(97)00284-1zbMath0991.90010OpenAlexW1970848641WikidataQ57570788 ScholiaQ57570788MaRDI QIDQ1609908

Jay E. Aronson, Patrick G. McKeown, Dennis Drinka, Minghe Sun

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00284-1

zbMATH Keywords

tabu searchprogramminginteger algorithmsfixed charge transportation problemflow algorithmsinteger heuristicnetworks/graphs

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Transportation, logistics and supply chain management (90B06)

Related Items

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder, Team-building with answer set programming in the Gioia-Tauro seaport, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, On lower bounds for the fixed charge problem, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, Profit maximization fuzzy 4D-TP with budget constraint for breakable substitute items: a swarm based optimization approach, An integer programming column generation principle for heuristic search methods, Augmented Lagrangian method with alternating constraints for nonlinear optimization problems, An extreme‐point tabu‐search algorithm for fixed‐charge network problems, A heuristic algorithm for the fixed charge problem, Solving fixed charge transportation problem with truck load constraint using metaheuristics, Reduction methods of type-2 uncertain variables and their applications to solid transportation problem, A bicriteria solid transportation problem with fixed charge under stochastic environment, A genetic algorithm for solving the fixed-charge transportation model: two-stage problem, Solving the uncapacitated facility location problem using tabu search, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, A review of transport market modeling using game-theoretic principles, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Uncertain programming models for fixed charge multi-item solid transportation problem, Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint, A fixed charge transportation problem with damageable items under uncertain environment, A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences, COLE: a new heuristic approach for fixed charge problem computational results, Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem, Fractional polynomial bounds for the fixed charge problem, Determining buffer location and size in production lines using tabu search, Entropy based solid transportation problems with discounted unit costs under fuzzy random environment, Metaheuristics in combinatorial optimization, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

Uses Software

• Tabu search
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A survey of dynamic network flows
• Tabu search techniques. A tutorial and an application to neural networks
• The fixed charge problem. I: A new heuristic method
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• A user's guide to tabu search
• Tabu search applied to the general fixed charge problem
• Fixed-cost transportation problems
• A branch-and-bound algorithm for solving fixed charge problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• An approximative algorithm for the fixed-charges transportation problem
• An easy solution for a special class of fixed charge problems
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• The pure fixed charge transportation problem
• Tabu Search—Part I
• Tabu Search—Part II
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• A Deterministic Multi-Period Production Scheduling Model with Backlogging
• Minimum Concave Cost Flows in Certain Networks
• The fixed charge problem
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• The fixed charge problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• On the fixed cost flow problem†
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem