A pseudo-parallel genetic algorithm integrating simulated annealing for stochastic location-inventory-routing problem with consideration of returns in e-commerce

DOI10.1155/2015/586581zbMath1418.90019OpenAlexW2074451290WikidataQ59106018 ScholiaQ59106018MaRDI QIDQ1723412

Xiang Liu, Hui Chen, Bailing Liu, Yanhui Li

Publication date: 19 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/586581

Mathematics Subject Classification ID

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

Related Items (2)

Location‐routing problem: a classification of recent research ⋮ Solving a closed-loop location-inventory-routing problem with mixed quality defects returns in e-commerce by hybrid ant colony optimization algorithm

Cites Work

• Reverse logistics network design with stochastic lead times
• Location-routing: issues, models and methods
• Incorporating inventory and routing costs in strategic location models
• On genetic algorithms for the packing of polygons
• The design of reverse distribution networks: Models and solution procedures
• Return handling options and order quantities for single period products.
• A two-stage algorithm for the closed-loop location-inventory problem model considering returns in E-commerce
• Modeling and optimization of stochastic joint replenishment and delivery scheduling problem with uncertain costs
• Network Models and Optimization
• Inventory routing problems: a logistical overview

This page was built for publication: A pseudo-parallel genetic algorithm integrating simulated annealing for stochastic location-inventory-routing problem with consideration of returns in e-commerce