Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
From MaRDI portal
Publication:1991177
DOI10.1016/j.ejor.2018.06.038zbMath1403.90077OpenAlexW2811315911WikidataQ129621222 ScholiaQ129621222MaRDI QIDQ1991177
Farzad Dehghanian, Majid Salari, Mozhde Bagheri Hosseini
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.038
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system, Location‐routing problem: a classification of recent research, Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems, Logistics planning of cash transfer to Syrian refugees in Turkey
Cites Work
- A survey of recent research on location-routing problems
- Incentive strategies for an optimal recovery program in a closed-loop supply chain
- The latency location-routing problem
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Retail-collection network design under deposit-refund
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Incentive and production decisions for remanufacturing operations
- The effect of ignoring routes when locating depots
- Combined location-routing problems: A synthesis and future research directions
- A heuristic solution to the warehouse location-routing problem
- A linearization method for mixed 0--1 polynomial programs
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Projection results for vehicle routing
- A survey of variants and extensions of the location-routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- An Exact Method for the Capacitated Location-Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Integer Programming Formulation of Traveling Salesman Problems
- A branch-and-cut algorithm for the plant-cycle location problem
- Solution of a Large-Scale Traveling-Salesman Problem
