Matheuristics for solving a multi-attribute collection problem for a charity organisation
Matheuristics for solving a multi-attribute collection problem for a charity organisation
This paper studies a multi-attribute profit collecting vehicle routing problem, which arises in the collection operations of a charity organisation in the UK. The problem involves a heterogeneous fleet consisting of vehicles of different capacities, mandatory visits to a subset of vertices, time windows, rest requirements associated with maxi- mum driving and working times, and partial collection. A mixed integer programming formulation of the problem is provided, along with three matheuristics based on Tabu Search and Large Neighbourhood Search. Computational results on instances derived from a case study are presented, as well as the results of the real-world implementation.
vehicle routeing, heuristics, integer programming, matheuristics
177-190
Erdogan, G.
8f23f573-90f0-4c1c-b762-49a551acd987
McLeod, F.N.
93da13ec-7f81-470f-8a01-9339e80abe98
Cherrett, T.J.
e5929951-e97c-4720-96a8-3e586f2d5f95
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
18 December 2013
Erdogan, G.
8f23f573-90f0-4c1c-b762-49a551acd987
McLeod, F.N.
93da13ec-7f81-470f-8a01-9339e80abe98
Cherrett, T.J.
e5929951-e97c-4720-96a8-3e586f2d5f95
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Erdogan, G., McLeod, F.N., Cherrett, T.J. and Bektas, T.
(2013)
Matheuristics for solving a multi-attribute collection problem for a charity organisation.
Journal of the Operational Research Society, 66 (2), .
(doi:10.1057/jors.2013.172).
Abstract
This paper studies a multi-attribute profit collecting vehicle routing problem, which arises in the collection operations of a charity organisation in the UK. The problem involves a heterogeneous fleet consisting of vehicles of different capacities, mandatory visits to a subset of vertices, time windows, rest requirements associated with maxi- mum driving and working times, and partial collection. A mixed integer programming formulation of the problem is provided, along with three matheuristics based on Tabu Search and Large Neighbourhood Search. Computational results on instances derived from a case study are presented, as well as the results of the real-world implementation.
Text
jors_MPCVRP_v8.pdf
- Author's Original
More information
Published date: 18 December 2013
Keywords:
vehicle routeing, heuristics, integer programming, matheuristics
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 360035
URI: http://eprints.soton.ac.uk/id/eprint/360035
ISSN: 0160-5682
PURE UUID: 0f9f5d88-fef5-4a67-a1c4-b1aa368f7334
Catalogue record
Date deposited: 22 Nov 2013 13:18
Last modified: 15 Mar 2024 02:48
Export record
Altmetrics
Contributors
Author:
G. Erdogan
Author:
T. Bektas
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics