A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run

DOI10.1155/2015/404868zbMath1394.90103OpenAlexW2096950144WikidataQ59118487 ScholiaQ59118487MaRDI QIDQ1665593

Zheyong Bian, Tianyi Xu, Yu Lin

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/404868

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Pareto's law
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• The vehicle routing problem: An overview of exact and approximate algorithms
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Mutation ant colony algorithm of milk-run vehicle routing problem with fastest completion time based on dynamic optimization
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Formulations and exact algorithms for the vehicle routing problem with time windows
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• The Truck Dispatching Problem
• A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• An Integrated Inventory Allocation and Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

This page was built for publication: A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run