arrow
Volume 1, Issue 5
Void Vertex Genetic Algorithm for Production-Distribution Supply Chain with GTSP Model

J. Info. Comput. Sci. , 1 (2006), pp. 259-265.

Export citation
  • Abstract
In some instances of production supply chain problems, triangular inequality constraint does not hold for the cost functions. This study aims at solving a special case of these problems, where the triangular inequality constraint still remains valid for the delivery cost within districts. After transforming the particular problem to the second kind of Generalized Travelling Salesman Problem (GTSP), an innovative genetic algorithm using generalized chromosomes with void vertices is employed to solve the special GTSP problem. Case study of simulation for benchmark test problems shows that the proposed algorithm is considerably successful.
  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-1-259, author = {}, title = {Void Vertex Genetic Algorithm for Production-Distribution Supply Chain with GTSP Model}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {1}, number = {5}, pages = {259--265}, abstract = { In some instances of production supply chain problems, triangular inequality constraint does not hold for the cost functions. This study aims at solving a special case of these problems, where the triangular inequality constraint still remains valid for the delivery cost within districts. After transforming the particular problem to the second kind of Generalized Travelling Salesman Problem (GTSP), an innovative genetic algorithm using generalized chromosomes with void vertices is employed to solve the special GTSP problem. Case study of simulation for benchmark test problems shows that the proposed algorithm is considerably successful. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22825.html} }
TY - JOUR T1 - Void Vertex Genetic Algorithm for Production-Distribution Supply Chain with GTSP Model AU - JO - Journal of Information and Computing Science VL - 5 SP - 259 EP - 265 PY - 2024 DA - 2024/01 SN - 1 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22825.html KW - Logistics, SCM, GTSP, TSP, GA. AB - In some instances of production supply chain problems, triangular inequality constraint does not hold for the cost functions. This study aims at solving a special case of these problems, where the triangular inequality constraint still remains valid for the delivery cost within districts. After transforming the particular problem to the second kind of Generalized Travelling Salesman Problem (GTSP), an innovative genetic algorithm using generalized chromosomes with void vertices is employed to solve the special GTSP problem. Case study of simulation for benchmark test problems shows that the proposed algorithm is considerably successful.
. (2024). Void Vertex Genetic Algorithm for Production-Distribution Supply Chain with GTSP Model. Journal of Information and Computing Science. 1 (5). 259-265. doi:
Copy to clipboard
The citation has been copied to your clipboard