A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
From MaRDI portal
Publication:713116
DOI10.1016/j.ejor.2011.01.003zbMath1250.90019OpenAlexW2021787417MaRDI QIDQ713116
Fulya Altiparmak, Imdat Kara, Ismail Karaoglan, Berna Dengiz
Publication date: 26 October 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.01.003
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A new formulation approach for location-routing problems, 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, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Route optimization cold chain logistic distribution using greedy search method, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, A fuzzy correlation based heuristic for dual-mode integrated location routing problem, A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem, Location‐routing problem: a classification of recent research, A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup, Multiperiod location-routing with decoupled time scales, Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization, A column generation approach for location-routing problems with pickup and delivery, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, Integrated Network Design and Routing: An Application in the Timber Trade Industry, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, The multi-vehicle probabilistic covering tour problem, The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads, A taxonomical analysis, current methods and objectives on location-routing problems, Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
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
- 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
- The effect of ignoring routes when locating depots
- A result on projection for the vehicle routing problem
- An exact algorithm for minimizing routing and operating costs in depot location
- Hamiltonian location problems
- The many-to-many location-routing problem
- 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
- A two-phase tabu search approach to the location routing problem
- Distribution network design: New problems and related models
- A compact model and tight bounds for a combined location-routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Projection results for vehicle routing
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A survey of simulated annealing as a tool for single and multiobjective optimization
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A branch-and-cut algorithm for the plant-cycle location problem
- The pickup delivery location problem on networks
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
