A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
From MaRDI portal
Publication:543889
DOI10.1016/j.advengsoft.2010.11.001zbMath1214.90016OpenAlexW2041273349MaRDI QIDQ543889
Mir Saman Pishvaee, Masoud Rabbani
Publication date: 17 June 2011
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2010.11.001
heuristicscombinatorial optimizationgraph theorybipartite graphsnetwork designsupply chain network design
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (5)
A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Optimization of consignment-store-based supply chain with black hole algorithm ⋮ Supply chain network design with financial considerations: a comprehensive review ⋮ A toughness condition for fractional \((k, m)\)-deleted graphs revisited ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
Cites Work
- Unnamed Item
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- Scatter search algorithm for supplier selection and order lot sizing under multiple price discount environment
- A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints
- Facility location and supply chain management. A review
- The design of robust value-creating supply chain networks: a critical review
- The design of reverse distribution networks: Models and solution procedures
- A continuous model for production-distribution system design
- A simulated annealing methodology to distribution network design and management
- A stochastic approach to a case study for product recovery network design
- A bi-objective reverse logistics network analysis for post-sale service
- A genetic algorithm for two-stage transportation problem using priority-based encoding
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
- A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem
- A decomposition algorithm for capacity expansion of local access networks
- Integrated service network design for a cross-docking supply chain network
- A branch‐bound algorithm for the capacitated facilities location problem
- Network design techniques using adapted genetic algorithms
This page was built for publication: A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
