A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines

DOI10.1016/J.COR.2017.03.010zbMath1458.90024OpenAlexW2601921726MaRDI QIDQ1652346

Alejandro Cataldo, Leandro C. Coelho, Homero Larrain

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.010

zbMATH Keywords

optimizationneighborhood searchautomated Teller machinescash industry

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (12)

Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem ⋮ A cash transportation vehicle routing problem with combinations of different cash denominations ⋮ Challenges for ATM management in times of market variability caused by the COVID-19 pandemic crisi ⋮ The inventory routing problem with demand moves ⋮ The dynamic-demand joint replenishment problem with approximated transportation costs ⋮ Flexible two-echelon location routing problem ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ Exact solution methods for the multi-period vehicle routing problem with due dates ⋮ The two-echelon production-routing problem ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ Replenishment and denomination mix of automated teller machines with dynamic forecast demands ⋮ Operational research and artificial intelligence methods in banking

Uses Software

• FEASPUMP
• VRP
• CVRPSP

Cites Work

• Heuristics for dynamic and stochastic inventory-routing
• The exact solution of several classes of inventory-routing problems
• Analysis of the maximum level policy in a production-distribution system
• Restrict-and-relax search for 0-1 mixed-integer programs
• RENS. The optimal rounding
• On practical resource allocation for production planning and scheduling with period overlapping setups
• Variable neighborhood search
• Local branching
• The inventory-routing problem with transshipment
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Industrial aspects and literature survey: Combined inventory management and routing
• A feasibility pump heuristic for general mixed-integer problems
• The feasibility pump
• Modeling inventory routing problems in supply chains of high consumption products
• A new ILP-based refinement heuristic for vehicle routing problems
• A Hybrid Heuristic for an Inventory Routing Problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A genetic algorithm approach to the integrated inventory-distribution problem
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines