A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms

DOI10.1016/j.cor.2018.07.022zbMath1458.90092OpenAlexW2884058301WikidataQ57517475 ScholiaQ57517475MaRDI QIDQ1782170

Tom Van Woensel, Stefan Minner, Nader Ghaffari-Nasab

Publication date: 18 September 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/f5c90d8d-4af0-4517-a6eb-65ebefcc694d

zbMATH Keywords

transportationWeiszfeld algorithmcontinuous approximationparticle swarm optimizationhub location-routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

Competitive multiple allocation hub location problem considering primary and backup routes ⋮ A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ Location‐routing problem: a classification of recent research ⋮ Smart and sustainable city logistics: design, consolidation, and regulation

Uses Software

• MPT
• VRP

Cites Work

• Unnamed Item
• An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
• A branch-and-cut algorithm for the hub location and routing problem
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• Incorporating inventory and routing costs in strategic location models
• The general optimal market area model
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• The vehicle routing problem: An overview of exact and approximate algorithms
• Planning models for freight transportation
• The many-to-many location-routing problem
• The hub location and routing problem
• A new formulation and an exact approach for the many-to-many hub location-routing problem
• A review of particle swarm optimization. I: Background and development
• A new particle swarm optimization for the open shop scheduling problem
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• The Euclidean Multifacility Location Problem
• ON THE AIRLINE HUB PROBLEM : THE CONTINUOUS MODEL
• Scheduling, Location, Transportation, and Continuum Mechanics: Some Simple Approximations to Optimization Problems
• Euclidean Hub-and-Spoke Networks
• Link-Length Minimization in Networks
• Continuum approximation techniques for the design of integrated package distribution systems

This page was built for publication: A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms