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>>
Y. Nagao and H. Nagamochi, “A DP-Based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem,” Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol. 1, No. 2, 2007, pp. 217-226. doi:10.1299/jamdsm.1.217
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:
A Genetic Algorithm for the Split Delivery Vehicle Routing Problem
Joseph Hubert Wilck IV, Tom M. Cavalier
DOI: 10.4236/ajor.2012.22024 7,631 Downloads 13,964 Views Citations
Pub. Date: June 20, 2012
A Heuristic Algorithm for Vehicle Routing Problems with Simultaneous Pick-Up and Delivery and Hard Time Windows
Suna Cetin, Cevriye Gencer
DOI: 10.4236/jss.2015.33008 3,606 Downloads 4,799 Views Citations
Pub. Date: March 18, 2015
Multi-Phase Meta-Heuristic for Multi-Depots Vehicle Routing Problem
Jianping Luo, Xia Li, Min-Rong Chen
DOI: 10.4236/jsea.2013.63B018 3,643 Downloads 5,148 Views Citations
Pub. Date: April 11, 2013
Mathematical Modelling for a Multi-Product Inventory Routing Problem with Split Delivery
Yuling Yeh, Chinyao Low
DOI: 10.4236/jamp.2017.59132 624 Downloads 1,070 Views Citations
Pub. Date: September 15, 2017
An Alternative Algorithm for Vehicle Routing Problem with Time Windows for Daily Deliveries
Nor Edayu Abdul Ghani, S. Sarifah Radiah Shariff, Siti Meriam Zahari
DOI: 10.4236/apm.2016.65025 1,997 Downloads 3,324 Views Citations
Pub. Date: April 22, 2016
