Abstract
| Original language | English |
|---|---|
| Place of Publication | Tilburg |
| Publisher | Operations research |
| Number of pages | 30 |
| Volume | 2014-062 |
| Publication status | Published - 7 Oct 2014 |
Publication series
| Name | CentER Discussion Paper |
|---|---|
| Volume | 2014-062 |
Fingerprint
Keywords
- routing
- logistics
- metaheuristics
- pricing
- variable neighbourhood search
Cite this
}
An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing. / Huijink, S.; Kant, G.; Peeters, M.J.P.
Tilburg : Operations research, 2014. (CentER Discussion Paper; Vol. 2014-062).Research output: Working paper › Discussion paper › Other research output
TY - UNPB
T1 - An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing
AU - Huijink, S.
AU - Kant, G.
AU - Peeters, M.J.P.
PY - 2014/10/7
Y1 - 2014/10/7
N2 - In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier. In this variant of the Vehicle Routing Problem, orders are either delivered by an outside carrier, the common carrier, which receives an order specific price for this or by the own fleet, the private fleet, such that the total costs, which is the sum of the outside carrier costs and the delivery costs of the own fleet, is minimized. This paper presents two Adaptable Variable Neighborhood Search heuristics which are highly competitive and several new test instances which are based upon efficiency instead of necessity.
AB - In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier. In this variant of the Vehicle Routing Problem, orders are either delivered by an outside carrier, the common carrier, which receives an order specific price for this or by the own fleet, the private fleet, such that the total costs, which is the sum of the outside carrier costs and the delivery costs of the own fleet, is minimized. This paper presents two Adaptable Variable Neighborhood Search heuristics which are highly competitive and several new test instances which are based upon efficiency instead of necessity.
KW - routing
KW - logistics
KW - metaheuristics
KW - pricing
KW - variable neighbourhood search
M3 - Discussion paper
VL - 2014-062
T3 - CentER Discussion Paper
BT - An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing
PB - Operations research
CY - Tilburg
ER -