Abstract
Vehicle routing problems (VR)P are very difficult combinatorial problems which in practice often require modifications of existing algorithms and development of new ideas in order to obtain suitable solutions within acceptable solutions within acceptable periods of time. The programming lingual Mars with routing oriented built-in data types and instructions has been conceived in such a way as to enable fast development and testing of constructive and heuristic algorithms intended for solving the VRP group of problems. Development of the language has been directed towards easier writing of (meta) heuristic algorithms, distributed and parallel execution of the algorithms in the cluster/grid environment and assistance in practical VRP problem solving.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
