A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
type: Item
instance of: scholarly article
title: A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
zbMATH Open document ID: 1154.90629
author: N. Jawahar
author: A. N. Balaji
published in: European Journal of Operational Research
publication date: 2009-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 60E05
zbMATH DE Number: 5509861
zbMATH Keywords: fixed charge
zbMATH Keywords: distribution problem
zbMATH Keywords: supply chain
zbMATH Keywords: genetic algorithm
zbMATH Keywords: heuristics
describes a project that uses: Genocop
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.12.005
OpenAlex ID: W2027747514
cites work: A greedy genetic algorithm for the quadratic assignment problem
cites work: A New Optimization Method for Large Scale Fixed Charge Transportation Problems
cites work: Q4261216
cites work: Some branch-and-bound procedures for fixed-cost transportation problems
cites work: Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
cites work: Cross-facility management of production and transportation planning problem
cites work: The pure fixed charge transportation problem
cites work: Q4321554
cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
cites work: Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
cites work: The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
cites work: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
cites work: Q4113591
cites work: Q5286652
cites work: Q4891488
cites work: Genetic algorithms for modelling and optimisation
cites work: A branch-and-bound algorithm for solving fixed charge problems
cites work: Q4315824
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: A Branch-and-Bound Method for the Fixed Charge Transportation Problem
cites work: Simulation optimisation using a genetic algorithm
cites work: An algorithm for solving fixed-charge problems using surrogate constraints
cites work: Use of penalties in a branch and bound procedure for the fixed charge transportation problem
cites work: A tabu search heuristic procedure for the fixed charge transportation problem
cites work: A genetic approach to the quadratic assignment problem
DOI: 10.1016/J.EJOR.2007.12.005
description: scientific article; zbMATH DE number 5509861