Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time

DOI10.1007/S11067-017-9369-7OpenAlexW2295153992MaRDI QIDQ2005829FDOQ2005829

Onwasa Kobkiattawin, Chi Xie, Ampol Karoonsoontawong

Publication date: 8 October 2020

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-017-9369-7

zbMATH Keywords

inventory routing probleminsertion heuristicmulti trip

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Inter-school bus scheduling under stochastic travel times
• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
• Travel time reliability in vehicle routing and scheduling with time windows
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• Selective and periodic inventory routing problem for waste vegetable oil collection
• Industrial aspects and literature survey: Combined inventory management and routing
• Delivery strategies for blood products supplies
• A Combined Vehicle Routing and Inventory Allocation Problem
• Vehicle Routeing with Multiple Use of Vehicles
• A Periodic Inventory Routing Problem at a Supermarket Chain
• Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
• Alternative Inventory and Distribution Policies of a Food Manufacturer
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times

Cited In (1)

• A blood bank network design problem with integrated facility location, inventory and routing decisions

This page was built for publication: Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005829)