Abstract
Even though the Estimation of Distribution Algorithms (EDAs) have recently been applied to solve many hard problems, only a few EDAs discussed the in-group optimization problems, such as the multiple traveling salesmen problem (mTSP) studied in this research. These problems include the assignment and sequencing procedures in the same time and to be shown in different forms. As a result, this research proposed an algorithm deal by using the Self-Guided GA together with the Minimum Loading Assignment rule (MLA) to tackle the mTSP. We compare the proposed algorithm against the best direct encoding technique, two-part encoding genetic algorithm, in the experiment on the 33 instances drawn from the well-known TSPLIB. The experimental results show the proposed algorithm is better than the compared algorithm in terms of minimization of the total traveling distance. An interesting result also presents the proposed algorithm would not cause longer traveling distance when we increase the number of salesmen from 3 to 10 persons under the objective of minimization of total traveling distance. This research may suggest the EDAs researcher could employ the MLA rule instead of the direct encoding algorithms.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Schedule Problem
- Mutation Operator
- Distribution Algorithm
- Single Machine Schedule Problem
- Assignment Rule
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)
Carter, A.E., Ragsdale, C.T.: A new approach to solving the multiple traveling salesperson problem using genetic algorithms. European Journal of Operational Research 175(1), 246–257 (2006)
Ceberio, J., Irurozki, A.M.E., Lozano, J.: A review on Estimation of Distribution Algorithms in Permutation-based Combinatorial Optimization Problems. Accepted by Progress in Artificial Intelligence (2011)
Chang, P.C., Hsieh, J.C., Chen, S.H., Lin, J.L., Huang, W.H.: Artificial chromosomes embedded in genetic algorithm for a chip resistor scheduling problem in minimizing the makespan. Expert Systems With Applications 36(3 Pt. 2), 7135–7141 (2009)
Chen, S.H., Chang, P.C., Cheng, T.C.E., Zhang, Q.: A self-guided genetic algorithm for permutation flowshop scheduling problems. Computers & Operations Research 39(7), 1450–1457 (2012)
Chen, S.H., Chang, P.C., Edwin Cheng, T.C., Zhang, Q.: A self-guided genetic algorithm for permutation flowshop scheduling problems. Computers & Operations Research 39(7), 1450–1457 (2012)
Chen, S.H., Chang, P.C., Zhang, Q., Wang, C.B.: A guided memetic algorithm with probabilistic models. International Journal of Innovative Computing, Information and Control 5(12), 4753–4764 (2009)
Chen, S.H., Chen, M.C.: Operators of the two-part encoding genetic algorithm in solving the multiple traveling salesmen problem. In: The 2011 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2011 (2011)
Chen, S.H., Chen, M.C., Chang, P.C., Chen, Y.M.: Ea/g-ga for single machine scheduling problems with earliness/tardiness costs. Entropy 13(6), 1152–1169 (2011)
Chen, S.-H., Chen, M.-C.: Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. International Journal of Production Economics 141(1), 24–33 (2013)
Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Accepted by Swarm and Evolutionary Computation (2011)
Jarboui, B., Eddaly, M., Siarry, P.: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers & Operations Research 36(9), 2638–2646 (2009)
Pan, Q., Ruiz, R.: An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2), 166–180 (2012)
Shim, V.A., Tan, K., Cheong, C.: A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 42(5), 682–691 (2012)
Zhang, Y., Li, X.: Estimation of distribution algorithm for permutation flow shops with total flowtime minimization. Computers & Industrial Engineering 60(4), 706–718 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, S.H., Chen, Y.H. (2014). A New Estimation of Distribution Algorithm to Solve the Multiple Traveling Salesmen Problem with the Minimization of Total Distance. In: Pan, JS., Snasel, V., Corchado, E., Abraham, A., Wang, SL. (eds) Intelligent Data analysis and its Applications, Volume I. Advances in Intelligent Systems and Computing, vol 297. Springer, Cham. https://doi.org/10.1007/978-3-319-07776-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-07776-5_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07775-8
Online ISBN: 978-3-319-07776-5
eBook Packages: EngineeringEngineering (R0)