Multiperiod location-routing with decoupled time scales

DOI10.1016/j.ejor.2011.09.022zbMath1244.90121OpenAlexW2150660811MaRDI QIDQ439365

Elena Fernández, Maria Albareda-Sambola, Stefan Nickel

Publication date: 16 August 2012

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

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

zbMATH Keywords

locationroutingmultiperiod

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (14)

A survey of recent research on location-routing problems ⋮ Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ A survey of variants and extensions of the location-routing problem ⋮ Sequential and parallel large neighborhood search algorithms for the periodic location routing problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ The two-echelon stochastic multi-period capacitated location-routing problem ⋮ The incremental cooperative design of preventive healthcare networks ⋮ Introduction of an underground waste container system-model and solution approaches ⋮ An efficient heuristic algorithm for the alternative-fuel station location problem ⋮ Multi-period capacitated facility location under delayed demand satisfaction ⋮ Designing a two-echelon distribution network under demand uncertainty ⋮ A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

Uses Software

• CDT
• TSPLIB
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A hybrid evolutionary algorithm for the periodic location-routing problem
• 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
• Location-routing: issues, models and methods
• The capacity and distance constrained plant location problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• The multi-period incremental service facility location problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• Facility location and supply chain management. A review
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• Locating median cycles in networks
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Integer linear programming formulations of multiple salesman problems and its variations
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Multi-level supply chain network design with routing
• Integer Programming Formulation of Traveling Salesman Problems
• The Capacitated m-Ring-Star Problem
• On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
• Warehouse-Retailer Network Design Problem
• Dynamic Location-routeing Problems
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Algorithm 750: CDT
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A Metaheuristic for the Periodic Location-Routing Problem

This page was built for publication: Multiperiod location-routing with decoupled time scales