Sensitive Ants in Solving the Generalized Vehicle Routing Problem

Camelia-M. Pintea, Camelia Chira, Dan Dumitrescu

Abstract


The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with a certain level of sensitivity to the pheromone trail. The variable pheromone sensitivity within the same population of ants can potentially intensify the search while in the same time inducing diversity for the exploration of the environment. The performance of sensitive ant models is investigated for solving the generalized vehicle routing problem. Numerical results and comparisons are discussed and analysed with a focus on emphasizing any particular aspects and potential benefits related to hybrid ant-based models.

Keywords


ant-based models, optimization, sensitivity, complex problems

Full Text:

PDF

References


R. Baldacci, E. Bartolini and G. Laporte, Some applications of the Generalized Vehicle Routing Problem, Le Cahiers du GERAD, G-2008-82, 2008.

M. Dorigo, C. Blum, Ant Colony Optimization Theory: A Survey, Theoretical Computer Science, 344, 2-3, pp. 243-278, 2005.

M. Dorigo, L. M. Gambardella. Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comp., 1, pp.53-66, 1997.
http://dx.doi.org/10.1109/4235.585892

D. Feillet, P. Dejax and M. Gendreau, Traveling salesman problems with profits, Transportation Science, Vol. 39, pp. 188-205, 2005.
http://dx.doi.org/10.1287/trsc.1030.0079

M. Fischetti, J.J. Salazar, P. Toth. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45:378-394, 1997.
http://dx.doi.org/10.1287/opre.45.3.378

G. Ghiani, G. Improta. An efficient transformation of the generalized vehicle routing problem. European Journal of Operational Research 122, 11-17, 2000.
http://dx.doi.org/10.1016/S0377-2217(99)00073-9

G. Laporte, S. Chapleau, P.E. Landry and H. Mercure, An algorithm for the design of mail box collection routes in urban areas, Transportation Research B, Vol. 23, pp. 271-280, 1989.
http://dx.doi.org/10.1016/0191-2615(89)90029-5

G. Laporte, A. Asef-Vaziri and C. Sriskandarajah, Some applications of the generalized traveling salesman problem, Journal of Operational Research Society, Vol. 47, pp. 1461- 1467, 1996.
http://dx.doi.org/10.1057/jors.1996.190

C.M. Pintea, D. Dumitrescu and P.C. Pop,Combining heuristics and modifying local information to guide ant-based search, Carpathian Journal of Mathematics, Vol. 24, No. 1, pp. 94-103, 2008.

C-M. Pintea, C. Chira, D.Dumitrescu, Sensitive Ants: Inducing Diversity in the Colony, Nature Inspired Cooperative Strategies for Optimization NICSO 2008, Studies in Computational Intelligence, 236 (Krasnogor, N.; Meli�n-Batista, B.; Moreno-P�rez, J.A.; Moreno-Vega, J.M.; Pelta, D.; Eds.), Springer-Verlag, 15-24, 2009.

P.C.Pop, C.M.Pintea, I.Zelina, D.Dumitrescu. Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm, American Institute of Physics (AIP) Springer, Conference Proceedings: BICS 2008, Vol.1117, No.1, 157–162, 2009.
http://dx.doi.org/10.1063/1.3130618

P.C. Pop, Efficient Transformations of the Generalized Combinatorial Optimization Problems into Classical Variants, Proceedings of the 9-th Balkan Conference on Operational Research, Constanta, Romania, 2-6 September 2009.

P.C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, Vol. 25, No. 1, pp. 104-118, 2009.

http://www.iwr.uni-heidelberg.de/groups/comopt/software/ TSPLIB95/vrp/




DOI: https://doi.org/10.15837/ijccc.2011.4.2098



Copyright (c) 2017 Camelia-M. Pintea, Camelia Chira, Dan Dumitrescu

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.