Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs

Metaheuristic algorithms, such as simulated annealing and tabu search, are popular solution techniques for vehicle routing problems (VRPs). These approaches rely on iterative improvements to a starting solution, involving slight alterations to the routes (ie, neighbourhood moves), moving a node to a...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Journal of the Operational Research Society Ročník 64; číslo 1; s. 34 - 47
Hlavní autori: Harwood, K, Mumford, C, Eglese, R
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Taylor & Francis 01.01.2013
Palgrave Macmillan
Palgrave Macmillan UK
Taylor & Francis Ltd
Predmet:
2-Opt
Accuracy
Algorithms
Business and Management
congestion
Costs
Customers
Estimate reliability
Estimation methods
General Paper
General Papers
Heuristic
Heuristics
Management
Meta-analysis
Neighborhoods
Operations research
Operations Research/Decision Theory
Quadrants
Road Timetable
Routing
Run time
Speed
Studies
time varying
Traffic congestion
Travel time
vehicle routing
Vehicles
congestion
vehicle routing
time varying
2-Opt
Road Timetable
ISSN:0160-5682, 1476-9360
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Metaheuristic algorithms, such as simulated annealing and tabu search, are popular solution techniques for vehicle routing problems (VRPs). These approaches rely on iterative improvements to a starting solution, involving slight alterations to the routes (ie, neighbourhood moves), moving a node to a different part of a solution, swapping nodes or inverting sections of a tour, for example. When working with standard VRPs, where the costs of the arcs do not vary with advancing time, evaluating changes to the total cost following a neighbourhood move is a simple process: simply subtract the cost of the links removed from the solution and add the costs for the new links. When a time-varying aspect (eg, congestion) is included in the costs, these calculations become estimations rather than exact values. This paper focuses on a single vehicle routing problem, similar to the Travelling Salesman Problem, and investigates the potential for using estimation methods on simple models with time-variant costs, mimicking the effects of road congestion.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.2012.17