An effective genetic algorithm approach to multiobjective routing problems (MORPs)

DOI10.1016/j.amc.2003.10.058zbMath1060.65606OpenAlexW2028412498MaRDI QIDQ1774881

A. A. Mousa, Mahmoud A. Abo-Sinna, Mohamed Sayed Ali Osman

Publication date: 4 May 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.10.058

zbMATH Keywords

Genetic algorithmDynamic programmingcomputational efficiencyMultiobjective optimizationMultiobjective routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Complexity and performance of numerical algorithms (65Y20)

Related Items (10)

An algorithm for decomposing the parametric space in multiobjective dynamic programming problems ⋮ Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem ⋮ An improved ant colony optimization for vehicle routing problem ⋮ A simulated annealing for multi-criteria network path problems ⋮ A personalized urban multicriteria shortest path stochastic optimization algorithm ⋮ Rough approximation-based approach for designing a personalized tour route under a fuzzy environment ⋮ A new genetic algorithm for solving nonconvex nonlinear programming problems ⋮ Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering ⋮ An effective genetic algorithm approach to large scale mixed integer programming problems ⋮ The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An effective genetic algorithm approach to multiobjective routing problems (MORPs)