The Multi-Depot Travelling Salesman Problem using MATLAB Coding with Genetic Algorithm:A Case Study of Domino’s Pizza Centers

  • Authors

    • Ms. Nilofer
    • Dr. Mohd.Rizwanullah
    2018-12-19
    https://doi.org/10.14419/ijet.v7i4.41.24528
  • Fittest, GA, MATLAB Code, Mutation, TSP

  • Abstract

    Dominos is the best pizza delivery company in the world. In current phase of business it is also having the high demand of internal consumption. The delivery boy need to cover the 12 centers which are located at different place in Jaipur. In this paper an attempt has been made to improve delivering of pizzas at twelve randomly Centers in the city. The problem is modeled as Travelling Salesman Problem. In this problem, our objective is to find the  lowest tour cost of the pizzas centers, which are connected. Different paths cost is given (TSP) and it is very similar to the Assignment Problem (AP) apart from there is an further constraint i.e. Ci j =∞, if i = j.  The salesman has to visit n cities. The objective in this paper is to select the method in which the cities are visit in such a way and that total travelling time is to be minimized; sometimes AP does not fulfill the further restriction, In this article we present modiï¬ed one’s algorithm with MATLAB Coding with genetic algorithm for the solution of the  TSP problem.

     

  • References

    1. [1]. Abid H. Yousaf S.M., Nauman S., Ijaz. H., Alaa M. S., Showkat G. “Genetic Algorithm for Traveling Salesman Problem with ssModified Cycle Crossover Operatorâ€, Hindawi Computational Intelligence and Neuroscience Volume Article ID 7430125, 7 pages https://doi.org/10.1155/2017/7430125(2017).

      [2]. Asadi ,H. ,Tavakkoli M. , Shahsavari P. , and Naja, E.(2016)“A new nondominated sorting genetic algorithm based on the regression line for fuzzy traffic signal optimization problemâ€, Sharif University of Technology ScientiaIranica Transactions E: IndustrialEngineeringhttp://scientiairanica.sharif.edu.

      [3]. Chavez, S., Willmer, J., and Echeverri, E.M.G.(2016), “A multi-objective Pareto ant colony algorithm for the multi-depot vehicle routing problem with backhauls", International Journal of Industrial Engineering Computations, 7, pp. 35-48.

      [4]. Dorigo,M.andGambradella,L.M.(1997), Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem, JEEE Transaction on Evolutionary Computation, Vol. l, pp. 53-66.

      [5]. Greffenstette, J.,(1991), Genetic Algorithms Made Easy.

      [6]. Hajipour, V., Mehdizadeh, E., and Tavakkol I.,Moghaddam, R. (2014), “ novel Pareto-based multi-objective vibration damping optimization algorithm to solve multi-objective optimization problems", ScientiaIranica E, 21(6), pp. 2368-2378.

      [7]. HamidA.,Amin A(2017), “ Using genetic algorithms for long-term planning of network of bridgesâ€, journal of Scientiairanica .

      [8]. K. P. Ghadle and Y. M. Muley,(2015), “Travelling salesman problem with MATLAB programming,†International Journal of Advances in Applied Mathematics and Mechanics, vol. 2, no. 3, pp.258–266.

      [9]. Zhao, X., Hsu, Y.C., ChangB., P.C., and Li, L(2016), A genetic algorithm for the multi-objective optimization of mixed-model assembly line based on the mental workload", Engineering Applications of Artificial Intelligence, 47, pp. 140-146.

      [10]. Zhu, Z., Xiao, J., He, S., Zhen, J., and Sun, Y.,(2016), “A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem", Information Sciences, 329, pp. 73-89

  • Downloads

  • How to Cite

    Nilofer, M., & Mohd.Rizwanullah, D. (2018). The Multi-Depot Travelling Salesman Problem using MATLAB Coding with Genetic Algorithm:A Case Study of Domino’s Pizza Centers. International Journal of Engineering & Technology, 7(4.41), 203-206. https://doi.org/10.14419/ijet.v7i4.41.24528

    Received date: 2018-12-21

    Accepted date: 2018-12-21

    Published date: 2018-12-19