Hiindex LOGO

Research Article

Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems


Author(s): Adrianus Vincent Djunaidi , Cynthia Prithadevi Juwono
Affiliation: Industrial Engineering Department, Parahyangan Catholic University, Bandung, Indonesia .Email: adrianus.djunaidi95@gmail.com
Year of Publication: 2018
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2018/article.php?page=925"><img src="http://www.hindex.org/sai.php/2018SCIA316F0925" alt="SAI"></a>


File:

http://www.hindex.org/2018/p925.pdf


Citation: Adrianus Vincent Djunaidi, Cynthia Prithadevi Juwono. "Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems." International Journal of Computing Algorithm 7.1 (2018): 45-53.

Abstract:
Capacitated Vehicle Routing Problem is a problem about finding the shortest route travelled by the vehicles in serving the customers. Each vehicle starts from a depot and the vehicle that has completed the assigned route will return to the depot. Each customer can only be served by one vehicle. The vehicle capacity and demand of each customer are considered. In this research, Capacitated Vehicle Routing Problem was solved by using Football Game Algorithm. Football Game Algorithm is a metaheuristic algorithm that is inspired by the behavior of football players in finding the best position to score. The total distance travelled by all the vehicles was used to measure the performance of Football Game Algorithm in solving the Capacitated Vehicle Routing Problem. Football Game Algorithm was implemented in six benchmark cases.


