A hybrid Genetic Algorithm approach to minimize the total joint cost of a single-vendor multi-customer integrated scheduling problem
Olivier Grunder,
Zakaria Hammoudan,
Benoit Beroule and
Oussama Barakat
Transportation Planning and Technology, 2019, vol. 42, issue 6, 625-642
Abstract:
This paper addresses the scheduling of supply chains with interrelated factories consisting of a single vendor and multiple customers. In this research, one transporter is available to deliver jobs from vendor to customers, and the jobs can be processed by batch. The problem studied in this paper focuses on a real-case scheduling problem of a multi-location hospital supplied with a central pharmacy. The objective of this work is to minimize the total cost, while satisfying the customer’s due dates constraints. A mathematical formulation of the problem is given as a Mixed Integer Programming model. Then, a Branch-and-Bound algorithm is proposed as an exact method for solving this problem, a greedy local search is developed as a heuristic approach, and a hybrid Genetic Algorithm is presented as a meta-heuristic. Computation experiments are conducted to highlight the performance of the proposed methods.
Date: 2019
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2019.1622254 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:transp:v:42:y:2019:i:6:p:625-642
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20
DOI: 10.1080/03081060.2019.1622254
Access Statistics for this article
Transportation Planning and Technology is currently edited by Dr. David Gillingwater
More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().