A hybrid genetic algorithm for the Hamiltonian p‐median problem

DOI10.1002/NET.22197MaRDI QIDQ6196877zbMATH OpenFDO

Authors Pengfei He, Jin-Kao Hao, Qinghua Wu

Publication date 15 March 2024

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/NET.22197

zbMATH Keywords

\(p\)-medianedge assembly crossoverlocal searchmemetic searchmetaheuristictraveling salesman

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
• A branch-and-price algorithm for solving the Hamiltonian p-median problem
• A comparison of several models for the Hamiltonian \(p\)-median problem
• New models for and numerical tests of the Hamiltonian p-median problem
• The Hamiltonian p-median problem

Cites work

• A branch-and-price algorithm for solving the Hamiltonian p-median problem
• A comparison of several models for the Hamiltonian \(p\)-median problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A new formulation of the Hamiltonian p-median problem
• A new variant of a vehicle routing problem: Lower and upper bounds
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A unified solution framework for multi-attribute vehicle routing problems
• Algorithms for the design of network topologies with balanced disjoint rings
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits
• Benchmarking optimization software with performance profiles.
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
• Hamiltonian location problems
• Hybrid evolutionary search for the traveling repairman problem with profits
• Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
• New models for and numerical tests of the Hamiltonian p-median problem
• Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
• Technical Note—An Algorithm for the p-Median Problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• The granular tabu search and its application to the vehicle-routing problem
• The Hamiltonian \(p\)-median problem
• The Hamiltonian p-median problem

Cited in

(2)

• Capacitated profitable tour problem with cross-docking
• On location-routing formulations for the Hamiltonian p-median problem

This page was built for publication: A hybrid genetic algorithm for the Hamiltonian p‐median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196877)