Keywords Capacitated Vehicle Routing Problem CVRP; Combinatorial Problem; Distribution; Football Game Algorithm; Metaheuristics


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{Foo1892545, author = {Adrianus Vincent Djunaidi,Cynthia Prithadevi Juwono}, title = {Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems}, journal={International Journal of Computing Algorithm}, volume={7}, issue={1}, issn = {2278-2397}, year = {2018}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] T. J. Ai and V. Kachitvichyanukul, "A Particle Swarm Optimization for the Capacitated Vehicle Routing Problem," International Journal of Logistics and SCM Systems, vol. 2, pp. 50-55, 2007.
  • [2] T. J. Ai and V. Kachitvichyanukul, "Particle Swarm Optimization and Two Solution Representations for Solving The Capacitated Vehicle Routing Problem," Computers & Industrial Engineering, vol. 56, pp. 380-387, 2009.
  • [3] H. Allaoua, "Combination of Genetic Algorithm with Dynamic Programming for Solving TSP," International Journal of Advances in Soft Computing and Its Applications, vol. 9, pp. 31-44, 2017.
  • [4] M. Alssager and Z. A. Othman, "Cuckoo Search Algorithm for Capacitated Vehicle Routing Problem," Journal of Theoretical and Applied Information Technology, vol. 9, pp. 11-19, 2016.
  • [5] R. Baldacci, A. Mingozzi and R. Roberti, "Recent Exact Algorithms for Solving the Vehicle Routing Problem under Capacity and Time Windows Constraints," European Journal of Operational Research, vol. 218, no. 1, pp. 1-6, 2012.
  • [6] Z. Beheshti and S. M. Shamsuddin, "A Review of Population-Based Meta-Heuristic Algorithm," International journal of Advances in Soft Computing and Its Applications, vol. 5, pp. 1-35, 2013.
  • [7] Brajevic, "Artificial Bee Colony Algorithm for the Capacitated Vehicle Routing Problem," in Proceedings of the European Computing Conference, Paris, 2011.
  • [8] J. F. Cordeau, G. Laporte, M. W. Savelsbergh and D. Vigo, "Vehicle Routing," in Handbook in OR & MS Vol 14, Elsevier, 2007, pp. 367-427.
  • [9] S. Desale, A. Rasool, S. Andhale and P. Rane, "Heuristic and Meta-Heuristic Algorithms and Their Relevance to the Real World: A Survey," International Journal of Computer Engineering in Research Trends, vol. 2, no. 5, pp. 296-304, 2015.
  • [10] E. Fadakar and M. Ebrahimi, "A New Metaheuristic Football Game Inspired Algorithm," in 1st Conference on Swarm Intelligence and Evolutionary Computation CSIEC2016 IEEE, Iran, 2016.
  • [11] H. M. Harmanani, D. Azar, N. G. Helal and W. Keirouz, "A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem," in Proceedings of the ISCA 26th International Conference on Computers and Their Applications, New Orleans, Louisiana, 2011.
  • [12] Y. Kao and M. Chen, "Solving the CVRP Problem Using a Hybrid PSO Approach," in Studies in Computational Intelligence, Berlin, Heidelberg, Springer, 2013, pp. 59-67.
  • [13] L. Korayem, M. Khorsid and S. S. Kassem, "Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem," IOP Conf. Series: Materials Science and Engineering, vol. 83, pp. 1-10, 2015.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2018</publicationDate> <volume>7</volume> <issue>1</issue> <startPage>45</startPage> <endPage>53</endPage> <documentType>article</documentType> <title language='eng'>Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems</title> <authors> <author> <name>Adrianus Vincent Djunaidi</name> </author> </authors> <abstract language='eng'>Capacitated Vehicle Routing Problem is a problem about finding the shortest route travelled by the vehicles in serving the customers. Each vehicle starts from a depot and the vehicle that has completed the assigned route will return to the depot. Each customer can only be served by one vehicle. The vehicle capacity and demand of each customer are considered. In this research, Capacitated Vehicle Routing Problem was solved by using Football Game Algorithm. Football Game Algorithm is a metaheuristic algorithm that is inspired by the behavior of football players in finding the best position to score. The total distance travelled by all the vehicles was used to measure the performance of Football Game Algorithm in solving the Capacitated Vehicle Routing Problem. Football Game Algorithm was implemented in six benchmark cases. </abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2018/p925.pdf</fullTextUrl> <keywords language='eng'> <keyword>Capacitated Vehicle Routing Problem CVRP; Combinatorial Problem; Distribution; Football Game Algorithm; Metaheuristics</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2018/article.php?page=925", "name":"Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems", "author":[{"name":"Adrianus Vincent Djunaidi "}], "datePublished":"2018", "description":"Capacitated Vehicle Routing Problem is a problem about finding the shortest route travelled by the vehicles in serving the customers. Each vehicle starts from a depot and the vehicle that has completed the assigned route will return to the depot. Each customer can only be served by one vehicle. The vehicle capacity and demand of each customer are considered. In this research, Capacitated Vehicle Routing Problem was solved by using Football Game Algorithm. Football Game Algorithm is a metaheuristic algorithm that is inspired by the behavior of football players in finding the best position to score. The total distance travelled by all the vehicles was used to measure the performance of Football Game Algorithm in solving the Capacitated Vehicle Routing Problem. Football Game Algorithm was implemented in six benchmark cases. ", "keywords":["Capacitated Vehicle Routing Problem CVRP; Combinatorial Problem; Distribution; Football Game Algorithm; Metaheuristics"], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>Cynthia Prithadevi Juwono</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Adrianus Vincent Djunaidi</dc:creator> <dc:date>2018</dc:date> <dc:description>Capacitated Vehicle Routing Problem is a problem about finding the shortest route travelled by the vehicles in serving the customers. Each vehicle starts from a depot and the vehicle that has completed the assigned route will return to the depot. Each customer can only be served by one vehicle. The vehicle capacity and demand of each customer are considered. In this research, Capacitated Vehicle Routing Problem was solved by using Football Game Algorithm. Football Game Algorithm is a metaheuristic algorithm that is inspired by the behavior of football players in finding the best position to score. The total distance travelled by all the vehicles was used to measure the performance of Football Game Algorithm in solving the Capacitated Vehicle Routing Problem. Football Game Algorithm was implemented in six benchmark cases. </dc:description> <dc:identifier>2018SCIA316F0925</dc:identifier> <dc:language>eng</dc:language> <dc:title>Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2018SCIA316F0925", "abstract": "Capacitated Vehicle Routing Problem is a problem about finding the shortest route travelled by the vehicles in serving the customers. Each vehicle starts from a depot and the vehicle that has completed the assigned route will return to the depot. Each customer can only be served by one vehicle. The vehicle capacity and demand of each customer are considered. In this research, Capacitated Vehicle Routing Problem was solved by using Football Game Algorithm. Football Game Algorithm is a metaheuristic algorithm that is inspired by the behavior of football players in finding the best position to score. The total distance travelled by all the vehicles was used to measure the performance of Football Game Algorithm in solving the Capacitated Vehicle Routing Problem. Football Game Algorithm was implemented in six benchmark cases. ", "author": [ { "family": "Adrianus Vincent Djunaidi,Cynthia Prithadevi Juwono" } ], "id": "925", "issued": { "date-parts": [ [ 2018 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Football Game Algorithm Implementation On The Capacitated Vehicle Routing Problems", "type": "publication-article", "version": "3" }