Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network

DOI10.1007/S13369-017-2957-5zbMath1390.90082OpenAlexW2769986218MaRDI QIDQ1640629

Tarit Rattanamanee, Suebsak Nanthavanij, Veeris Ammarapala

Publication date: 14 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-017-2957-5

zbMATH Keywords

arrival conflictscollaborative logistics networkmulti-supplier vehicle routing problemvehicle dispatching policy

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Uses Software

• VRP

Cites Work

• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• Vehicle routing problem for fashion supply chains with cross-docking
• Optimizing departure times in vehicle routes
• The vehicle routing problem with flexible time windows and traveling times
• Vehicle routing with cross-dock selection
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• Vehicle routing under time-dependent travel times: the impact of congestion avoidance
• A genetic algorithm for the vehicle routing problem
• A heuristic and lower bound for a multi-depot routing problem
• Time dependent vehicle routing problem with a multi ant colony system
• The Vehicle Routing Problem
• Vehicle routing with cross-docking

This page was built for publication: Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network