Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/53068

TitleAn insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls
Author(s)Pinto, Telmo
Alves, Cláudio
Carvalho, José Valério de
Moura, Ana
KeywordsRouting
Loading
Backhauls
Heuristics
Computational study
Issue date2015
PublisherUniversity of Belgrade. Faculty of Mechanical Engineering
JournalFME Transactions
Abstract(s)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 realworld 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.
TypeArticle
URIhttp://hdl.handle.net/1822/53068
DOI10.5937/fmet1504311P
ISSN1451-2092
Peer-Reviewedyes
AccessRestricted access (Author)
Appears in Collections:CAlg - Artigos em revistas internacionais/Papers in international journals

Files in This Item:
File Description SizeFormat 
Insertion heur. for 2l-cvrp with mixed lineh. and backh..pdf
  Restricted access
553,21 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID