Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time
type: Item
instance of: scholarly article
title: Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time
author: Ampol Karoonsoontawong
author: Onwasa Kobkiattawin
author: Chi Xie
published in: Networks and Spatial Economics
publication date: 2020-10-08T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7258006
zbMATH Keywords: inventory routing problem
zbMATH Keywords: insertion heuristic
zbMATH Keywords: multi trip
MaRDI profile type: Publication
full work available at URL: s11067-017-9369-7
OpenAlex ID: W2295153992
cites work: Selective and periodic inventory routing problem for waste vegetable oil collection
cites work: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
cites work: Industrial aspects and literature survey: Combined inventory management and routing
cites work: Travel time reliability in vehicle routing and scheduling with time windows
cites work: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
cites work: A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
cites work: Q5687193
cites work: A Combined Vehicle Routing and Inventory Allocation Problem
cites work: A Periodic Inventory Routing Problem at a Supermarket Chain
cites work: An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
cites work: Delivery strategies for blood products supplies
cites work: Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
cites work: Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
cites work: A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
cites work: Alternative Inventory and Distribution Policies of a Food Manufacturer
cites work: Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
cites work: A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
cites work: Q3156770
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Vehicle Routeing with Multiple Use of Vehicles
cites work: Inter-school bus scheduling under stochastic travel times
cites work: A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
DOI: 10.1007/S11067-017-9369-7
description: scientific article; zbMATH DE number 7258006