Scheduling for a container supply chain to minimize costs using the meta-innovation approach

In this study, a problem of scheduling shipping lines for a container supply chain is addressed in order to minimize the costs of charging ships and the cost of maintaining the inventory of empty containers in the port by considering the time window of the port and the amount of fuel. This is a hard-NP problem and cannot be solved on a large scale with precise methods in a logical time. Therefore, to solve and optimize the model, a meta-innovative algorithm, genetic algorithm, has been used. Also, to increase the effectiveness of the genetic algorithm, the parameters of the algorithm are adjusted using the Taguchi method. Finally, a number of problems have been solved to show the performance of this algorithm and its computational results have been compared with the results obtained from GAMS software.

• Autores: Husein, Ismail; Suhada, Arif; Chetthamrongchai, Paitoon; Peressypki, Andrej P.; Nurrohkayati, Anis Siti; Hoang Ca, Vo; Huynh Tan, Hoi; Grimaldo Guerrero, John William; M. Kavitha, M.
• Tipo de recurso: Article of journal
• Fecha de publicación: 2021
• Institución: Corporación Universidad de la Costa
• Repositorio: REDICUC - Repositorio CUC
• Idioma: eng
• OAI Identifier: oai:repositorio.cuc.edu.co:11323/9113
• Acceso en línea: https://hdl.handle.net/11323/9113; https://doi.org/10.7232/iems.2021.20.4.662; https://repositorio.cuc.edu.co/
• Palabra clave: Transport network transport network design; Container supply chain; Line scheduling; Genetic algorithm
• Rights: openAccess
• License: Atribución 4.0 Internacional (CC BY 4.0)