A hybrid genetic algorithm for the Hamiltonian p‐median problem

Cites Work

Unnamed Item
Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
The \(p\)-median problem: a survey of metaheuristic approaches
The Hamiltonian p-median problem
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Hamiltonian location problems
The Hamiltonian \(p\)-median problem
A new variant of a vehicle routing problem: Lower and upper bounds
Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
A simple and effective evolutionary algorithm for the vehicle routing problem
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
Hybrid evolutionary search for the traveling repairman problem with profits
Algorithms for the design of network topologies with balanced disjoint rings
A unified solution framework for multi-attribute vehicle routing problems
Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
New Models for and Numerical Tests of the Hamiltonian p-Median Problem
Technical Note—An Algorithm for the 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
Benchmarking optimization software with performance profiles.
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