Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

Liu, Ran; Jiang, Zhibin; Fung, Richard Y. K.; Chen, Feng; Liu, Xiao

doi:10.1016/j.cor.2009.08.002

Cited by 78 publications

(45 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Included among the most significant extensions are the following: the Multi-Depot Capacitated Arc Routing Problem with Full Truckloads (Liu et al 2010); the Multi-Depot Split Delivery VRP (Ray et al 2014); the CVRP model with fuel consumption optimisation (Xiao et al 2012); the VRP with Time Windows (Jabali et al 2015;Savelsbergh 1985); and the three-dimensional loading Capacitated VRP (Junqueira & Morabito 2015). Also, because of its computational non-deterministic polynomial-time hardness (NP-hard complexity), diverse algorithms have been developed to solve the CVRP to near-optimality.…”

Section: Literature Reviewmentioning

confidence: 99%

Capacitated vehicle routing problem model for carriers

Rojas-Cuevas

Caballero‐Morales

Martínez‐Flores

et al. 2018

J. transp. supply chain manag.

View full text Add to dashboard Cite

Background: The Capacitated Vehicle Routing Problem (CVRP) is one of the most important transportation problems in logistics and supply chain management. The standard CVRP considers a fleet of vehicles with homogeneous capacity that depart from a warehouse, collect products from (or deliver products to) a set of customer locations (points) and return to the same warehouse. However, the operation of carrier companies and third-party transportation providers may follow a different network flow for collection and delivery. This may lead to non-optimal route planning through the use of the standard CVRP.Objective: To propose a model for carrier companies to obtain optimal route planning.Method: A Capacitated Vehicle Routing Problem for Carriers (CVRPfC) model is used to consider the distribution scenario where a fleet of vehicles depart from a vehicle storage depot, collect products from a set of customer points and deliver them to a specific warehouse before returning to the vehicle storage depot. Validation of the model’s functionality was performed with adapted CVRP test problems from the Vehicle Routing Problem LIBrary. Following this, an assessment of the model’s economic impact was performed and validated with data from a real carrier (real instance) with the previously described distribution scenario.Results: The route planning obtained through the CVRPfC model accurately described the network flow of the real instance and significantly reduced its distribution costs.Conclusion: The CVRPfC model can thus improve the competitiveness of the carriers by providing better fares to their customers, reducing their distribution costs in the process.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Capacitated vehicle routing problem model for carriers

Rojas-Cuevas

Caballero‐Morales

Martínez‐Flores

et al. 2018

J. transp. supply chain manag.

View full text Add to dashboard Cite

show abstract

“…In the literature, vehicle routing problems can be structured differently according to various constraints, such as capacitated VRP [120][121][122][123][124][125][126], the VRP with heterogeneous fleet of vehicles [127], open VRP [128][129][130][131], VRP with time windows [132][133][134][135][136][137][138], VPR with both pick-up and delivery [139][140][141][142][143][144], location routing problem [145][146][147], period VRP [148][149][150][151], multidepot VRP [152][153][154][155][156], VRP with backhaul [157][158][159], inventory routing problem [160][161][162][163], dynamic VRP [164], or the mixture [165][166]…”

Section: Vrpmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

“…In the automotive sector, the FTL strategy led to overdeliveries (serve in advance), as stated Garcia-Sabater et al [4] in the case of motors distribution planning. Liu et al [9] present 2-phase heuristic algorithms for the full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, but the consideration of different packaging for different products is not considered. Arunparam et al [10] propose an algorithm for solving an integer-programming formulation of this vehicle-routing problem with full truckloads, but as in [9], a complex routing problem is considered.…”

Section: Introductionmentioning

confidence: 99%

“…Liu et al [9] present 2-phase heuristic algorithms for the full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, but the consideration of different packaging for different products is not considered. Arunparam et al [10] propose an algorithm for solving an integer-programming formulation of this vehicle-routing problem with full truckloads, but as in [9], a complex routing problem is considered. In the literature review, Boysen and Fliedner [3] offer an interesting literature review about cross-docking problems, but in our case study, only direct shipment by the FTL strategy must be considered.…”

Section: Introductionmentioning

confidence: 99%

A Mixed-Integer Linear Programming Model for Transportation Planning in the Full Truck Load Strategy to Supply Products with Unbalanced Demand in the Just in Time Context: A Case Study

Maheut¹,

García-Sabater²

2013

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract. Growing awareness in cutting transport costs and minimizing the environmental impact means that companies are increasingly interested in using the full truck load strategy in their supply tasks. This strategy consists of filling trucks completely with one product type or a mixture of products from the same supplier. This paper aims to propose a mixed-integer linear programming model and procedure to fill trucks which considers limitations of stocks, stock levels and unbalanced demand and minimization of the total number of trucks used in the full truck load strategy. The results obtained from a case study are presented and are exported in a conventional spreadsheet available for a company in the automotive industry.

show abstract

Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

Cited by 78 publications

References 21 publications

Capacitated vehicle routing problem model for carriers

Capacitated vehicle routing problem model for carriers

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

A Mixed-Integer Linear Programming Model for Transportation Planning in the Full Truck Load Strategy to Supply Products with Unbalanced Demand in the Just in Time Context: A Case Study

Contact Info

Product

Resources

About