Planning a capacitated road network with flexible travel times: a genetic algorithm
DOI10.1007/s10852-015-9277-0zbMath1330.90018OpenAlexW214956078MaRDI QIDQ894559
Saber Shiripour, Iraj Mahdavi, Nezam Mahdavi-Amiri
Publication date: 1 December 2015
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-015-9277-0
genetic algorithmmixed integer nonlinear programmingcapacitated location-multi allocation-routing problemflexible travel times
Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Multi-objective discrete urban road network design
- Optimizing reserve capacity of urban road networks in a discrete network design problem
- Hub location-allocation in intermodal logistic networks
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Minisum location problem with farthest Euclidean distances
- A generalized Weiszfeld method for the multi-facility location problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- Reducibility among Combinatorial Problems
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
This page was built for publication: Planning a capacitated road network with flexible travel times: a genetic algorithm
