A multi-population genetic algorithm for transportation scheduling
This study considers the integration of production and transportation scheduling in a two-stage supply chain environment. The objective function minimizes the total tardiness and total deviations of assigned work loads of suppliers from their quotas. After modeling the problem as a mixed integer programming problem, a genetic algorithm with three populations, namely, a multi-society genetic algorithm (MSGA), is proposed for solving it. MSGA is compared with the optimum solutions for small problems and a heuristic and a random search approach for larger problems. Additionally, an MSGA is compared with a generic genetic algorithm. The experimental results show the superiority of the MSGA.
Volume (Year): 45 (2009)
Issue (Month): 6 (November)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:45:y:2009:i:6:p:946-959. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.