Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers

DOI10.1016/j.ejor.2003.11.029zbMath1112.90361OpenAlexW2078398625MaRDI QIDQ1776965

Paul V. Preckel, George Beaujon, Subramanian Krishnan, Jeffrey D. Tew, Erdem Eskigun, Reha Uzsoy

Publication date: 12 May 2005

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

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

zbMATH Keywords

supply chainnetwork designLagrangian heuristiccapacitated distribution centers

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Related Items (25)

Mode selection for automotive distribution with quantity discounts ⋮ Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach ⋮ An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem ⋮ A large neighborhood search heuristic for supply chain network design ⋮ Sustainable agro-food supply chain design using two-stage hybrid multi-objective decision-making approach ⋮ A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design ⋮ Some Transportation Problems Under Uncertain Environments ⋮ Responsive make‐to‐order supply chain network design ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ Managing quality, supplier selection, and cold‐storage contracts in agrifood supply chain through stochastic optimization ⋮ A supply chain design problem with facility location and bi-objective transportation choices ⋮ A fuzzy multi-criteria group decision making based on ranking interval type-2 fuzzy variables and an application to transportation mode selection problem ⋮ A LAGRANGIAN-BASED SOLUTION ALGORITHM FOR STRATEGIC SUPPLY CHAIN DISTRIBUTION DESIGN IN UNCERTAIN ENVIRONMENT ⋮ An analytical study of the modification ability of distribution centers ⋮ Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs ⋮ Outbound supply chain network design with mode selection and lead time considerations ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem ⋮ Tactical optimization of the oil palm agribusiness supply chain ⋮ A fuzzy MCDM method and an application to solid transportation problem with mode preference ⋮ A genetic algorithm for a single product network design model with lead time and safety stock considerations ⋮ A multi-stage supply chain network design problem with in-house production and partial product outsourcing ⋮ Facility location and supply chain management. A review ⋮ A two-echelon inventory-location problem with service considerations ⋮ The impact of distribution system characteristics on computational tractability

Uses Software

• Knapsack

Cites Work

• A comparison of heuristics and relaxations for the capacitated plant location problem
• Efficient algorithms for the capacitated concentrator location problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Coordinated supply chain management
• Strategic production-distribution models: A critical review with emphasis on global supply chain models
• Coordination of production and distribution planning
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• The capacitated plant location problem
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
• Lagrangean heuristics for location problems
• Integrated production/distribution planning in supply chains: An invited review
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• The Latest Arrival Hub Location Problem
• An LP-based heuristic for two-stage capacitated facility location problems
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A New Algorithm for the 0-1 Knapsack Problem
• Multicommodity Distribution System Design by Benders Decomposition
• Resolution of the 0–1 knapsack problem: Comparison of methods
• Computing Partitions with Applications to the Knapsack Problem
• Performance, reliability, and performability of material handling systems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• Discrete-Variable Extremum Problems
• A modified subgradient algorithm for Lagrangean relaxation
• Capacitated facility location/network design problems.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers