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

DOI10.1016/j.cor.2009.08.002zbMath1177.90040OpenAlexW2068410940MaRDI QIDQ1046714

Ran Liu, Xiao Liu, Feng Chen, Zhibin Jiang, Richard Ying Kit Fung

Publication date: 22 December 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.08.002

zbMATH Keywords

lower boundheuristiccollaborative transportationmulti-depotfull truckloads

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Effective truckload dispatch decision methods with incomplete advance load information ⋮ An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization ⋮ A methodology to exploit profit allocation in logistics joint distribution network optimization ⋮ The joint network vehicle routing game with optional customers ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ Collaborative vehicle routing: a survey ⋮ An on-demand same-day delivery service using direct peer-to-peer transshipment strategies ⋮ Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ Interaction between intelligent agent strategies for real-time transportation planning

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Competitive memetic algorithms for arc routing problems
• Shipper collaboration
• A deterministic tabu search algorithm for the capacitated arc routing problem
• Routeing winter gritting vehicles
• New savings based algorithms for time constrained pickup and delivery of full truckloads.
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Capacitated arc routing problems
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• Improvement Procedures for the Undirected Rural Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration