An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing

S. Huijink, G. Kant, M.J.P. Peeters

Research output: Working paperDiscussion paperOther research output

381 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages30
Volume2014-062
Publication statusPublished - 7 Oct 2014

Publication series

NameCentER Discussion Paper
Volume2014-062

Fingerprint

Variable neighborhood search
Outsourcing
Vehicle routing problem
Costs
Common carrier
Trucks
Hiring
Heuristics

Keywords

  • routing
  • logistics
  • metaheuristics
  • pricing
  • variable neighbourhood search

Cite this

Huijink, S., Kant, G., & Peeters, M. J. P. (2014). An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing. (CentER Discussion Paper; Vol. 2014-062). Tilburg: Operations research.
@techreport{cf934dcb56ce4047b08ed0851c0e50fb,
title = "An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing",
abstract = "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.",
keywords = "routing, logistics, metaheuristics, pricing, variable neighbourhood search",
author = "S. Huijink and G. Kant and M.J.P. Peeters",
year = "2014",
month = "10",
day = "7",
language = "English",
volume = "2014-062",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Huijink, S, Kant, G & Peeters, MJP 2014 'An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing' CentER Discussion Paper, vol. 2014-062, Operations research, Tilburg.

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 paperDiscussion paperOther 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 -

Huijink S, Kant G, Peeters MJP. An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing. Tilburg: Operations research. 2014 Oct 7. (CentER Discussion Paper).