Dynamic network design for reverse logistics operations under uncertainty
Transportation Research Part E Logistics and Transportation ReviewPublished 15 October 2008Open access
Der‐Horng Lee, Meng Dong
Citations271
SJR quartileQ4
SJR score0.11
SNIP0.06
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
10.1016/j.tre.2008.08.002
Keywords
Business, Management and AccountingEnvironmental Science
SIAM Journal on OptimizationThe Sample Average Approximation Method for Stochastic Discrete Optimization
2,011 Citations2002Anton J. Kleywegt, Alexander Shapiro +1 more
A Monte Carlo simulation--based approach to stochastic discrete optimization problems, where a random sample is generated and the expected value function is approximated by the corresponding sample average function.
European Journal of Operational ResearchA stochastic programming approach for supply chain network design under uncertainty
1,115 Citations2004Tjendera Santoso, Shabbir Ahmed +2 more
Production and Operations ManagementTHE IMPACT OF PRODUCT RECOVERY ON LOGISTICS NETWORK DESIGN
825 Citations2001Moritz Fleischmann, Patrick Beullens +2 more
This paper considers logistics network design in a reverse logistics context with a generic facility location model and uses this model to analyze the impact of product return flows on logistics networks.
OmegaA characterisation of logistics networks for product recovery
769 Citations2000Mortiz Fleischmann, Hans Ronald Krikke +2 more
This work identifies general characteristics of product recovery networks and compares them with traditional logistics structures, and derives a classification scheme for different types of recovery networks.
Operations Research LettersMonte Carlo bounding techniques for determining solution quality in stochastic programs
705 Citations1999Wai-Kei Mak, David P. Morton +1 more
It is shown that, in expectation, z^*"n is a lower bound on z* and that this bound monotonically improves as n increases, and confidence intervals are constructed on the optimality gap for any candidate solution x@^ to SP.
Mathematical ProgrammingConvergence of an annealing algorithm
696 Citations1986Margaret E. Lundy, A.I. Mees
This paper presents a model of the annealing algorithm and proves that the algorithm converges with probability arbitrarily close to 1, and shows that there are cases where convergence takes exponentially long—that is, it is no better than a deterministic method.
European Journal of Operational ResearchAn optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty
528 Citations2006Maria Isabel Gomes, Ana Paula Barbosa‐Póvoa +1 more
A generalized model for the design of a generic reverse logistics network where capacity limits, multi-product management and uncertainty on product demands and returns are considered is proposed.
European Journal of Operational ResearchA stochastic approach to a case study for product recovery network design
354 Citations2003Ovidiu Listeş, Rommert Dekker
A stochastic programming based approach by which a deterministic location model for product recovery network design may be extended to explicitly account for the uncertainties to give more insight into decision-making under uncertainty for reverse logistics.
Mathematical ProgrammingA branch and bound method for stochastic global optimization
323 Citations1998V. I. Norkin, Georg Ch. Pflug +1 more
A stochastic branch and bound method for solving Stochastic global optimization problems is proposed and random accuracy estimates derived.
Management ScienceA Dual-Based Procedure for Dynamic Facility Location
265 Citations1982Tony J. Van Roy, Donald Erlenkotter
A branch-and-bound procedure incorporating a dual ascent method is presented and shown to be superior to previously developed methods and comparable to the most efficient methods for solving static single-period location problems.
Naval Research Logistics QuarterlyA branch‐bound algorithm for the capacitated facilities location problem
185 Citations1969Peter Davis, T. L. Ray
European Journal of Operational ResearchA multiperiod two-echelon multicommodity capacitated plant location problem
163 Citations2000Yolanda Hinojosa, Justo Puerto +1 more
A Lagrangean relaxation is proposed to solve the facility location problem, together with a heuristic procedure that constructs feasible solutions of the original problem from the solutions at the lower bounds obtained by the relaxed problems.
Polymer-Plastics Technology and EngineeringCarpet Recycling: Determining the Reverse Production System Design
109 Citations1999Matthew J. Realff, Jane C. Ammons +1 more
European Journal of Operational ResearchOn solving complex multi-period location models using simulated annealing
98 Citations2001António Pais Antunes, Dominique Peeters
Evaluating the capabilities of simulated annealing in dealing with complex, real-world multi-period location problems raised by school network planning in Portugal indicates that simulatedAnnealing can be a useful tool for solving these kinds of models.
Computers & Operations ResearchA Bayesian approach to a dynamic inventory model under an unknown demand distribution
94 Citations2002Rajashree Kamath, Timo Pakkala
The optimal policy is derived for an inventory model that allows stock disposal, and is shown to be the solution of a dynamic programming backward recursion, and a method is given to search for the optimal order level around the myopic order level.
Computers & Operations ResearchEfficient primal-dual heuristic for a dynamic location problem
67 Citations2005Joana Dias, M. Eugénia Captivo +1 more
An efficient primal-dual heuristic that computes both upper and lower limits to its optimal solution is described and a branch-and-bound procedure that enables to optimize the problem is also described and tested over the same set of randomly generated problems.