Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
R. E. Aleman and R. R. Hill, “A Tabu Search with Vocabulary Building Approach for the Vehicle Routing Problem with Split Demands,” International Journal of Metaheuristics, Vol. 1, No. 1, 2010, pp. 55-80. doi:10.1504/IJMHEUR.2010.033123
has been cited by the following article:
TITLE: A New Approach to the Optimization of the CVRP through Genetic Algorithms
AUTHORS: Mariano Frutos, Fernando Tohmé
KEYWORDS: Vehicle Routing Problem; Genetic Algorithms; Modeling; Optimization
JOURNAL NAME: American Journal of Operations Research, Vol.2 No.4, November 30, 2012
ABSTRACT: This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.
Related Articles:
Interpretivist Entrepreneurial Research on Indian Millennial: An R/R-QDA Based Approach
Surjit Kumar Kar, Saroj Kanta Biswal
DOI: 10.4236/tel.2019.96139 318 Downloads 984 Views Citations
Pub. Date: August 30, 2019
A Construction Heuristic for the Split Delivery Vehicle Routing Problem
Joseph Hubert Wilck IV, Tom M. Cavalier
DOI: 10.4236/ajor.2012.22018 6,629 Downloads 12,253 Views Citations
Pub. Date: June 20, 2012
A Genetic Algorithm for the Split Delivery Vehicle Routing Problem
DOI: 10.4236/ajor.2012.22024 7,637 Downloads 13,973 Views Citations
Reverse Building of Complete (k,r)-Arcs in PG(2,q)
Mina Ghareeb Faraj, Nada Yassen Kasm
DOI: 10.4236/oalib.1105900 96 Downloads 235 Views Citations
Pub. Date: December 23, 2019
Branches of solutions for an asymptotically linear elliptic problem on RN
Youyan Wan
DOI: 10.4236/ojapps.2012.24B043 3,223 Downloads 4,105 Views Citations
Pub. Date: January 16, 2013
