A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run
Summary: High frequency and small lot size are characteristics of milk runs and are often used to implement the just-in-time (JIT) strategy in logistical systems. The common frequency problem, which simultaneously involves planning of the route and frequency, has been extensively researched in milk run systems. In addition, vehicle type choice in the milk run system also has a significant influence on the operating cost. Therefore, in this paper, we simultaneously consider vehicle routing planning, frequency planning, and vehicle type choice in order to optimize the sum of the cost of transportation, inventory, and dispatch. To this end, we develop a mathematical model to describe the common frequency problem with vehicle type choice. Since the problem is NP hard, we develop a two-phase heuristic algorithm to solve the model. More specifically, an initial satisfactory solution is first generated through a greedy heuristic algorithm to maximize the ratio of the superior arc frequency to the inferior arc frequency. Following this, a tabu search (TS) with limited search scope is used to improve the initial satisfactory solution. Numerical examples with different sizes establish the efficacy of our model and our proposed algorithm.
- A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost
- Milk run optimization with delivery windows and hedging against uncertainty
- A Heuristic for the Periodic Vehicle Routing Problem
- Study on multi-depot collaborative transportation problem of milk-run pattern
- An improved heuristic for the period vehicle routing problem
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Integrated Inventory Allocation and Vehicle Routing Problem
- Formulations and exact algorithms for the vehicle routing problem with time windows
- scientific article; zbMATH DE number 3068126 (Why is no real title available?)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Mutation ant colony algorithm of milk-run vehicle routing problem with fastest completion time based on dynamic optimization
- Pareto's law
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- The truck dispatching problem
- The vehicle routing problem: An overview of exact and approximate algorithms
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665593)
