A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing

DOI10.1016/j.jfranklin.2005.12.002zbMath1269.90033OpenAlexW2076990639MaRDI QIDQ357949

M. M. O. Kah, Reza Tavakkoli-Moghaddam, Nima Safaei, Masoud Rabbani

Publication date: 15 August 2013

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0016003205001171

zbMATH Keywords

simulated annealingvehicle routing problemmix-integer programmingsplit services

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (9)

Thirty years of heterogeneous vehicle routing ⋮ Cargo scheduling decision support for offshore oil and gas production: a case study ⋮ A memetic algorithm for a vehicle routing problem with backhauls ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ Vehicle routing problems with split deliveries ⋮ An adaptive memory algorithm for the split delivery vehicle routing problem ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Solving real-life vehicle routing problems efficiently using tabu search
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
• A heuristic column generation method for the heterogeneous fleet VRP
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Location Based Heuristic for General Routing Problems

This page was built for publication: A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing