|
||||
|
||||
Hybrid Meta-Heuristics for Robust SchedulingM. SuricoPolitecnico di Bari - Dipartimento di Elettrotecnica ed Elettronica U. KaymakErasmus University Rotterdam (EUR) - Faculty of Economics - Department of Computer Science; Erasmus Research Institute of Management (ERIM) D. NasoPolitecnico di Bari - Dipartimento di Elettrotecnica ed Elettronica Rommert DekkerErasmus University, Rotterdam (EUR) - Erasmus School of Economics ; Erasmus University, Rotterdam (EUR) - Erasmus Research Institute of Management (ERIM) ; Tinbergen Institute Rotterdam 30 2006 3, ERIM Report Series Reference No. ERS-2006-018-LIS Abstract: The production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in order to satisfy strict customer specified time-windows. Besides dealing with the typical combinatorial complexity related to activity assignment and synchronization, effective methods must also provide robust schedules, coping with the stochastic perturbations (typically transportation delays) affecting the distribution process. In this paper, we propose a novel metaheuristic approach for robust scheduling. Our approach integrates mathematical programming, multi-objective evolutionary computation, and problem-specific constructive heuristics. The optimization algorithm returns a set of solutions with different cost and risk tradeoffs, allowing the analyst to adapt the planning depending on the attitude to risk. The effectiveness of the approach is demonstrated by a real-world case concerning the production and distribution of ready-mixed concrete.
Number of Pages in PDF File: 23 Keywords: Supply Networks, Robust Scheduling, Meta-Heuristics, Multi-Objective Genetic Optimization JEL Classification: M, L15, O32, C44 working papers seriesDate posted: October 8, 2008Suggested CitationContact Information
|
|
||||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo3 in 0.391 seconds