A large neighborhood search heuristic for supply chain network design

DOI10.1016/J.COR.2016.11.012zbMath1391.90057OpenAlexW2547427226MaRDI QIDQ1652183

Pierre Dejax, Olivier Péton, Majid Eskandarpour

Publication date: 11 July 2018

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

Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/a-large-neighborhood-search-heuristic-for-supply-chain-network-design(cb61dfd7-4d77-4518-9de7-0725aeabfe4b).html

zbMATH Keywords

facility locationlarge neighborhood searchsupply chain network design

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (9)

A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ A multi-stage supply chain network design problem with in-house production and partial product outsourcing

Cites Work

• Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
• Supply chain management in forestry -- case studies at Södra cell AB
• A closed-loop logistic model with a spanning-tree based genetic algorithm
• An integrated model for logistics network design
• A general heuristic for vehicle routing problems
• Facility location and supply chain management. A review
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
• A combined facility location and network design problem with multi-type of capacitated links
• Record breaking optimization results using the ruin and recreate principle
• A bi-objective reverse logistics network analysis for post-sale service
• A memetic algorithm for bi-objective integrated forward/reverse logistics network design
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Handbook of metaheuristics

This page was built for publication: A large neighborhood search heuristic for supply chain network design