A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery

DOI10.3390/a12080158zbMath1461.68256OpenAlexW2965566565MaRDI QIDQ2005557

Napoleão Nepomuceno, Ricardo Barboza Saboia, Placido Rogerio Pinheiro

Publication date: 8 October 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12080158

zbMATH Keywords

vehicle routing problemrandomized algorithmsgreedy algorithms

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• When the greedy algorithm fails
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service