A hybrid genetic algorithm for the Hamiltonian p‐median problem
From MaRDI portal
Publication:6196877
DOI10.1002/NET.22197MaRDI QIDQ6196877FDOQ6196877
Authors: Pengfei He, Jin-Kao Hao, Qinghua Wu 
Publication date: 15 March 2024
Published in: Networks (Search for Journal in Brave)
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
- Benchmarking optimization software with performance profiles.
- 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
- The \(p\)-median problem: a survey of metaheuristic approaches
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Hamiltonian location problems
- The Hamiltonian \(p\)-median problem
- A new variant of a vehicle routing problem: Lower and upper bounds
- Algorithms for the design of network topologies with balanced disjoint rings
- The granular tabu search and its application to the vehicle-routing problem
- New models for and numerical tests of the Hamiltonian \(p\)-median problem
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- A comparison of several models for the Hamiltonian \(p\)-median problem
- A new formulation of the Hamiltonian \(p\)-median problem
- The Hamiltonian p-median problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Technical Note—An Algorithm for the p-Median Problem
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits
- Hybrid evolutionary search for the traveling repairman problem with profits
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
- 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
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)
