An endosymbiotic evolutionary algorithm for the hub location-routing problem

DOI10.1155/2015/525980zbMath1394.90397OpenAlexW1605172996WikidataQ59118859 ScholiaQ59118859MaRDI QIDQ1665926

Ji Ung Sun

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/525980

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (2)

Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ Location‐routing problem: a classification of recent research

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Location-routing: issues, models and methods
• The Hamiltonian p-median problem
• A large scale location-allocation problem in the natural rubber industry
• The many-to-many location-routing problem
• The hub location and routing problem
• A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
• Restructuring of Swiss parcel delivery services
• Heuristic solutions to multi-depot location-routing problems
• 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 endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed-model U-lines
• An endosymbiotic evolutionary algorithm for optimization

This page was built for publication: An endosymbiotic evolutionary algorithm for the hub location-routing problem