z-logo
open-access-imgOpen Access
Nearest L- Neighbor Method with De-crossing in Vehicle Routing Problem
Author(s) -
Hwan–Seong Kim,
Hoang-Son Tran-Ngoc
Publication year - 2009
Publication title -
journal of navigation and port research
Language(s) - English
Resource type - Journals
eISSN - 2093-8470
pISSN - 1598-5725
DOI - 10.5394/kinpr.2009.33.2.143
Subject(s) - vehicle routing problem , computation , computer science , scheduling (production processes) , routing (electronic design automation) , mathematical optimization , string (physics) , k nearest neighbors algorithm , algorithm , computer network , mathematics , artificial intelligence , mathematical physics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom