Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
type: Item
instance of: scholarly article
title: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
zbMATH Open document ID: 1177.90040
author: Ran Liu
author: Zhibin Jiang
author: Feng Chen
author: X. Liu
author: Richard Y. K. Fung
published in: Computers \& Operations Research
publication date: 2009-12-22T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5651582
zbMATH Keywords: collaborative transportation
zbMATH Keywords: multi-depot
zbMATH Keywords: full truckloads
zbMATH Keywords: lower bound
zbMATH Keywords: heuristic
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2009.08.002
OpenAlex ID: W2068410940
cites work: Shipper collaboration
cites work: Capacitated arc routing problems
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Q5687196
cites work: Q5287166
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: Q4510100
cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
cites work: Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
cites work: Improvement Procedures for the Undirected Rural Postman Problem
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: Competitive memetic algorithms for arc routing problems
cites work: Q4350080
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: Routeing winter gritting vehicles
cites work: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: New savings based algorithms for time constrained pickup and delivery of full truckloads.
DOI: 10.1016/J.COR.2009.08.002
Recommended article: A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Recommended article: Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
Recommended article: A heuristic algorithm for the multi-depot periodic vehicle routing problem
Recommended article: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
Recommended article: Heuristic solution approaches for the cumulative capacitated vehicle routing problem
Recommended article: A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock
Recommended article: A tabu search heuristic for the multi-depot vehicle routing problem
Recommended article: A novel two-phase heuristic method for vehicle routing problem with backhauls
Recommended article: Q3217886
Recommended article: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
description: scientific article; zbMATH DE number 5651582