A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge

DOI10.1016/j.ejor.2007.12.005zbMath1154.90629OpenAlexW2027747514MaRDI QIDQ1002061

A. N. Balaji, N. Jawahar

Publication date: 23 February 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.005

zbMATH Keywords

heuristicsgenetic algorithmsupply chainfixed chargedistribution problem

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Genetic algorithms in supply chain management: a critical analysis of the literature, A matheuristic for the two-stage fixed-charge transportation problem, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes, Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem, Managing risk and disruption in production-inventory and supply chain systems: a review, On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model, Solving fixed charge transportation problem with truck load constraint using metaheuristics, A genetic algorithm for solving the fixed-charge transportation model: two-stage problem, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach, Modeling of biological intelligence for SCM system optimization, A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences, Fractional polynomial bounds for the fixed charge problem

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• A genetic approach to the quadratic assignment problem
• A greedy genetic algorithm for the quadratic assignment problem
• A tabu search heuristic procedure for the fixed charge transportation problem
• Cross-facility management of production and transportation planning problem
• Genetic algorithms for modelling and optimisation
• An algorithm for solving fixed-charge problems using surrogate constraints
• A branch-and-bound algorithm for solving fixed charge problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• The pure fixed charge transportation problem
• Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Simulation optimisation using a genetic algorithm
• Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
• The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem