AN EFFICIENT GENETIC ALGORITHM FOR A VEHICLE ROUTING PROBLEM CONSIDERING THE COMPETENCY OF WORKING TEAMS

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.

KIANI M.; SEIDGAR H.; MAHDAVI I.; TAVAKKOLI MOGHADDAM R.

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

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2016 | Volume:49 | Issue:2 Page(s): 257-271

Download Full-Text

Persian Verion

View:

873

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT GENETIC ALGORITHM FOR A VEHICLE ROUTING PROBLEM CONSIDERING THE COMPETENCY OF WORKING TEAMS

Author(s)

KIANI M. | SEIDGAR H. | MAHDAVI I. | TAVAKKOLI MOGHADDAM R. | Issue Writer Certificate

Keywords

GENETIC ALGORITHMQ1

MANPOWERQ2

PARTICLE SWARM OPTIMIZATIONQ1

VEHICLE ROUTING PROBLEMQ1

WORKING TEAMQ1

Abstract

This paper presents a new mathematical model for a combined MANPOWER VEHICLE ROUTING PROBLEM, in which WORKING TEAMs are considered as servers. Having teams with different competency affects the service duration and cost that expands the flexibility of scheduling. A fleet of vehicles with different speed and cost of movement is used to transport these teams to visit the customers before the due date. The goal is to find an efficient schedule for the teams and vehicles movement to serve all the customers in order to minimize the total cost of serving, routing and lateness penalties. A mixed-integer programming model is presented and a number of tests problems are generated. To solve the large-sized problems, two meta-heuristics approaches, namely GENETIC ALGORITHM (GA) and PARTICLE SWARM OPTIMIZATION (PSO) are developed, and then the Taguchi experimental design method is applied to set the proper values of the parameters. The obtained results show the higher performance of the proposed GA compared with PSO in terms of solutions quality within comparatively shorter periods of time.

Cites

No record.

References

No record.

Cite

APA: Copy

KIANI, M., SEIDGAR, H., MAHDAVI, I., & TAVAKKOLI MOGHADDAM, R.. (2016). AN EFFICIENT GENETIC ALGORITHM FOR A VEHICLE ROUTING PROBLEM CONSIDERING THE COMPETENCY OF WORKING TEAMS. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 49(2), 257-271. SID. https://sid.ir/paper/166491/en

Vancouver: Copy

KIANI M., SEIDGAR H., MAHDAVI I., TAVAKKOLI MOGHADDAM R.. AN EFFICIENT GENETIC ALGORITHM FOR A VEHICLE ROUTING PROBLEM CONSIDERING THE COMPETENCY OF WORKING TEAMS. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2016;49(2):257-271. Available from: https://sid.ir/paper/166491/en

IEEE: Copy

M. KIANI, H. SEIDGAR, I. MAHDAVI, and R. TAVAKKOLI MOGHADDAM, “AN EFFICIENT GENETIC ALGORITHM FOR A VEHICLE ROUTING PROBLEM CONSIDERING THE COMPETENCY OF WORKING TEAMS,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 49, no. 2, pp. 257–271, 2016, [Online]. Available: https://sid.ir/paper/166491/en

Related Journal Papers