TY - JOUR
T1 - An investigation into a new class of vehicle routing problem with backhauls
AU - Wade, Anne
AU - Salhi, Said
PY - 2002/12/1
Y1 - 2002/12/1
N2 - A new version of the vehicle routing problem with backhauls is presented. In this new problem backhauls are not restricted to be visited once all linehaul customers have been served, neither are backhaul customers fully mixed with linehaul customers. In this problem the user based on his or her experience, the vehicle capacity, the type of products and the type of vehicle used, can define the position along a route from which the first backhaul customer may be visited. An insertion-type heuristic is put forward for this class of problems. An analysis of the improvement in route cost obtained by allowing a relaxation in the restriction of the mix of linehaul and backhaul customers is reported. (C) 2002 Elsevier Science Ltd. All rights reserved.
AB - A new version of the vehicle routing problem with backhauls is presented. In this new problem backhauls are not restricted to be visited once all linehaul customers have been served, neither are backhaul customers fully mixed with linehaul customers. In this problem the user based on his or her experience, the vehicle capacity, the type of products and the type of vehicle used, can define the position along a route from which the first backhaul customer may be visited. An insertion-type heuristic is put forward for this class of problems. An analysis of the improvement in route cost obtained by allowing a relaxation in the restriction of the mix of linehaul and backhaul customers is reported. (C) 2002 Elsevier Science Ltd. All rights reserved.
UR - http://www.scopus.com/inward/record.url?scp=0036889131&partnerID=8YFLogxK
U2 - 10.1016/S0305-0483(02)00056-7
DO - 10.1016/S0305-0483(02)00056-7
M3 - Article
VL - 30
SP - 479
EP - 487
JO - Omega
JF - Omega
IS - (6)
ER -