An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickupand Delivery
Publish place: Journal of Advances in Computer Research، Vol: 3، Issue: 4
Publish Year: 1391
نوع سند: مقاله ژورنالی
زبان: English
View: 420
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACR-3-4_006
تاریخ نمایه سازی: 16 شهریور 1395
Abstract:
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD)is a well-known combinatorial optimization problem which addresses providedservice to a set of customers using a homogeneous fleet of capacitated vehicles. Theobjective is to minimize the distance traveled. The VRPSPD is an NP-hardcombinatorial optimization problem. Therefore, practical large-scale instances ofVRPSPD cannot be solved by exact solution methodologies within acceptablecomputational time. Our interest was therefore focused on meta-heuristic solutionapproaches. For this reason, a modified tabu search (PA) is proposed for solvingthe VRPSPD in this paper. tComputational results on several standard instances ofVRPSPD show the efficiency of the PA compared with other meta-heuristicalgorithms.
Keywords:
Authors
Majid Yousefkhoshbakht
Mathematics and Computer Science, Young Researchers club, Hamedan Branch, Islamic Azad University, Hamedan, Iran
Farzad Didehvar
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
Farhad Rahmati
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran