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.
Year of publication: |
2009
|
---|---|
Authors: | Zegordi, S.H. ; Beheshti Nia, M.A. |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 45.2009, 6, p. 946-959
|
Publisher: |
Elsevier |
Keywords: | Scheduling Supply chain management Genetic algorithm Transportation Tardiness |
Saved in:
Saved in favorites
Similar items by person
-
A multi-population genetic algorithm for transportation scheduling
Zegordi, S.H., (2009)
-
A multi-population genetic algorithm for transportation scheduling
Zegordi, S.H., (2009)
-
Zegordi, S.H., (2010)
- More ...