File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
 Publisher Website: 10.1201/9780203489802
 Scopus: eid_2s2.077957316972
Supplementary

Citations:
 Scopus: 0
 Appears in Collections:
Book Chapter: A composite verylargescale neighborhood search algorithm for the vehicle routing problem
Title  A composite verylargescale neighborhood search algorithm for the vehicle routing problem 

Authors  
Issue Date  2004 
Publisher  Chapman & Hall/CRC. 
Citation  A composite verylargescale neighborhood search algorithm for the vehicle routing problem. In Leung, JY (Ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis, p. 4914924. Boca Raton: Chapman & Hall/CRC, 2004 How to Cite? 
Abstract  The classical vehicle routing problem (VRP) is defined on an undirected graph G = (N, E), where N = {0, 1,…, n} is a node set and E = {(i, j): i, j ∈ N} is an edge set. For simplicity (i, j) and (j, i) represent the same edge. Node 0 corresponds to a depot at which are based m identical vehicles of capacity C, while the remaining nodes are customers. Each customer i has a nonnegative demand qi. With each edge (i, j) is associated a cost ci j corresponding to a distance or to a travel time. The VRP consists of determining vehicle routes of minimum total cost satisfying the following constraints: 1. Each route starts and ends at the depot. 2. Each customer belongs to exactly one route. 3. The total customer demand of any route does not exceed C. 4. The total cost of any route does not exceed a preset limit D. 
Persistent Identifier  http://hdl.handle.net/10722/296066 
ISBN  
Series/Report no.  Chapman & Hall/CRC Computer and Information Science Series 
DC Field  Value  Language 

dc.contributor.author  Agarwal, Richa   
dc.contributor.author  Ahuja, Ravindra K.   
dc.contributor.author  Laporte, Gilbert   
dc.contributor.author  Shen, Zuo Jun Max   
dc.date.accessioned  20210211T04:52:46Z   
dc.date.available  20210211T04:52:46Z   
dc.date.issued  2004   
dc.identifier.citation  A composite verylargescale neighborhood search algorithm for the vehicle routing problem. In Leung, JY (Ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis, p. 4914924. Boca Raton: Chapman & Hall/CRC, 2004   
dc.identifier.isbn  9781584883975   
dc.identifier.uri  http://hdl.handle.net/10722/296066   
dc.description.abstract  The classical vehicle routing problem (VRP) is defined on an undirected graph G = (N, E), where N = {0, 1,…, n} is a node set and E = {(i, j): i, j ∈ N} is an edge set. For simplicity (i, j) and (j, i) represent the same edge. Node 0 corresponds to a depot at which are based m identical vehicles of capacity C, while the remaining nodes are customers. Each customer i has a nonnegative demand qi. With each edge (i, j) is associated a cost ci j corresponding to a distance or to a travel time. The VRP consists of determining vehicle routes of minimum total cost satisfying the following constraints: 1. Each route starts and ends at the depot. 2. Each customer belongs to exactly one route. 3. The total customer demand of any route does not exceed C. 4. The total cost of any route does not exceed a preset limit D.   
dc.language  eng   
dc.publisher  Chapman & Hall/CRC.   
dc.relation.ispartof  Handbook of Scheduling: Algorithms, Models, and Performance Analysis   
dc.relation.ispartofseries  Chapman & Hall/CRC Computer and Information Science Series   
dc.title  A composite verylargescale neighborhood search algorithm for the vehicle routing problem   
dc.type  Book_Chapter   
dc.description.nature  link_to_subscribed_fulltext   
dc.identifier.scopus  eid_2s2.077957316972   
dc.identifier.spage  491   
dc.identifier.epage  4924   
dc.publisher.place  Boca Raton   
dc.identifier.partofdoi  10.1201/9780203489802   