An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem

From MaRDI portal
Publication:297272

DOI10.1016/j.ejor.2014.05.043zbMath1339.90015OpenAlexW2020145121MaRDI QIDQ297272

Özge Tüncel, F. Sibel Salman, Deniz Aksen, Onur Kaya

Publication date: 24 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.043




Related Items

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015The two-echelon multi-depot inventory-routing problemA variable neighborhood search based matheuristic for a waste cooking oil collection network design problemA variable neighborhood search for the multi-period collection of recyclable materialsAdaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requestsAn adaptive large neighbourhood search for asset protection during escaped wildfiresAn adaptive large neighborhood search for an E-grocery delivery routing problemCombinatorial Heuristics for Inventory Routing ProblemsThe two-echelon inventory-routing problem with fleet managementThe distributionally robust machine scheduling problem with job selection and sequence-dependent setup timesCyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demandsThe traveling purchaser problem with fast service optionA hybrid collaborative framework for integrated production scheduling and vehicle routing problem with batch manufacturing and soft time windowsOn the zero-inventory-ordering policy in the inventory routing problemA variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demandsA reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demandsA general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problemsDynamic Adaptive Large Neighborhood Search for Inventory Routing ProblemElectric vehicle routing problem with time-dependent waiting times at recharging stationsAdaptive large neighborhood search algorithm for route planning of freight buses with pickup and deliveryA metaheuristic for the time-dependent pollution-routing problemA blood bank network design problem with integrated facility location, inventory and routing decisionsA matheuristic method for the electric vehicle routing problem with time windows and fast chargersMeta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search



Cites Work