Supply chain management: An opportunity for metaheuristics
In today’s highly competitive and global marketplace the pressure on organizations to find new ways to create and deliver value to customers grows ever stronger. In the last two decades, logistics and supply chain has moved to the center stage. There has been a growing recognition that it is through an effective management of the logistics function and the supply chain that the goal of cost reduction and service enhancement can be achieved. The key to success in Supply Chain Management (SCM) require heavy emphasis on integration of activities, cooperation, coordination and information sharing throughout the entire supply chain, from suppliers to customers. To be able to respond to the challenge of integration there is the need of sophisticated decision support systems based on powerful mathematical models and solution techniques, together with the advances in information and communication technologies. The industry and the academia have become increasingly interested in SCM to be able to respond to the problems and issues posed by the changes in the logistics and supply chain. We present a brief discussion on the important issues in SCM. We then argue that metaheuristics can play an important role in solving complex supply chain related problems derived by the importance of designing and managing the entire supply chain as a single entity. We will focus specially on the Iterated Local Search, Tabu Search and Scatter Search as the ones, but not limited to, with great potential to be used on solving the SCM related problems. We will present briefly some successful applications.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Fleischmann, Moritz & Bloemhof-Ruwaard, Jacqueline M. & Dekker, Rommert & van der Laan, Erwin & van Nunen, Jo A. E. E. & Van Wassenhove, Luk N., 1997. "Quantitative models for reverse logistics: A review," European Journal of Operational Research, Elsevier, vol. 103(1), pages 1-17, November.
- Slats, Piet A. & Bhola, Bis & Evers, Joseph J. M. & Dijkhuizen, Gert, 1995. "Logistic chain modelling," European Journal of Operational Research, Elsevier, vol. 87(1), pages 1-20, November.
- Rita Ribeiro & Helena Ramalhinho-Lourenço, 2001. "A multi-objective model for a multi-period distribution management problem," Economics Working Papers 532, Department of Economics and Business, Universitat Pompeu Fabra.
- Thomas, Douglas J. & Griffin, Paul M., 1996. "Coordinated supply chain management," European Journal of Operational Research, Elsevier, vol. 94(1), pages 1-15, October.
- Bloemhof-Ruwaard, Jacqueline M. & van Beek, Paul & Hordijk, Leen & Van Wassenhove, Luk N., 1995. "Interactions between operational research and environmental management," European Journal of Operational Research, Elsevier, vol. 85(2), pages 229-243, September.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:538. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.