|
|
|
|
| LEADER |
01157 am a22001573u 4500 |
| 001 |
360035 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Erdogan, G.
|e author
|
| 700 |
1 |
0 |
|a McLeod, F.N.
|e author
|
| 700 |
1 |
0 |
|a Cherrett, T.J.
|e author
|
| 700 |
1 |
0 |
|a Bektas, T.
|e author
|
| 245 |
0 |
0 |
|a Matheuristics for solving a multi-attribute collection problem for a charity organisation
|
| 260 |
|
|
|c 2013-12-18.
|
| 856 |
|
|
|z Get fulltext
|u https://eprints.soton.ac.uk/360035/1/jors_MPCVRP_v8.pdf
|
| 520 |
|
|
|a 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.
|
| 655 |
7 |
|
|a Article
|
