The Single Row Routing Problem Revisited: A Solution Based on Genetic Algorithms

ISSN： 1065-514X

Source： VLSI Design, Vol.14, Iss.2, 2002-01, pp. : 123-141

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem

By Zomaya Albert Y. Patterson Daniel Olariu Stephan

Cluster Computing, Vol. 7, Iss. 2, 2004-04 ,pp. : 123-139

Springer Publishing Company

Access to resources Recommend Favorite

Grouping genetic algorithms for a bi-objective inventory routing problem

By Sadok Abdeljawed

International Journal of Multicriteria Decision Making, Vol. 3, Iss. 2-3, 2013-05 ,pp. : 256-276

Inderscience Publishers

Access to resources Recommend Favorite

Solution algorithms for the capacitated single allocation hub location problem

By Ernst A.T. Krishnamoorthy M.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 141-159

Springer Publishing Company

Access to resources Recommend Favorite

A Decision Model Based on a GRASP Genetic Algorithm for Solving the Vehicle Routing Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 9, Iss. 2, 2018-04 ,pp. : 72-90

IGI Global_journal

Access to resources Recommend Favorite

Shadow price based genetic algorithms for the cutting stock problem

By Shen Gang Zhang Yan-Qing

International Journal of Artificial Intelligence and Soft Computing, Vol. 3, Iss. 1, 2012-07 ,pp. : 50-69

Inderscience Publishers

Access to resources Recommend Favorite