A new formulation approach for location-routing problems
From MaRDI portal
Publication:264241
DOI10.1007/s11067-011-9170-yzbMath1332.90142OpenAlexW2137115284MaRDI QIDQ264241
Hunkar Toyoglu, Bahar Yetis Kara, Oya Ekin Karaşan
Publication date: 31 March 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/11931
Mixed integer programming (90C11) Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (10)
A joint replenishment inventory-location model ⋮ A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service ⋮ Sustainability SI: logistics cost and environmental impact analyses of urban delivery consolidation strategies ⋮ Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia ⋮ Robust facility location problem for hazardous waste transportation ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization ⋮ Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic ⋮ A blood bank network design problem with integrated facility location, inventory and routing decisions ⋮ A taxonomical analysis, current methods and objectives on location-routing problems
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Using clustering analysis in a capacitated location-routing problem
- A dynamic logistics coordination model for evacuation and support in disaster response activities
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A GIS-based optimization framework for competitive multi-facility location-routing problem
- The effect of ignoring routes when locating depots
- An exact algorithm for minimizing routing and operating costs in depot location
- Planning models for freight transportation
- Combined location-routing problems: A synthesis and future research directions
- A heuristic solution to the warehouse location-routing problem
- Heuristic solutions to multi-depot location-routing problems
- Distribution network design: New problems and related models
- Designing radio-mobile access networks based on synchronous digital hierarchy rings
- A compact model and tight bounds for a combined location-routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- An Exact Method for the Capacitated Location-Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Distribution network design on the battlefield
- Integer Programming Formulation of Traveling Salesman Problems
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Dynamic Location-routeing Problems
This page was built for publication: A new formulation approach for location-routing problems
