A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost

DOI10.1155/2015/428925zbMath1394.90102OpenAlexW1580511489WikidataQ59118554 ScholiaQ59118554MaRDI QIDQ1665650

Yu Lin, Zheyong Bian, Tianyi Xu, Shujing Sun

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/428925

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A genetic algorithm for the vehicle routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• A hybrid genetic algorithm for the multiple crossdocks problem
• 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
• An improved ant colony optimization for vehicle routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Tabu Search Heuristic for the Vehicle Routing Problem
• The General Pickup and Delivery Problem

This page was built for publication: A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost