The Roots of Logistics 2012
DOI: 10.1007/978-3-642-27922-5_18
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
226
0
11

Year Published

2012
2012
2013
2013

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 171 publications
(237 citation statements)
references
References 1 publication
0
226
0
11
Order By: Relevance
“…Chen et al (2007) considered an improvement step by reassigning the transportation demands serviced by vehicles in an initial unsplit solution, which is formulated as an MIP-formulation. In their approach, an initial unsplit solution is obtained by the Clarke-Wright method (Clarke and Wright, 1964). Then, they applied commercial IP-code for a predetermined time and applied a heuristic, called record-and-record developed by Li et al (2005).…”
Section: Split Delivery Vehicle Routing Problemmentioning
confidence: 99%
“…Chen et al (2007) considered an improvement step by reassigning the transportation demands serviced by vehicles in an initial unsplit solution, which is formulated as an MIP-formulation. In their approach, an initial unsplit solution is obtained by the Clarke-Wright method (Clarke and Wright, 1964). Then, they applied commercial IP-code for a predetermined time and applied a heuristic, called record-and-record developed by Li et al (2005).…”
Section: Split Delivery Vehicle Routing Problemmentioning
confidence: 99%
“…For this purpose we use the parallel savings heuristic of Clarke and Wright (1964). At each iteration of the SA heuristic we randomly choose one of the local improvement heuristics to generate a new feasible solution from the current solution.…”
Section: Model Formulation and Solution Methodologymentioning
confidence: 99%
“…The second procedure is a modified and accelerated version of the classical Clarke and Wright parallel savings algorithm [7]. According to this procedure, from an initial solution consisting of n return trips to each client, the best available saving, computed as s ij = c 0i + c 0j -λ c ij , is used to merge the single routes (0,i,0) and (0,j,0) into a new route (0,i,j,0) and the procedure is repeated until no merge is feasible, in terms of vehicle capacity, or there are no more available savings.…”
Section: Creating a Populationmentioning
confidence: 99%
“…Finally, we have also implemented a sequential version of Clarke and Wright savings algorithm [7] in which routes are generated one after the other. Thus, the procedure has always just one active route which grows by adding new clients either to the first serviced client or to the last one (the two "endpoints" of the route).…”
Section: Creating a Populationmentioning
confidence: 99%
See 1 more Smart Citation