Route optimization cold chain logistic distribution using greedy search method

DOI10.1007/S12597-020-00459-4OpenAlexW3034951753MaRDI QIDQ2656558

Kwasi Boateng, Martinson Yeboah Appiah, Xiong Qiang, Frederick VonWolff Appiah

Publication date: 11 March 2021

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-020-00459-4

zbMATH Keywords

optimizationtravelling salesman problemcold-logisticsgreedy search method

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• VRP

Cites Work

• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• A mixed constrained (identical) vehicle routing problem for time minimisation
• The vehicle routing problem: An overview of exact and approximate algorithms
• A monarch butterfly optimization for the dynamic vehicle routing problem
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
• The classification of greedy algorithms
• A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
• Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Vehicle routing problems with simultaneous pick-up and delivery service.

This page was built for publication: Route optimization cold chain logistic distribution using greedy search method