Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
From MaRDI portal
Publication:2514738
DOI10.1016/j.ejor.2013.12.021zbMath1304.90042MaRDI QIDQ2514738
Carsten Ehrenberg, Julia Rieck, Jürgen Zimmermann
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.021
genetic algorithm; mixed-integer linear programming; location-routing; fix-and-optimize; inter-hub transport; multi-commodity pickup-and-delivery
90C11: Mixed integer programming
90B06: Transportation, logistics and supply chain management
90B80: Discrete location and assignment
Related Items
Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, Location‐routing problem: a classification of recent research, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm, Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach, A branch-and-cut algorithm for the hub location and routing problem, Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages, Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations, A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms, A column generation approach for location-routing problems with pickup and delivery, Perspectives on modeling hub location problems, The capacitated directed cycle hub location and routing problem under congestion, The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches, Inbound and outbound flow integration for cross-docking operations, A survey of variants and extensions of the location-routing problem, A capacitated hub location problem in freight logistics multimodal networks, Planning and design of intermodal hub networks: a literature review, Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for location routing
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A hybrid evolutionary algorithm for the periodic location-routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Location-routing: issues, models and methods
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
- Using clustering analysis in a capacitated location-routing problem
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- A comparative study of heuristics for a two-level routing-location problem
- Optimizing solid waste collection in Brussels
- The many-to-many location-routing problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Combined location-routing problems: A synthesis and future research directions
- Restructuring of Swiss parcel delivery services
- 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 computational comparison of flow formulations for the capacitated location-routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A compact model and tight bounds for a combined location-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
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A hub location problem in designing digital data service networks: Lagrangian relaxation approach
