A variable neighborhood decomposition search method for supply chain management planning problems

DOI10.1016/j.ejor.2005.05.021zbMath1142.90424OpenAlexW2034865445MaRDI QIDQ2433455

Yanyan Li

Publication date: 27 October 2006

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

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

zbMATH Keywords

metaheuristicssupply chain managementvariable neighborhood searchlarge scale optimizationinventory-production-distribution planning

Mathematics Subject Classification ID

Search theory (90B40) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (16)

Multi-objective bi-level supply chain network order allocation problem under fuzziness ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Minimizing the total completion time in a distributed two stage assembly system with setup times ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ Modèle linéaire mixte et heuristique pour un réseau de distribution à deux échelons pour des produits périssables ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Designing an integrated responsive-green-cold vaccine supply chain network using Internet-of-Things: artificial intelligence-based solutions ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Tactical supply chain planning models with inherent flexibility: definition and review ⋮ A tactical supply chain planning model with multiple flexibility options: an empirical evaluation ⋮ Opportunities and challenges in sustainable supply chain: an operations research perspective ⋮ Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques ⋮ Variable neighbourhood search: methods and applications ⋮ A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure ⋮ Variable neighbourhood search: Methods and applications ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis

Uses Software

• AMPL
• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• Corporate planning in local authorities
• Coordinated supply chain management
• Strategic production-distribution models: A critical review with emphasis on global supply chain models
• Variable neighborhood search
• Local branching
• Solving zero-one mixed integer programming problems using tabu search
• Solving the medium newspaper production/distribution problem
• Variable neighborhood decomposition search
• Extending an Algebraic Modeling Language to Support Constraint Programming
• Octane: A New Heuristic for Pure 0–1 Programs
• Horizon Effects in Aggregate Production Planning with Seasonal Demand
• Planning horizon procedures for machine replacement models with several possible replacement alternatives
• Variable neighborhood search: Principles and applications

This page was built for publication: A variable neighborhood decomposition search method for supply chain management planning problems