Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/21843
Title: An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls
Author: Pinto, Telmo
Alves, Cláudio
Carvalho, José Valério de
Moura, Ana
Keywords: Routing
Loading
Backhauls
Computational study
Heuristics
Issue Date: 2015
Publisher: Belgrade University
Abstract: In this paper, a capacitated vehicle routing problem with mixed linehauls and backhauls is presented. The addressed problem belongs to the subclass of pickup and delivery problems. Loading and sequencing constraints are also considered. These constraints arise in many real world situations, and can improve efficiency since backhaul customers do not need to be delayed in a route when it is possible to load their items without rearrengements. The suggested approach is based on an insertion heuristic presented in the literature but extended to tackle the explicit consideration of loading constraints. Different strategies are presented and tested. An exhaustive computational study is performed on instances adapted from benchmark instances for integrated routing and loading problems.
Peer review: yes
URI: http://hdl.handle.net/10773/21843
DOI: 10.5937/fmet1504311P
ISSN: 1451-2092
Appears in Collections:CIDMA - Artigos
DEGEIT - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
pinto_et_al.pdf553.21 kBAdobe PDF    Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.