Rodney, Demane, Soper, Alan ORCID: https://orcid.org/0000-0002-0901-9803 and Walshaw, Christopher ORCID: https://orcid.org/0000-0003-0253-7779 (2005) Multilevel refinement for the vehicle routing problem. Proceedings of PlanSIG 2005, 24th Annual Workshop of UK Planning & Scheduling Special Interest Group. pp. 96-97. ISSN 1368 5708

Full text not available from this repository.

Abstract

Multilevel approaches to computational problems are pervasive across many areas of applied mathematics and scientific computing. The multilevel paradigm uses recursive coarsening to create a hierarchy of approximations to the original problem, then an initial solution is found for the coarsest problem and iteratively refined and improved at each level, coarsest to finest. The solution process is aided by the global perspective (or `global view') imparted to the optimisation by the coarsening. This paper looks at their application to the Vehicle Routing Problem.

Item Type:	Article
Uncontrolled Keywords:	vehicle routing, transportation,
Subjects:	Q Science > QA Mathematics
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Computer & Computational Science Research Group School of Computing & Mathematical Sciences > Department of Computer Science School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Related URLs:	Organisation Organisation
Last Modified:	30 Sep 2019 13:47
URI:	http://gala.gre.ac.uk/id/eprint/898

Actions (login required)

View Item