AN IMPERIALIST COMPETITIVE ALGORITHM AND A MIXED INTEGER PROGRAMMING FORMULATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

YOUSEFI KHOSHBAKHT M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2017 | Volume:3 | Issue:9 Page(s): 53-69

Download Full-Text

Persian Verion

View:

904

Download:

Cites:

Information Journal Paper

Title

AN IMPERIALIST COMPETITIVE ALGORITHM AND A MIXED INTEGER PROGRAMMING FORMULATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

Author(s)

YOUSEFI KHOSHBAKHT M. | Issue Writer Certificate

Keywords

IMPERIALIST COMPETITIVE ALGORITHMQ1

NP-COMPLETEQ1

VEHICLE ROUTING PROBLEMQ1

Abstract

The VEHICLE ROUTING PROBLEM (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and total distance traversed. This paper presents an application of IMPERIALIST COMPETITIVE ALGORITHM (ICA)) in VRP. Unlike other evolutionary optimization algorithms, ICA is inspired from a socio political process, the competition among imperialists and colonies. Comparison between this method and famous meta-heuristic algorithms shows the effectiveness of the proposed approach.Computational experience with two groups of instances involving from 50 to 200 confirms that proposed algorithm is competitive in compared to the famous meta-heuristic algorithms in terms of the quality of generated solutions. In addition, this algorithm finds closely the best known solutions (BKS) for most of the instances.

Cites

No record.

References

No record.

Cite

APA: Copy

YOUSEFI KHOSHBAKHT, M.. (2017). AN IMPERIALIST COMPETITIVE ALGORITHM AND A MIXED INTEGER PROGRAMMING FORMULATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 3(9), 53-69. SID. https://sid.ir/paper/257223/en

Vancouver: Copy

YOUSEFI KHOSHBAKHT M.. AN IMPERIALIST COMPETITIVE ALGORITHM AND A MIXED INTEGER PROGRAMMING FORMULATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2017;3(9):53-69. Available from: https://sid.ir/paper/257223/en

IEEE: Copy

M. YOUSEFI KHOSHBAKHT, “AN IMPERIALIST COMPETITIVE ALGORITHM AND A MIXED INTEGER PROGRAMMING FORMULATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 3, no. 9, pp. 53–69, 2017, [Online]. Available: https://sid.ir/paper/257223/en

Related Journal Papers