Solution of Solid Traveling Purchaser Problem Using Efficient Genetic Algorithm with Probabilistic Selection and Multi-Parent Crossover Technique

Authors

  • Arindam Roy Assistant Professor & Head Department of Computer Science Prabhat Kumar College, Contai Purba Medinipur, Affiliated to Vidyasagar University,West Benagl, India Pin- 721401

DOI:

https://doi.org/10.37591/rrdms.v5i3.1865

Keywords:

GA, TSP, TPP, Solid TSP and Solid TPP

Abstract

In this paper, I design a NP-hard optimization problem and solve this problem by developing a nature-based multi-parent crossover in genetic algorithm (GA). Initially, taking a set of markets, a depot and some products for each of which a positive demand is specified. Purchaser can purchase each product from a subset of markets only a given quantity, less than or equal to the required one, can be purchased at a given unit price. Traveling purchaser forms a cycle starting at and ending to the depot and visiting a subset of markets at a minimum traveling cost. Here, I consider multiple vehicle to visit different markets say solid TPP (STPP). The activeness of my model is illustrated by numerical examples.

Cite this Article

Arindam Roy. Solution of Solid Traveling Purchaser Problem Using Efficient Genetic Algorithm with Probabilistic Selection and Multi-Parent Crossover Technique. Research & Reviews: Discrete Mathematical Structures. 2018; 5(3):
20–26p.

Author Biography

  • Arindam Roy, Assistant Professor & Head Department of Computer Science Prabhat Kumar College, Contai Purba Medinipur, Affiliated to Vidyasagar University,West Benagl, India Pin- 721401
    Phone number: +91 03220-255020(O)Fax : +91 03220-255020(O) 
    9434801964 (Mobile)
    E mail : [email protected]
    E mail : [email protected]

References

Buzacott J. A., Dutta S K., Sequencing many jobs on a multipurpose facility. Naval Research Logistics Quaterly. 1971; 18: 75–82p.

Chiang W. C., Russell R. A., Simulated annealing meta heuristics for the vehicle routine problem with time windows. Annals of Operations Research. 1997; 63: 3–27p.

Eberhart R. C., Kennedy J., Particle swarm optimization. Proc. IEEE Conference on Neural Networks. 1995; 4: 1942–1948p.

Holland J. H., An efficient genetic algorithm for the traveling salesman problem. European Journal of Operational Research. 1975; 145: 606–617p.

Knoxl J., The application of Tabu search to the symmetric traveling salesman problem. Ph.D. Dissertation, University of Colorado; 1989.

Bianchi L., Dorigo M., Gambardella L. M., Ant colony optimization approach to the probabilistic travelling salesman problem. PPSN VII, LNCS. 2002; 2439: 883–892p.

Laptore G., Riera-Ledesma J., Salazar-Gonzalez J-J., A branch-and-cut algorithm for the undirected traveling purchaser problem. Opsearch. 2000; 51(6): 940–951p.

Marinakis Y., Marinakii M., A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Computers and Operations Research. 2010; 37(3): 432–442p.

Ramesh T., Traveling purchaser problem. Opsearch. 1981; 18: 78–91p.

Singh K. N., Van Oudheusden D. L., A branch and bound algorithm for the traveling purchaser problem. European Journal of Operational Research. 1997; 97: 571–579p.

Zadeh L. A., Fuzzy logic and soft computing: issues, contentions and perspectives. Proc. of IIZUKA’94: Third Int. Conf. on Fuzzy Logic, Neural Nets and Soft Computing. 1994; pp. 1-2, Iizuka, Japan.

Zadeh L. A., Some reflection on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems. Soft Computing A Fusion of Foundations, Methodologies and Applications. 1998; 2(1): 23–25p.

Changdar, C., Maiti, M. K., & Maiti, M. (2013)., A Constrained solid TSP in fuzzy

environment:two heuristic approaches. Iranian Journal of Fuzzy System. 2013; 10(1):1–28p.

Downloads

Published

2019-02-07

Issue

Vol. 5 No. 3 (2018)

Section

Research Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.