A two-phase tabu search approach to the location routing problem
From MaRDI portal
Publication:1610130
DOI10.1016/S0377-2217(98)00107-6zbMath1009.90056OpenAlexW1989974478MaRDI QIDQ1610130
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00107-6
Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (71)
A hybrid clonal selection algorithm for the location routing problem with stochastic demands ⋮ Distribution network design on the battlefield ⋮ A survey of recent research on location-routing problems ⋮ A survey of variants and extensions of the location-routing problem ⋮ A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem ⋮ Simulated annealing heuristic for the general share-a-ride problem ⋮ An urban transportation problem solved by parallel programming with hyper-heuristics ⋮ The latency location-routing problem ⋮ Location-routing: issues, models and methods ⋮ A solution method for a two-layer sustainable supply chain distribution model ⋮ A survey on two-echelon routing problems ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Battery swap station location-routing problem with capacitated electric vehicles ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ A simple and effective evolutionary algorithm for the capacitated location-routing problem ⋮ A simulated annealing heuristic for the open 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 ⋮ The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking ⋮ A dynamic logistics coordination model for evacuation and support in disaster response activities ⋮ Solving a rich vehicle routing and inventory problem using column generation ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ Bifactor approximation for location routing with vehicle and facility capacities ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ Column generation based heuristics for a generalized location routing problem with profits arising in space exploration ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Multi-objective sustainable capacitated location routing problem formulation in sustainable supply-chain management ⋮ The location routing problem with facility sizing decisions ⋮ Effective metaheuristics for the latency location routing problem ⋮ Planning a capacitated road network with flexible travel times: a genetic algorithm ⋮ A Branch-and-Cut method for the Capacitated Location-Routing Problem ⋮ Electric vehicles fast charger location-routing problem under ambient temperature ⋮ Neighborhood search heuristics for the uncapacitated facility location problem ⋮ A survey of the standard location-routing problem ⋮ An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ Resource planning and a depot location model for electric power restoration. ⋮ Solving the capacitated location-routing problem. Abstract of Thesis ⋮ Ant colony optimization with clustering for solving the dynamic location routing problem ⋮ A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case ⋮ Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ A tabu search approach for the livestock collection problem ⋮ Solving a bi-objective transportation location routing problem by metaheuristic algorithms ⋮ 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 hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Bounds for the single source modular capacitated plant location problem ⋮ Solving the uncapacitated facility location problem using tabu search ⋮ A metaheuristic to solve a location-routing problem with nonlinear costs ⋮ A GRASP\(\times \)ELS approach for the capacitated location-routing problem ⋮ Unnamed Item ⋮ Distribution network design: New problems and related models ⋮ Distribution systems design with two-level routing considerations ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ A computational comparison of flow formulations for the capacitated location-routing problem ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Combined location-routing problems -- a neural network approach ⋮ Facility location and supply chain management. A review ⋮ The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads ⋮ Sustainable multi-depot emergency facilities location-routing problem with uncertain information ⋮ A taxonomical analysis, current methods and objectives on location-routing problems
Uses Software
Cites Work
- Vehicle routing considerations in distribution system design
- A comparative study of heuristics for a two-level routing-location problem
- An exact algorithm for minimizing routing and operating costs in depot location
- A user's guide to tabu search
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Bandwidth Packing: A Tabu Search Approach
- Computer Solutions of the Traveling Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A two-phase tabu search approach to the location routing problem
