A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs
From MaRDI portal
Publication:833452
DOI10.1007/s11081-008-9059-xzbMath1187.90080OpenAlexW1997495093MaRDI QIDQ833452
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-008-9059-x
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (5)
Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic ⋮ A possibilistic approach to the modeling and resolution of uncertain closed-loop logistics ⋮ A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores ⋮ Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques ⋮ A closed-loop logistic model with a spanning-tree based genetic algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
- A genetic algorithm approach on tree-like telecommunication network design problem
This page was built for publication: A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs
