Metaheuristic Approaches for Vehicle Routing Problems

Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and s...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of information systems and supply chain management Vol. 6; no. 2; pp. 17 - 32
Main Authors Saravanan, M, K.A.Sundararaman
Format Journal Article
LanguageEnglish
Published Hershey IGI Global 01.04.2013
Subjects
Online AccessGet full text
ISSN1935-5726
1935-5734
DOI10.4018/jisscm.2013040102

Cover

Abstract Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most researchers concentrate on using meta-heuristics for solving real-life problems. In this paper, heuristic methods based on Ant Colony Optimization and Simulated Annealing algorithms are developed and search strategies are investigated. Computational results are reported on randomly generated problems. These methods significantly improve in minimizing the total distances travelled by the vehicles.
AbstractList Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most researchers concentrate on using meta-heuristics for solving real-life problems. In this paper, heuristic methods based on Ant Colony Optimization and Simulated Annealing algorithms are developed and search strategies are investigated. Computational results are reported on randomly generated problems. These methods significantly improve in minimizing the total distances travelled by the vehicles.
Audience Academic
Author K.A.Sundararaman
Saravanan, M
AuthorAffiliation Department of Mechanical Engineering, RVS College of Engineering & Technology, Tamilnadu, India
AuthorAffiliation_xml – name: Department of Mechanical Engineering, RVS College of Engineering & Technology, Tamilnadu, India
Author_xml – sequence: 1
  givenname: M
  surname: Saravanan
  fullname: Saravanan, M
  organization: Department of Mechanical Engineering, RVS College of Engineering & Technology, Tamilnadu, India
– sequence: 2
  surname: K.A.Sundararaman
  fullname: K.A.Sundararaman
  organization: Department of Mechanical Engineering, RVS College of Engineering & Technology, Tamilnadu, India
BookMark eNp9kUuLFDEUhYPMgPPwB7grcKNgz-RRSSrLZhhHYWRE1G1IpW-q01RX2tzUwn9vpGQaxscmCeE7NyfnnJOTKU1AyEtGr1rKuutdRPT7K06ZoPWC8mfkjBkhV1KL9uTxzNVzco64o1QaI-gZkR-huC3MOWKJvlkfDjk5vwVsQsrNN9hGP0LzOc0lTkPzKad-hD1ektPgRoQXv_cL8vXd7Zeb96v7h7sPN-v7lW8NK6uNYl0A3WplRGDUhODkBnyQvBde9r3hfcd6rjwPjmnqJPiOKWhZ1ytplBQX5PUyt7r6PgMWu4_oYRzdBGlGy1phdJ1vREVfPUF3ac5TdWe5EfXjnZS8Um8XanAj2H7GOAHWBeOwLTi4GdGutaKSUi10xdmC-5wQMwR7yHHv8g_LqP2Vu11yt8fcq0Y_0fhYXIlpKtnF8b_KN4syDvHo_g_OHjahsnd_YR-LtMcibS3y348q8RPvFLCt
CitedBy_id crossref_primary_10_4018_IJISSCM_2019100101
Cites_doi 10.1016/j.ejor.2008.02.028
10.1007/3-540-46004-7_2
10.1016/S0305-0548(03)00158-8
10.1016/j.cie.2009.05.009
10.4018/jisss.2009070101
10.4018/jisss.2010093001
10.1016/j.aei.2004.07.001
10.4018/jisscm.2008070104
10.1504/IJAMS.2010.033566
10.1007/BF02023006
10.1504/IJAMS.2008.021101
10.1504/IJIDS.2010.031886
10.1504/IJDATS.2008.021115
10.1504/IJDATS.2010.030013
10.1007/BF02023004
10.1023/A:1018940026670
10.1504/IJIDS.2010.031887
10.1016/j.amc.2003.10.058
10.1109/4235.585892
10.1016/j.cor.2009.02.017
10.4018/jisscm.2010040104
10.1007/978-3-540-24652-7_8
10.1016/S0377-2217(97)00010-6
10.1016/S0305-0548(02)00051-5
10.1016/S0305-0548(98)00100-2
10.1016/S0377-2217(97)00172-0
10.1287/opre.12.4.568
10.1016/0305-0548(95)O0026-P
ContentType Journal Article
Copyright COPYRIGHT 2013 IGI Global
Copyright © 2013, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited.
Copyright_xml – notice: COPYRIGHT 2013 IGI Global
– notice: Copyright © 2013, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited.
DBID AAYXX
CITATION
N95
3V.
7SC
7WY
7WZ
7XB
87Z
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L6V
L7M
L~C
L~D
M0C
M7S
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
7TA
JG9
DOI 10.4018/jisscm.2013040102
DatabaseName CrossRef
Gale Business: Insights
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central (New) (NC LIVE)
Business Premium Collection
ProQuest Technology Collection (LUT)
ProQuest One
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database (Proquest)
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Engineering Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
Materials Business File
Materials Research Database
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Computer and Information Systems Abstracts Professional
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
Materials Research Database
Materials Business File
DatabaseTitleList Materials Research Database

ABI/INFORM Global (Corporate)
CrossRef
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Business
EISSN 1935-5734
EndPage 32
ExternalDocumentID A760500737
10_4018_jisscm_2013040102
heuristic_Approaches_for_10_4018_jisscm_20130401026
GeographicLocations India
GeographicLocations_xml – name: India
GroupedDBID 0R
4.4
AAOUZ
ABEPT
ADEKF
ALMA_UNASSIGNED_HOLDINGS
COVLG
EBS
EJD
H13
HZ
JRD
MV1
NEEBM
O9-
P2P
RIF
0R~
7WY
8FL
AAYVP
AAYXX
ABJCF
ABUWG
AFKRA
ARAPS
BAAKF
BENPR
BEZIV
BGLVJ
BLRFH
BTFVE
BYHXH
CBWLS
CCPQU
CDTDJ
CIGCI
CITATION
CKMBR
CNQXE
CTSEY
DWQXO
FRNLG
HCIFZ
HZ~
IAO
ITC
K7-
M0C
M7S
N95
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PTHSS
PUEGO
3V.
7SC
7XB
8FD
8FE
8FG
8FK
AZQEC
GNUQQ
JQ2
K60
K6~
L.-
L6V
L7M
L~C
L~D
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
Q9U
7TA
JG9
ID FETCH-LOGICAL-c491t-d618fe747693f109ffa5decf52b3c5bb92b81b26c2fa170a5ec816e418b659653
IEDL.DBID BENPR
ISSN 1935-5726
IngestDate Fri Sep 05 11:34:26 EDT 2025
Fri Jul 25 10:35:38 EDT 2025
Fri May 23 01:37:57 EDT 2025
Wed Oct 01 03:17:40 EDT 2025
Thu Apr 24 23:11:43 EDT 2025
Thu May 09 18:41:32 EDT 2019
Tue Jan 05 23:27:26 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c491t-d618fe747693f109ffa5decf52b3c5bb92b81b26c2fa170a5ec816e418b659653
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 2937268552
PQPubID 2045835
PageCount 16
ParticipantIDs crossref_citationtrail_10_4018_jisscm_2013040102
proquest_miscellaneous_1439774793
proquest_journals_2937268552
igi_journals_heuristic_Approaches_for_10_4018_jisscm_20130401026
gale_businessinsightsgauss_A760500737
crossref_primary_10_4018_jisscm_2013040102
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2013-04-01
PublicationDateYYYYMMDD 2013-04-01
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-04-01
  day: 01
PublicationDecade 2010
PublicationPlace Hershey
PublicationPlace_xml – name: Hershey
PublicationTitle International journal of information systems and supply chain management
PublicationYear 2013
Publisher IGI Global
Publisher_xml – name: IGI Global
References jisscm.2013040102-29
jisscm.2013040102-28
jisscm.2013040102-27
jisscm.2013040102-25
jisscm.2013040102-24
jisscm.2013040102-23
jisscm.2013040102-22
jisscm.2013040102-31
jisscm.2013040102-9
jisscm.2013040102-19
jisscm.2013040102-18
jisscm.2013040102-7
jisscm.2013040102-17
jisscm.2013040102-8
jisscm.2013040102-16
jisscm.2013040102-5
jisscm.2013040102-15
jisscm.2013040102-6
jisscm.2013040102-14
jisscm.2013040102-3
jisscm.2013040102-13
jisscm.2013040102-35
jisscm.2013040102-4
jisscm.2013040102-12
S. R.Thangiah (jisscm.2013040102-34) 1994
jisscm.2013040102-1
jisscm.2013040102-11
jisscm.2013040102-33
jisscm.2013040102-2
jisscm.2013040102-10
M.Saravanan (jisscm.2013040102-30) 2010; 2
jisscm.2013040102-32
jisscm.2013040102-20
jisscm.2013040102-0
W.Peng (jisscm.2013040102-26) 2005; 3611
S.Mazzeo (jisscm.2013040102-21) 2004; 18
References_xml – ident: jisscm.2013040102-32
– volume: 2
  start-page: 332
  issue: 3-4
  year: 2010
  ident: jisscm.2013040102-30
  article-title: Ant colony optimisation based heuristic for one-sided time constraint vehicle routing problem. International Journal of Services
  publication-title: Economics and Management
– ident: jisscm.2013040102-2
  doi: 10.1016/j.ejor.2008.02.028
– ident: jisscm.2013040102-28
– ident: jisscm.2013040102-9
  doi: 10.1007/3-540-46004-7_2
– ident: jisscm.2013040102-27
  doi: 10.1016/S0305-0548(03)00158-8
– ident: jisscm.2013040102-12
  doi: 10.1016/j.cie.2009.05.009
– ident: jisscm.2013040102-33
  doi: 10.4018/jisss.2009070101
– year: 1994
  ident: jisscm.2013040102-34
  publication-title: Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical Report, 27
– ident: jisscm.2013040102-18
  doi: 10.4018/jisss.2010093001
– volume: 18
  start-page: 181
  year: 2004
  ident: jisscm.2013040102-21
  article-title: An ant colony algorithm for the capacitated vehicle routing.
  publication-title: Discrete Mathematics
– ident: jisscm.2013040102-1
  doi: 10.1016/j.aei.2004.07.001
– ident: jisscm.2013040102-19
  doi: 10.4018/jisscm.2008070104
– volume: 3611
  start-page: 1229
  year: 2005
  ident: jisscm.2013040102-26
  article-title: Ant colony search algorithms for optimal packing problem. ICNC 2005
  publication-title: LNCS
– ident: jisscm.2013040102-4
– ident: jisscm.2013040102-23
  doi: 10.1504/IJAMS.2010.033566
– ident: jisscm.2013040102-15
– ident: jisscm.2013040102-31
  doi: 10.1007/BF02023006
– ident: jisscm.2013040102-6
  doi: 10.1504/IJAMS.2008.021101
– ident: jisscm.2013040102-16
  doi: 10.1504/IJIDS.2010.031886
– ident: jisscm.2013040102-35
  doi: 10.1504/IJDATS.2008.021115
– ident: jisscm.2013040102-8
  doi: 10.1504/IJDATS.2010.030013
– ident: jisscm.2013040102-24
  doi: 10.1007/BF02023004
– ident: jisscm.2013040102-5
  doi: 10.1023/A:1018940026670
– ident: jisscm.2013040102-20
  doi: 10.1504/IJIDS.2010.031887
– ident: jisscm.2013040102-25
  doi: 10.1016/j.amc.2003.10.058
– ident: jisscm.2013040102-11
  doi: 10.1109/4235.585892
– ident: jisscm.2013040102-13
  doi: 10.1016/j.cor.2009.02.017
– ident: jisscm.2013040102-17
  doi: 10.4018/jisscm.2010040104
– ident: jisscm.2013040102-10
  doi: 10.1007/978-3-540-24652-7_8
– ident: jisscm.2013040102-3
  doi: 10.1016/S0377-2217(97)00010-6
– ident: jisscm.2013040102-0
  doi: 10.1016/S0305-0548(02)00051-5
– ident: jisscm.2013040102-14
  doi: 10.1016/S0305-0548(98)00100-2
– ident: jisscm.2013040102-22
  doi: 10.1016/S0377-2217(97)00172-0
– ident: jisscm.2013040102-7
  doi: 10.1287/opre.12.4.568
– ident: jisscm.2013040102-29
  doi: 10.1016/0305-0548(95)O0026-P
SSID ssj0059930
Score 1.8723603
Snippet Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of...
SourceID proquest
gale
crossref
igi
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 17
SubjectTerms Algorithms
Ant colony optimization
Computer networks
Heuristic methods
Routing (telecommunications)
Searching
Simulated annealing
Supply chains
Vehicle routing
Vehicles
Title Metaheuristic Approaches for Vehicle Routing Problems
URI http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jisscm.2013040102
https://www.proquest.com/docview/2937268552
https://www.proquest.com/docview/1439774793
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ProQuest Central (New) (NC LIVE)
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1935-5734
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0059930
  issn: 1935-5726
  databaseCode: BENPR
  dateStart: 20080101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3PT9swFH6irYS4oI2BCDCUTeMyKSJxYic-TFuZKNUkKoQG4mbZjk2LUFtI-__znDitEIJLLrGd5LPzfvg9vw_gB6pYmktdRoxpdFCUtZGqQ4icS7THSSJrSpbLERveZP_u6N0GjNqzMC6tspWJtaAuZ9rtkZ-iWsoJKyglv-dPkWONctHVlkJDemqF8lddYqwDPeIqY3Whd3Y-urpuZTNFbRw3cWYaURyviXOij1GcPuCHanc2HaV65iqtvdJUXl53JveTN1K7VkWDT7Dtbciw30z6Z9gw0x3YbFPYvwC9NAs5NsumCHPY92XDTRWihRremrHrFrpcINRb4VVDKVPtws3g_P_fYeTpESKd8WQRlSwprEF3gPHUJjG3VtLSaEuJSjVVihOFNilhmliZ5LGkRhcJM1lSKEY5o-kedKezqdmHkGtU5VrHeS5tFuuSq4wXaUaU5nmZyjyAuIVCaF873FFYPAr0IRx6okFPrNEL4Oeqy7wpnPFR4xOHr_DEm3ip3NZEdS-XVSX6OfpcLqSI7_EHJ0D436wSKyjFGkqBUL7_JBbA91dDvGkh5qUN4Kid4nXL9QoM4NvqNv6NLsQip2a2rNCRqg1qFHoHHw9xCFukJtZwOUBH0F08L81XNG8W6hg6xeDi2K_cF4WX-HM
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT9wwEB1RkNpeqn6qKdCmVblUikgc24kPiG5b0FLYFaqg4mZsxwYqtLslu0L9c_1tHSfOrhAqNy65xHai548347HnAXxEimWFMlXCuUEHRTuX6CaEKIRCe5xkqpFkGQx5_5h-P2EnS_C3uwvjj1V2a2KzUFdj4_fIN5GWCsJLxsj25HfiVaN8dLWT0FBBWqHaalKMhYsd-_bPNbpw9dbeN-zvDUJ2d46-9pOgMpAYKrJpUvGsdBatai5yl6XCOcUqaxwjOjdMa0E0mnaEG-JUVqSKWVNm3NKs1JwJ7lUjkAJWaE4FOn8rX3aGhz86LmDI_mkb12YJw_9v46ro05SbvxBY4-_CI4tQn9ntBjMGfnhwcXZxiyUa6tt9Ck-CzRr32kH2DJbs6Dk87I7MvwA2sFN1bmdt0ue4F9KU2zpGizj-ac99tdifPUKejA9bCZv6JRzfC1CvYHk0HtnXEAuDpoMxaVEoR1NTCU1FmVOijSiqXBURpB0U0oRc5V4y41Kiz-LRky16coFeBJ_mVSZtoo67Cm94fGUQ-sRH7bdC6jM1q2vZK9DH8yFM_I_P2AEyTOtazqGUCyglQvn_L_EIPtxo4lYJOalcBGtdFy9KLkZ8BO_nr3H2-5COGtnxrEbHrTHgcZF9c3cT7-BR_2hwIA_2hvur8Jg0oh7-_NEaLE-vZnYdTaupfhvGbwyn9z1l_gG5MzTY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Metaheuristic+Approaches+for+Vehicle+Routing+Problems&rft.jtitle=International+journal+of+information+systems+and+supply+chain+management&rft.au=Saravanan%2C+M&rft.au=.A.Sundararaman&rft.date=2013-04-01&rft.issn=1935-5726&rft.volume=6&rft.issue=2&rft.spage=17&rft.epage=32&rft_id=info:doi/10.4018%2Fjisscm.2013040102&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1935-5726&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1935-5726&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1935-5726&client=summon