A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
Main Article Content
Abstract
The directing of an armada of vehicles to benefit an arrangement of clients is imperative in the field of merchandise dispersion. Vehicle directing issue with time windows (VRPTW) is a notable combinatorial issue. This article goes for concentrate the vehicle steering issue with time windows and target time (VRPTWTT). VRPTWTT includes the directing of an arrangement of vehicles with restricted limit from a focal station to an arrangement of topographically scattered clients with referred to requests and predefined time windows and also an objective time. There are punishments related with adjusting either before or later than this objective overhauling time. The objective is to limit the expenses of transport and punishments of deferral and early, we introduce a portrayal of the half and half strategy took after by computational outcomes and the conclusion.
Â
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
Z.J. Czech and P. Czarns,“A parallel simulated annealing for the vehicle routing problem with time windowsâ€. In 10th Euromicro Workshop on Parallel, Distrbuted and Workshop on parallel, Distributed and Network-based Processing, pp. 376-383, 2002.
G.B.Dantzig, D.R. Fulkerson and M.Johnson, “Solution of a large-scale traveling-salesman problemâ€. Operations Research, vol.2, pp. 393-410,
G.B.Dantzig, J.H. Ramser,“The truck dispatching problemâ€. Management Science, 6, pp. 80-91, 1959.
G. Bencheikh, J. Boukachour, and A. El HilaliAlaoui. “Improved Ant Colony Algorithm to solve the aircraft landing problemâ€. International Journal of Computer Theory and Engineering,vol.3,no.2,pp.
G. Bencheikh, J. Boukachour, A. El HilaliAlaoui, and F. El Khoukhi. “Hybrid method for aircraft landing scheduling based on a Job Shop formulationâ€. International Journal of Computer Science and Network Security, vol. 9, no. 8, 2009.
L.M.Gambardella, E. Taillardand G. AGAZZI, “New ideas in Optimization, chapitre MACSVRPTW: A Multiple Ant Colony for vehicle routing problem with time windowsâ€. pp. 63- 76. McGrawHill, 1999.
J. Homberger and H.Gehring, “Two evolutionary meta-heuristics for the vehicle routing problem with time windowsâ€. INFOR, vol.37, pp.297-318, 1999.
P. Toth, D. Vigo, “The vehicle routing problemâ€.
SIAM monographs on discrete mathematics and applications. Vol. 9. Philadelphia: SIAM, 2002.
A. El Bouzekri, A. A.El Hilali,“Evolutionary
Algorithm for the Bi-Objective Green Vehicle
Routing Problemâ€. International journal of Scientific& Engineering Research,Volume 5, Issue 9, September 2014.
A. El Bouzekri, E. Messaoud, A.A. El Hilali,“A hybrid ant colony system for green capacitated vehicle routing problem in sustainable transportâ€, Journal of Theoretical and Applied Information Technology. Vol. 54 No.2. August 2013.
A. Mahdieh, Y.J.C.Josep and W,RWill.“Selective vehicle routing problems under uncertaintywihout recourseâ€. Transportation Research Part E: Logistics and Transportation Review. Volume 62, February
, Pages 68–88.
B. Ghizlane, J. Boukachour, A.A.Elhilali“A memetic algorithm to solve the dynamic multiple runway aircraft landing problemâ€. Journal of King Saud University – Computer and informationSciences.Volume 28, Issue 1, January
, Pages 98–109.
Dorigo M.: Optimization, learning and natural algorithms, Unpublished Doctoral Dissertation Politecnico di Milano, DipartimentodiElettronica, Italy (1992).
R. Abounacer, J. Boukachour, B. Dkhissi and A.A. El Hilali. “A hybrid Ant Colony Algorithm for the examen timetabling problemâ€.Revue Africaine de la Recherche en informatique et Mathématiques Appliquées( ARIMA), vol. 12, pp. 15-42, 2010.
M. M.Solomon,“Algorithms for the vehicle routing and scheduling problems with time window constraintsâ€. Operations Research,35/2, 254–265,
J. Berger M. Barkaoui,“A Parallel hybrid genetic algorithm for the vehicle routing problem with time windowsâ€. Computers and Operations Research, vol.31, pp. 2037-2053, 2004.
B. Bullnheimer, R.F. Hartl and C. Strauss. “An improved ant system algorithm for the vehicle routing problemâ€.Annals of Operations Research, 89,
– 328, 1999.
W.C. Chiang and R.A. Rurssel,“A reactive tabu search metaheuristic for the vehicle routing problems with time windowsâ€. INFORMS journal on computing, vol.9, pp. 417-430, 1997.
Rousseau, L.M, Gendreau, M. Pesant, G. “Using constraint-based operators to solve the vehicle routing problem with time windowsâ€. Journal of Heuristics, vol.8, pp.43-58, 2002.
R. Baldacci, E. Bartolini, A. Mingozzi,“An Exact
Algorithm for the Pickup and Delivery Problem with
Time Windowsâ€. Operations Research, 59/2, 414–
http://doi.org/10.1287/opre.1100.0881.
S. Ceschia, L.Gasperoand A.Schaerf, “Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costsâ€. Journal of Scheduling,14/6, 601–615. http://doi.org/10.1007/s10951-010-0213-x.