Planning a capacitated road network with flexible travel times: a genetic algorithm

DOI10.1007/S10852-015-9277-0zbMATH Open1330.90018OpenAlexW214956078MaRDI QIDQ894559FDOQ894559

Saber Shiripour, Nezam Mahdavi-Amiri, Iraj Mahdavi

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

Recommendations

• Modeling and algorithms for capacitated transportation networks with population-dependent travel times
• A dynamic vehicle routing problem with time-dependent travel times
• Multiperiod capacity expansion of road networks: Formulation and algorithms
• Multi-objective discrete urban road network design
• The multiple server location problem

zbMATH Keywords

genetic algorithmmixed integer nonlinear programmingcapacitated location-multi allocation-routing problemflexible travel times

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Reducibility among Combinatorial Problems
• Heuristic solutions to multi-depot location-routing problems
• A metaheuristic to solve a location-routing problem with nonlinear costs
• Multi-objective discrete urban road network design
• Hub location-allocation in intermodal logistic networks
• New genetic algorithms based approaches to continuous \(p\)-median problem
• A generalized Weiszfeld method for the multi-facility location problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A two-phase tabu search approach to the location routing problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms
• Optimizing reserve capacity of urban road networks in a discrete network design problem
• Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
• Minisum location problem with farthest Euclidean distances

Cited In (3)

• Title not available (Why is that?)
• Optimization of a highway project planning using a modified genetic algorithm
• Interval-Valued Goal Programming Method to Solve Patrol Manpower Planning Problem for Road Traffic Management Using Genetic Algorithm

This page was built for publication: Planning a capacitated road network with flexible travel times: a genetic algorithm

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