Abstract

Thisworkwas supported by FEDER funding through the Programa Operacional Factores de Competitividade COMPETE and by national funding through the Portuguese Science and Technology Foundation (FCT) in the scope of the project PTDC/EGE-GES/11 6676/2010 (Ref. COMPETE:FCOMP-0-0124-FEDER-020430), by FCTwithin the projectscope:UID/CEC/00319/2013, and by FCT through the grant SFRH/BD/73584/ 2010 for Telmo Pinto (funded by QREN-POPH-Typology 4.1 cofundedbyMECNationalFundingandtheEuropeanSocial Fund), and by FEDER funds through the Competitiveness Factors Operational Programme - COMPETE.

Highlights

  • In the last decades, Pickup and Delivery Problems (PDP) deserved an important attention by the scientific community in the transportation field

  • The problems of the first class are usually denominated by Vehicle Routing Problems with Backhauls (VRPB) whereas the second class is denominated by Vehicle Routing Problem with Pickups and Deliveries

  • Since the order of visit is determined by the cluster in which a certain customer belongs, the authors named these problems as Vehicle Routing Problem with Clustered Backhauls (VRPCB)

Read more

Summary

INTRODUCTION

Pickup and Delivery Problems (PDP) deserved an important attention by the scientific community in the transportation field. An FME Transactions (2015) 43, 311-318 311 insertion-based heuristic evaluates the insertion of each backhaul customer in all route points where that customer can be feasibly inserted This insertion cost is obtained by the additional routing cost when inserting that customer in a given arc, and by adding the product of a penalty multiplier with the number of delivers after that insertion. The restriction percentage is defined by the user and it is based on his experience to define how backhaul and linehaul customers can appear mixed in a route This percentage value will be used when evaluating the insertion of a backhaul customer in a given arc. Additional local search procedures are applied, improving the quality of the solution while keeping it as strongly feasible

Loading and routing
Pickup and Delivery with loading
PROBLEM DESCRIPTION
INSERTION HEURISTIC FOR THE 2L-CVRPMB
Constructing routes for Linehaul customers
Feasibility of routes
Pseudocode
Obtained results
Findings
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call